./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 .............................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:47:24,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:47:24,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:47:24,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:47:24,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:47:24,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:47:24,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:47:24,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:47:24,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:47:24,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:47:24,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:47:24,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:47:24,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:47:24,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:47:24,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:47:24,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:47:24,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:47:24,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:47:24,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:47:24,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:47:24,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:47:24,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:47:24,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:47:24,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:47:24,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:47:24,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:47:24,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:47:24,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:47:24,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:47:24,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:47:24,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:47:24,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:47:24,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:47:24,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:47:24,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:47:24,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:47:24,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:47:24,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:47:24,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:47:24,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:47:24,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:47:24,572 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:47:24,587 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:47:24,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:47:24,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:47:24,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:47:24,589 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:47:24,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:47:24,590 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:47:24,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:47:24,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:47:24,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:47:24,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:47:24,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:47:24,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:47:24,592 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:47:24,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:47:24,593 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:47:24,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:47:24,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:47:24,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:47:24,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:47:24,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:47:24,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:47:24,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:47:24,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:47:24,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:47:24,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:47:24,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:47:24,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:47:24,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-19 18:47:24,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:47:24,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:47:24,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:47:24,914 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:47:24,915 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:47:24,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-19 18:47:24,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac837179/7c2360cf06f146c4ad77b3a0e8cb23ba/FLAG8da14cb89 [2019-11-19 18:47:25,444 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:47:25,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-19 18:47:25,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac837179/7c2360cf06f146c4ad77b3a0e8cb23ba/FLAG8da14cb89 [2019-11-19 18:47:25,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac837179/7c2360cf06f146c4ad77b3a0e8cb23ba [2019-11-19 18:47:25,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:47:25,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:47:25,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:47:25,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:47:25,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:47:25,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:25" (1/1) ... [2019-11-19 18:47:25,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564d953c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:25, skipping insertion in model container [2019-11-19 18:47:25,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:25" (1/1) ... [2019-11-19 18:47:25,831 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:47:25,859 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:47:26,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:47:26,110 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:47:26,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:47:26,222 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:47:26,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26 WrapperNode [2019-11-19 18:47:26,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:47:26,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:47:26,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:47:26,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:47:26,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:47:26,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:47:26,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:47:26,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:47:26,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... [2019-11-19 18:47:26,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:47:26,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:47:26,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:47:26,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:47:26,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:47:26,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:47:26,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 18:47:26,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:47:26,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:47:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 18:47:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 18:47:26,804 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:47:26,804 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-19 18:47:26,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:26 BoogieIcfgContainer [2019-11-19 18:47:26,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:47:26,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:47:26,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:47:26,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:47:26,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:47:25" (1/3) ... [2019-11-19 18:47:26,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8bc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:26, skipping insertion in model container [2019-11-19 18:47:26,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:26" (2/3) ... [2019-11-19 18:47:26,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8bc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:26, skipping insertion in model container [2019-11-19 18:47:26,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:26" (3/3) ... [2019-11-19 18:47:26,814 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-19 18:47:26,825 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:47:26,833 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:47:26,844 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:47:26,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:47:26,871 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:47:26,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:47:26,871 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:47:26,871 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:47:26,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:47:26,872 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:47:26,872 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:47:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-19 18:47:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 18:47:26,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:26,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:26,894 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:26,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:26,899 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-19 18:47:26,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:47:26,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590426402] [2019-11-19 18:47:26,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:47:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:27,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590426402] [2019-11-19 18:47:27,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:27,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:47:27,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426410472] [2019-11-19 18:47:27,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:47:27,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:47:27,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:47:27,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:47:27,055 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-19 18:47:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:27,077 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-19 18:47:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:47:27,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-19 18:47:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:27,090 INFO L225 Difference]: With dead ends: 62 [2019-11-19 18:47:27,090 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 18:47:27,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:47:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 18:47:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-19 18:47:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 18:47:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-19 18:47:27,132 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-19 18:47:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:27,133 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-19 18:47:27,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:47:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-19 18:47:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 18:47:27,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:27,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:27,135 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-19 18:47:27,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:47:27,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140287898] [2019-11-19 18:47:27,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:47:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:27,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140287898] [2019-11-19 18:47:27,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:27,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:47:27,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309761632] [2019-11-19 18:47:27,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:47:27,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:47:27,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:47:27,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:47:27,220 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-19 18:47:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:27,328 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-19 18:47:27,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:47:27,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-19 18:47:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:27,330 INFO L225 Difference]: With dead ends: 53 [2019-11-19 18:47:27,330 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 18:47:27,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:47:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 18:47:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-19 18:47:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 18:47:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-19 18:47:27,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-19 18:47:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:27,339 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-19 18:47:27,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:47:27,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-19 18:47:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 18:47:27,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:27,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:27,341 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-19 18:47:27,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:47:27,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891990070] [2019-11-19 18:47:27,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:47:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:27,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891990070] [2019-11-19 18:47:27,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:27,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:47:27,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776584279] [2019-11-19 18:47:27,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:47:27,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:47:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:47:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:47:27,418 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-19 18:47:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:27,475 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-19 18:47:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:47:27,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-19 18:47:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:27,477 INFO L225 Difference]: With dead ends: 55 [2019-11-19 18:47:27,477 INFO L226 Difference]: Without dead ends: 46 [2019-11-19 18:47:27,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:47:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-19 18:47:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-19 18:47:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 18:47:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-19 18:47:27,485 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-19 18:47:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:27,486 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-19 18:47:27,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:47:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-19 18:47:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 18:47:27,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:27,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:27,488 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-19 18:47:27,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:47:27,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300248844] [2019-11-19 18:47:27,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:47:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:47:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:47:27,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:47:27,603 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:47:27,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:47:27 BoogieIcfgContainer [2019-11-19 18:47:27,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:47:27,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:47:27,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:47:27,630 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:47:27,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:26" (3/4) ... [2019-11-19 18:47:27,633 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 18:47:27,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:47:27,636 INFO L168 Benchmark]: Toolchain (without parser) took 1823.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -96.5 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:27,636 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:47:27,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:27,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:47:27,638 INFO L168 Benchmark]: Boogie Preprocessor took 30.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:47:27,639 INFO L168 Benchmark]: RCFGBuilder took 502.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:27,640 INFO L168 Benchmark]: TraceAbstraction took 822.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:27,641 INFO L168 Benchmark]: Witness Printer took 3.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:47:27,645 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 502.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 822.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 79. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; [L24] __uint32_t msw, lsw; [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:47:29,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:47:29,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:47:29,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:47:29,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:47:29,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:47:29,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:47:29,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:47:29,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:47:29,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:47:29,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:47:29,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:47:29,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:47:29,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:47:29,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:47:29,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:47:29,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:47:29,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:47:29,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:47:29,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:47:29,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:47:29,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:47:29,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:47:29,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:47:29,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:47:29,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:47:29,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:47:29,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:47:29,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:47:29,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:47:29,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:47:29,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:47:29,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:47:29,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:47:29,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:47:29,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:47:29,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:47:29,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:47:29,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:47:29,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:47:29,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:47:29,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 18:47:29,743 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:47:29,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:47:29,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:47:29,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:47:29,745 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:47:29,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:47:29,746 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:47:29,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:47:29,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:47:29,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:47:29,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:47:29,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:47:29,747 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 18:47:29,748 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 18:47:29,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:47:29,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:47:29,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:47:29,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:47:29,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:47:29,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:47:29,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:47:29,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:47:29,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:47:29,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:47:29,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:47:29,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:47:29,752 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 18:47:29,752 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 18:47:29,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:47:29,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 18:47:29,753 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-19 18:47:30,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:47:30,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:47:30,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:47:30,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:47:30,122 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:47:30,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-19 18:47:30,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4672de25/9bdc0c4b0ca24e05bac04c1e7f00708b/FLAG123a62d5a [2019-11-19 18:47:30,694 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:47:30,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-19 18:47:30,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4672de25/9bdc0c4b0ca24e05bac04c1e7f00708b/FLAG123a62d5a [2019-11-19 18:47:31,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4672de25/9bdc0c4b0ca24e05bac04c1e7f00708b [2019-11-19 18:47:31,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:47:31,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:47:31,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:47:31,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:47:31,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:47:31,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c962087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31, skipping insertion in model container [2019-11-19 18:47:31,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,089 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:47:31,116 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:47:31,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:47:31,359 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:47:31,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:47:31,486 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:47:31,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31 WrapperNode [2019-11-19 18:47:31,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:47:31,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:47:31,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:47:31,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:47:31,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:47:31,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:47:31,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:47:31,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:47:31,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... [2019-11-19 18:47:31,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:47:31,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:47:31,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:47:31,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:47:31,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:47:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-19 18:47:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:47:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 18:47:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:47:31,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:47:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 18:47:32,160 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:47:32,160 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-19 18:47:32,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:32 BoogieIcfgContainer [2019-11-19 18:47:32,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:47:32,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:47:32,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:47:32,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:47:32,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:47:31" (1/3) ... [2019-11-19 18:47:32,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fb065f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:32, skipping insertion in model container [2019-11-19 18:47:32,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:31" (2/3) ... [2019-11-19 18:47:32,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fb065f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:32, skipping insertion in model container [2019-11-19 18:47:32,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:32" (3/3) ... [2019-11-19 18:47:32,172 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-19 18:47:32,181 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:47:32,190 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:47:32,201 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:47:32,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:47:32,223 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:47:32,223 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:47:32,224 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:47:32,224 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:47:32,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:47:32,224 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:47:32,225 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:47:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-19 18:47:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 18:47:32,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:32,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:32,247 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:32,253 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-19 18:47:32,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:32,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746149334] [2019-11-19 18:47:32,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-19 18:47:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:32,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 18:47:32,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:32,375 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:32,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746149334] [2019-11-19 18:47:32,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:32,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 18:47:32,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045792454] [2019-11-19 18:47:32,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:47:32,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:32,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:47:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:47:32,400 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-19 18:47:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:32,423 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-19 18:47:32,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:47:32,425 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-19 18:47:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:32,436 INFO L225 Difference]: With dead ends: 62 [2019-11-19 18:47:32,436 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 18:47:32,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:47:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 18:47:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-19 18:47:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 18:47:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-19 18:47:32,482 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-19 18:47:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:32,483 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-19 18:47:32,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:47:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-19 18:47:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 18:47:32,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:32,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:32,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 18:47:32,700 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:32,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-19 18:47:32,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:32,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992183040] [2019-11-19 18:47:32,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-19 18:47:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:32,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 18:47:32,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:32,844 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:32,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992183040] [2019-11-19 18:47:32,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:32,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 18:47:32,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628249148] [2019-11-19 18:47:32,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:47:32,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:32,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:47:32,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:47:32,883 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-19 18:47:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:33,184 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-19 18:47:33,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:47:33,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-19 18:47:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:33,188 INFO L225 Difference]: With dead ends: 68 [2019-11-19 18:47:33,188 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 18:47:33,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:47:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 18:47:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-19 18:47:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 18:47:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-19 18:47:33,198 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-19 18:47:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:33,199 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-19 18:47:33,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:47:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-19 18:47:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 18:47:33,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:33,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:33,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 18:47:33,402 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:33,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-19 18:47:33,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:33,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419229373] [2019-11-19 18:47:33,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-19 18:47:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:33,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 18:47:33,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:33,555 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:33,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:33,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419229373] [2019-11-19 18:47:33,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:33,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 18:47:33,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113740384] [2019-11-19 18:47:33,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:47:33,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:47:33,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:47:33,638 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-19 18:47:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:33,755 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-19 18:47:33,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:47:33,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-19 18:47:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:33,757 INFO L225 Difference]: With dead ends: 52 [2019-11-19 18:47:33,757 INFO L226 Difference]: Without dead ends: 28 [2019-11-19 18:47:33,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:47:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-19 18:47:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-19 18:47:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 18:47:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-19 18:47:33,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-19 18:47:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:33,764 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-19 18:47:33,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:47:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-19 18:47:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 18:47:33,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:33,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:33,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 18:47:33,979 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:33,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:33,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-19 18:47:33,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:33,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251230043] [2019-11-19 18:47:33,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-19 18:47:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:34,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 18:47:34,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:34,131 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:34,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251230043] [2019-11-19 18:47:34,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:34,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 18:47:34,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193977858] [2019-11-19 18:47:34,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:47:34,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:34,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:47:34,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:47:34,164 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-19 18:47:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:34,274 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-19 18:47:34,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:47:34,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-19 18:47:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:34,278 INFO L225 Difference]: With dead ends: 65 [2019-11-19 18:47:34,278 INFO L226 Difference]: Without dead ends: 56 [2019-11-19 18:47:34,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:47:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-19 18:47:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-19 18:47:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-19 18:47:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-19 18:47:34,286 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-19 18:47:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:34,286 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-19 18:47:34,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:47:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-19 18:47:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 18:47:34,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:34,288 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:34,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 18:47:34,501 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:34,502 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-19 18:47:34,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:34,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221706292] [2019-11-19 18:47:34,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-19 18:47:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:34,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 18:47:34,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:34,660 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:34,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221706292] [2019-11-19 18:47:34,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:34,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 18:47:34,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389403774] [2019-11-19 18:47:34,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:47:34,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:34,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:47:34,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:47:34,712 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-19 18:47:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:34,737 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-19 18:47:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:47:34,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-19 18:47:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:34,741 INFO L225 Difference]: With dead ends: 40 [2019-11-19 18:47:34,741 INFO L226 Difference]: Without dead ends: 30 [2019-11-19 18:47:34,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:47:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-19 18:47:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-19 18:47:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-19 18:47:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-19 18:47:34,755 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-19 18:47:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:34,759 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-19 18:47:34,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:47:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-19 18:47:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 18:47:34,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:34,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:34,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 18:47:34,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-19 18:47:34,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:34,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613048762] [2019-11-19 18:47:34,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-19 18:47:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:35,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:47:35,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:35,153 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:35,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:35,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613048762] [2019-11-19 18:47:35,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:35,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-19 18:47:35,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069313122] [2019-11-19 18:47:35,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 18:47:35,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:35,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 18:47:35,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-19 18:47:35,207 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-19 18:47:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:35,330 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-19 18:47:35,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:47:35,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-19 18:47:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:35,333 INFO L225 Difference]: With dead ends: 42 [2019-11-19 18:47:35,333 INFO L226 Difference]: Without dead ends: 39 [2019-11-19 18:47:35,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-19 18:47:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-19 18:47:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-19 18:47:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 18:47:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-19 18:47:35,339 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-19 18:47:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:35,339 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-19 18:47:35,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 18:47:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-19 18:47:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 18:47:35,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:35,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:35,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-19 18:47:35,548 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:35,550 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-19 18:47:35,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:35,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428478668] [2019-11-19 18:47:35,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-19 18:47:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:35,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 18:47:35,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:35,745 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:35,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428478668] [2019-11-19 18:47:35,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:35,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-19 18:47:35,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532098223] [2019-11-19 18:47:35,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 18:47:35,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 18:47:35,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:47:35,827 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-19 18:47:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:35,944 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-19 18:47:35,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:47:35,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-19 18:47:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:35,951 INFO L225 Difference]: With dead ends: 45 [2019-11-19 18:47:35,951 INFO L226 Difference]: Without dead ends: 27 [2019-11-19 18:47:35,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:47:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-19 18:47:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-19 18:47:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 18:47:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-19 18:47:35,957 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-19 18:47:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:35,957 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-19 18:47:35,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 18:47:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-19 18:47:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 18:47:35,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:35,958 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:36,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-19 18:47:36,167 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-19 18:47:36,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:36,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517817189] [2019-11-19 18:47:36,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-19 18:47:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:36,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 18:47:36,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:36,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:36,406 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:36,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:36,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517817189] [2019-11-19 18:47:36,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:36,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-19 18:47:36,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101936133] [2019-11-19 18:47:36,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 18:47:36,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:36,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 18:47:36,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-19 18:47:36,677 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-19 18:47:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:37,011 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-19 18:47:37,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:47:37,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-19 18:47:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:37,012 INFO L225 Difference]: With dead ends: 27 [2019-11-19 18:47:37,012 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 18:47:37,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-19 18:47:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 18:47:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 18:47:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 18:47:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 18:47:37,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-19 18:47:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:37,015 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 18:47:37,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 18:47:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 18:47:37,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 18:47:37,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-19 18:47:37,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 18:47:37,586 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-19 18:47:37,586 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-11-19 18:47:37,587 INFO L440 ceAbstractionStarter]: At program point L69(lines 60 70) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3))))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 18:47:37,587 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-11-19 18:47:37,587 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 36 47) no Hoare annotation was computed. [2019-11-19 18:47:37,587 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 18:47:37,587 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 18:47:37,587 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 55) no Hoare annotation was computed. [2019-11-19 18:47:37,587 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2019-11-19 18:47:37,588 INFO L440 ceAbstractionStarter]: At program point L63-2(lines 63 67) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 18:47:37,588 INFO L444 ceAbstractionStarter]: For program point L63-3(lines 63 67) no Hoare annotation was computed. [2019-11-19 18:47:37,588 INFO L440 ceAbstractionStarter]: At program point L47(lines 23 48) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.neg (_ +zero 11 53))))) (= ULTIMATE.start_fmax_double_~x .cse0) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-19 18:47:37,588 INFO L440 ceAbstractionStarter]: At program point L47-1(lines 23 48) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 18:47:37,588 INFO L444 ceAbstractionStarter]: For program point L39(lines 39 47) no Hoare annotation was computed. [2019-11-19 18:47:37,588 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 39 47) no Hoare annotation was computed. [2019-11-19 18:47:37,588 INFO L447 ceAbstractionStarter]: At program point L89(lines 72 90) the Hoare annotation is: true [2019-11-19 18:47:37,589 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 18:47:37,589 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-19 18:47:37,589 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2019-11-19 18:47:37,589 INFO L444 ceAbstractionStarter]: For program point L57-2(line 57) no Hoare annotation was computed. [2019-11-19 18:47:37,589 INFO L440 ceAbstractionStarter]: At program point L57-3(lines 50 58) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 18:47:37,589 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 18:47:37,590 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 31) no Hoare annotation was computed. [2019-11-19 18:47:37,590 INFO L440 ceAbstractionStarter]: At program point L26-2(lines 26 31) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmax_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-19 18:47:37,590 INFO L444 ceAbstractionStarter]: For program point L26-3(lines 23 48) no Hoare annotation was computed. [2019-11-19 18:47:37,590 INFO L444 ceAbstractionStarter]: For program point L26-5(lines 26 31) no Hoare annotation was computed. [2019-11-19 18:47:37,590 INFO L440 ceAbstractionStarter]: At program point L26-6(lines 26 31) the Hoare annotation is: (and (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 18:47:37,590 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-19 18:47:37,590 INFO L444 ceAbstractionStarter]: For program point L26-7(lines 23 48) no Hoare annotation was computed. [2019-11-19 18:47:37,591 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 84 87) no Hoare annotation was computed. [2019-11-19 18:47:37,591 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-19 18:47:37,591 INFO L444 ceAbstractionStarter]: For program point L43-1(lines 43 47) no Hoare annotation was computed. [2019-11-19 18:47:37,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:47:37 BoogieIcfgContainer [2019-11-19 18:47:37,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:47:37,659 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:47:37,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:47:37,659 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:47:37,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:32" (3/4) ... [2019-11-19 18:47:37,664 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 18:47:37,677 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-19 18:47:37,677 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-19 18:47:37,678 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 18:47:37,707 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-19 18:47:37,708 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-19 18:47:37,708 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() [2019-11-19 18:47:37,709 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]))) && x == ~Pluszero~LONGDOUBLE() [2019-11-19 18:47:37,709 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-19 18:47:37,747 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:47:37,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:47:37,749 INFO L168 Benchmark]: Toolchain (without parser) took 6678.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -204.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:47:37,750 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:47:37,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:37,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:47:37,757 INFO L168 Benchmark]: Boogie Preprocessor took 40.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:47:37,758 INFO L168 Benchmark]: RCFGBuilder took 574.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:37,758 INFO L168 Benchmark]: TraceAbstraction took 5495.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.3 MB). Peak memory consumption was 289.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:37,758 INFO L168 Benchmark]: Witness Printer took 88.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:37,764 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 574.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5495.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.3 MB). Peak memory consumption was 289.8 MB. Max. memory is 11.5 GB. * Witness Printer took 88.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2019-11-19 18:47:37,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 18:47:37,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 60]: Loop Invariant [2019-11-19 18:47:37,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 18:47:37,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] Derived loop invariant: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]))) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 50]: Loop Invariant [2019-11-19 18:47:37,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 63]: Loop Invariant [2019-11-19 18:47:37,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 23]: Loop Invariant [2019-11-19 18:47:37,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 18:47:37,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 206 HoareAnnotationTreeSize, 8 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 18200 SizeOfPredicates, 38 NumberOfNonLiveVariables, 457 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...