/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1300.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:04:53,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:04:53,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:04:53,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:04:53,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:04:53,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:04:53,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:04:53,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:04:53,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:04:53,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:04:53,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:04:53,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:04:53,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:04:53,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:04:53,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:04:53,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:04:53,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:04:53,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:04:53,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:04:53,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:04:53,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:04:53,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:04:53,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:04:53,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:04:53,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:04:53,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:04:53,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:04:53,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:04:53,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:04:53,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:04:53,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:04:53,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:04:53,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:04:53,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:04:53,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:04:53,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:04:53,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:04:53,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:04:53,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:04:53,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:04:53,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:04:53,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:04:53,708 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:04:53,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:04:53,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:04:53,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:04:53,710 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:04:53,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:04:53,711 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:04:53,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:04:53,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:04:53,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:04:53,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:04:53,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:04:53,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:04:53,712 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:04:53,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:04:53,712 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:04:53,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:04:53,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:04:53,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:04:53,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:04:53,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:04:53,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:04:53,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:04:53,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:04:53,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:04:53,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:04:53,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:04:53,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:04:53,715 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:04:53,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:04:54,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:04:54,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:04:54,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:04:54,033 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:04:54,033 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:04:54,034 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1300.c [2020-07-17 22:04:54,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05964c89/6c8cd629226440c59f77de0449a0f5bd/FLAGe3cd14cb7 [2020-07-17 22:04:54,588 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:04:54,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1300.c [2020-07-17 22:04:54,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05964c89/6c8cd629226440c59f77de0449a0f5bd/FLAGe3cd14cb7 [2020-07-17 22:04:55,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05964c89/6c8cd629226440c59f77de0449a0f5bd [2020-07-17 22:04:55,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:04:55,027 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:04:55,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:04:55,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:04:55,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:04:55,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:04:55" (1/1) ... [2020-07-17 22:04:55,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158c85fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55, skipping insertion in model container [2020-07-17 22:04:55,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:04:55" (1/1) ... [2020-07-17 22:04:55,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:04:55,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:04:55,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:04:55,258 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:04:55,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:04:55,406 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:04:55,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55 WrapperNode [2020-07-17 22:04:55,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:04:55,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:04:55,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:04:55,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:04:55,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55" (1/1) ... [2020-07-17 22:04:55,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55" (1/1) ... [2020-07-17 22:04:55,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55" (1/1) ... [2020-07-17 22:04:55,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55" (1/1) ... [2020-07-17 22:04:55,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55" (1/1) ... [2020-07-17 22:04:55,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55" (1/1) ... [2020-07-17 22:04:55,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55" (1/1) ... [2020-07-17 22:04:55,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:04:55,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:04:55,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:04:55,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:04:55,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55" (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 [2020-07-17 22:04:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:04:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:04:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2020-07-17 22:04:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-17 22:04:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2020-07-17 22:04:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:04:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:04:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-17 22:04:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2020-07-17 22:04:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:04:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-17 22:04:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:04:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:04:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-17 22:04:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2020-07-17 22:04:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:04:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:04:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:04:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-17 22:04:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:04:56,047 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:04:56,047 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:04:56,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:04:56 BoogieIcfgContainer [2020-07-17 22:04:56,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:04:56,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:04:56,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:04:56,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:04:56,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:04:55" (1/3) ... [2020-07-17 22:04:56,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a1c7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:04:56, skipping insertion in model container [2020-07-17 22:04:56,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:55" (2/3) ... [2020-07-17 22:04:56,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a1c7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:04:56, skipping insertion in model container [2020-07-17 22:04:56,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:04:56" (3/3) ... [2020-07-17 22:04:56,061 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2020-07-17 22:04:56,072 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:04:56,081 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:04:56,096 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:04:56,121 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:04:56,121 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:04:56,122 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:04:56,122 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:04:56,122 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:04:56,122 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:04:56,123 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:04:56,123 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:04:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-17 22:04:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:04:56,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:04:56,152 INFO L422 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, 1, 1] [2020-07-17 22:04:56,152 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:04:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:04:56,157 INFO L82 PathProgramCache]: Analyzing trace with hash -829971037, now seen corresponding path program 1 times [2020-07-17 22:04:56,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:04:56,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542696605] [2020-07-17 22:04:56,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:04:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:56,436 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {40#true} is VALID [2020-07-17 22:04:56,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-17 22:04:56,438 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #71#return; {40#true} is VALID [2020-07-17 22:04:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:56,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~hx~0;havoc ~lx~0; {40#true} is VALID [2020-07-17 22:04:56,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-17 22:04:56,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {41#false} is VALID [2020-07-17 22:04:56,505 INFO L280 TraceCheckUtils]: 3: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:04:56,506 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {41#false} {40#true} #65#return; {41#false} is VALID [2020-07-17 22:04:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:56,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~hx~1; {40#true} is VALID [2020-07-17 22:04:56,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-17 22:04:56,533 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {41#false} is VALID [2020-07-17 22:04:56,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:04:56,534 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {41#false} {41#false} #69#return; {41#false} is VALID [2020-07-17 22:04:56,537 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {55#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:04:56,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {40#true} is VALID [2020-07-17 22:04:56,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-17 22:04:56,539 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #71#return; {40#true} is VALID [2020-07-17 22:04:56,539 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret11 := main(); {40#true} is VALID [2020-07-17 22:04:56,543 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} ~x~0 := #t~nondet6;havoc #t~nondet6; {40#true} is VALID [2020-07-17 22:04:56,545 INFO L263 TraceCheckUtils]: 6: Hoare triple {40#true} call #t~ret7 := isinf_double(~x~0); {56#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:56,545 INFO L280 TraceCheckUtils]: 7: Hoare triple {56#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~hx~0;havoc ~lx~0; {40#true} is VALID [2020-07-17 22:04:56,548 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-17 22:04:56,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {41#false} is VALID [2020-07-17 22:04:56,549 INFO L280 TraceCheckUtils]: 10: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:04:56,549 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {41#false} {40#true} #65#return; {41#false} is VALID [2020-07-17 22:04:56,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {41#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#t~short9 := 0 == #t~ret7; {41#false} is VALID [2020-07-17 22:04:56,550 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#false} assume !#t~short9; {41#false} is VALID [2020-07-17 22:04:56,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} assume #t~short9;havoc #t~ret7;havoc #t~short9;havoc #t~ret8; {41#false} is VALID [2020-07-17 22:04:56,551 INFO L263 TraceCheckUtils]: 15: Hoare triple {41#false} call #t~ret10 := isfinite_double(~x~0); {56#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:56,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {56#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~hx~1; {40#true} is VALID [2020-07-17 22:04:56,554 INFO L280 TraceCheckUtils]: 17: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-17 22:04:56,554 INFO L280 TraceCheckUtils]: 18: Hoare triple {41#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {41#false} is VALID [2020-07-17 22:04:56,555 INFO L280 TraceCheckUtils]: 19: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:04:56,555 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {41#false} {41#false} #69#return; {41#false} is VALID [2020-07-17 22:04:56,556 INFO L280 TraceCheckUtils]: 21: Hoare triple {41#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~res~0 := ~convertINTToDOUBLE(#t~ret10);havoc #t~ret10; {41#false} is VALID [2020-07-17 22:04:56,556 INFO L280 TraceCheckUtils]: 22: Hoare triple {41#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {41#false} is VALID [2020-07-17 22:04:56,557 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-17 22:04:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:04:56,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542696605] [2020-07-17 22:04:56,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:04:56,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:04:56,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265219136] [2020-07-17 22:04:56,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:04:56,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:04:56,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:04:56,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:56,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:04:56,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:04:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:04:56,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:04:56,691 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 4 states. [2020-07-17 22:04:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:57,129 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-07-17 22:04:57,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:04:57,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:04:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:04:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:04:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2020-07-17 22:04:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:04:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2020-07-17 22:04:57,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2020-07-17 22:04:57,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:57,302 INFO L225 Difference]: With dead ends: 66 [2020-07-17 22:04:57,302 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:04:57,306 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:04:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:04:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-17 22:04:57,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:04:57,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:57,383 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:57,383 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:57,388 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2020-07-17 22:04:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-07-17 22:04:57,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:57,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:57,389 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:57,390 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:57,394 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2020-07-17 22:04:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-07-17 22:04:57,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:57,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:57,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:04:57,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:04:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:04:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-07-17 22:04:57,401 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 24 [2020-07-17 22:04:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:04:57,402 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-07-17 22:04:57,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:04:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-07-17 22:04:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:04:57,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:04:57,404 INFO L422 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, 1, 1, 1, 1] [2020-07-17 22:04:57,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:04:57,405 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:04:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:04:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 905994018, now seen corresponding path program 1 times [2020-07-17 22:04:57,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:04:57,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600772705] [2020-07-17 22:04:57,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:04:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:57,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {272#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {254#true} is VALID [2020-07-17 22:04:57,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2020-07-17 22:04:57,558 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #71#return; {254#true} is VALID [2020-07-17 22:04:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:57,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~hx~0;havoc ~lx~0; {254#true} is VALID [2020-07-17 22:04:57,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {254#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {254#true} is VALID [2020-07-17 22:04:57,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {254#true} goto; {254#true} is VALID [2020-07-17 22:04:57,597 INFO L280 TraceCheckUtils]: 3: Hoare triple {254#true} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {254#true} is VALID [2020-07-17 22:04:57,597 INFO L280 TraceCheckUtils]: 4: Hoare triple {254#true} assume true; {254#true} is VALID [2020-07-17 22:04:57,598 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {254#true} {254#true} #65#return; {254#true} is VALID [2020-07-17 22:04:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:57,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~hx~1; {254#true} is VALID [2020-07-17 22:04:57,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {254#true} call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8);call #t~mem4 := read~int(~#gh_u~0.base, 4 + ~#gh_u~0.offset, 4);~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union5, ~#gh_u~0.base, ~#gh_u~0.offset, 8);havoc #t~union5;havoc #t~mem4;call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset);havoc ~#gh_u~0.base, ~#gh_u~0.offset; {254#true} is VALID [2020-07-17 22:04:57,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {254#true} goto; {254#true} is VALID [2020-07-17 22:04:57,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {254#true} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {254#true} is VALID [2020-07-17 22:04:57,642 INFO L280 TraceCheckUtils]: 4: Hoare triple {254#true} assume true; {254#true} is VALID [2020-07-17 22:04:57,643 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {254#true} {255#false} #69#return; {255#false} is VALID [2020-07-17 22:04:57,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {272#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:04:57,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {272#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {254#true} is VALID [2020-07-17 22:04:57,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2020-07-17 22:04:57,649 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #71#return; {254#true} is VALID [2020-07-17 22:04:57,649 INFO L263 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret11 := main(); {254#true} is VALID [2020-07-17 22:04:57,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {254#true} ~x~0 := #t~nondet6;havoc #t~nondet6; {254#true} is VALID [2020-07-17 22:04:57,651 INFO L263 TraceCheckUtils]: 6: Hoare triple {254#true} call #t~ret7 := isinf_double(~x~0); {273#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:57,652 INFO L280 TraceCheckUtils]: 7: Hoare triple {273#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~hx~0;havoc ~lx~0; {254#true} is VALID [2020-07-17 22:04:57,652 INFO L280 TraceCheckUtils]: 8: Hoare triple {254#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {254#true} is VALID [2020-07-17 22:04:57,652 INFO L280 TraceCheckUtils]: 9: Hoare triple {254#true} goto; {254#true} is VALID [2020-07-17 22:04:57,653 INFO L280 TraceCheckUtils]: 10: Hoare triple {254#true} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {254#true} is VALID [2020-07-17 22:04:57,653 INFO L280 TraceCheckUtils]: 11: Hoare triple {254#true} assume true; {254#true} is VALID [2020-07-17 22:04:57,653 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {254#true} {254#true} #65#return; {254#true} is VALID [2020-07-17 22:04:57,654 INFO L280 TraceCheckUtils]: 13: Hoare triple {254#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#t~short9 := 0 == #t~ret7; {254#true} is VALID [2020-07-17 22:04:57,657 INFO L280 TraceCheckUtils]: 14: Hoare triple {254#true} assume !#t~short9; {265#(not |main_#t~short9|)} is VALID [2020-07-17 22:04:57,658 INFO L280 TraceCheckUtils]: 15: Hoare triple {265#(not |main_#t~short9|)} assume #t~short9;havoc #t~ret7;havoc #t~short9;havoc #t~ret8; {255#false} is VALID [2020-07-17 22:04:57,658 INFO L263 TraceCheckUtils]: 16: Hoare triple {255#false} call #t~ret10 := isfinite_double(~x~0); {273#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:57,658 INFO L280 TraceCheckUtils]: 17: Hoare triple {273#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~hx~1; {254#true} is VALID [2020-07-17 22:04:57,659 INFO L280 TraceCheckUtils]: 18: Hoare triple {254#true} call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8);call #t~mem4 := read~int(~#gh_u~0.base, 4 + ~#gh_u~0.offset, 4);~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union5, ~#gh_u~0.base, ~#gh_u~0.offset, 8);havoc #t~union5;havoc #t~mem4;call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset);havoc ~#gh_u~0.base, ~#gh_u~0.offset; {254#true} is VALID [2020-07-17 22:04:57,659 INFO L280 TraceCheckUtils]: 19: Hoare triple {254#true} goto; {254#true} is VALID [2020-07-17 22:04:57,659 INFO L280 TraceCheckUtils]: 20: Hoare triple {254#true} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {254#true} is VALID [2020-07-17 22:04:57,659 INFO L280 TraceCheckUtils]: 21: Hoare triple {254#true} assume true; {254#true} is VALID [2020-07-17 22:04:57,660 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {254#true} {255#false} #69#return; {255#false} is VALID [2020-07-17 22:04:57,660 INFO L280 TraceCheckUtils]: 23: Hoare triple {255#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~res~0 := ~convertINTToDOUBLE(#t~ret10);havoc #t~ret10; {255#false} is VALID [2020-07-17 22:04:57,663 INFO L280 TraceCheckUtils]: 24: Hoare triple {255#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {255#false} is VALID [2020-07-17 22:04:57,664 INFO L280 TraceCheckUtils]: 25: Hoare triple {255#false} assume !false; {255#false} is VALID [2020-07-17 22:04:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:04:57,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600772705] [2020-07-17 22:04:57,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:04:57,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:04:57,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444864757] [2020-07-17 22:04:57,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-17 22:04:57,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:04:57,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:04:57,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:57,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:04:57,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:04:57,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:04:57,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:04:57,714 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 5 states. [2020-07-17 22:04:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:58,066 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-07-17 22:04:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:04:58,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-17 22:04:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:04:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:04:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-17 22:04:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:04:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-17 22:04:58,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-17 22:04:58,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:58,174 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:04:58,175 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:04:58,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:04:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:04:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-17 22:04:58,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:04:58,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:58,227 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:58,227 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:58,230 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2020-07-17 22:04:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2020-07-17 22:04:58,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:58,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:58,232 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:58,233 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-17 22:04:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:58,241 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2020-07-17 22:04:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2020-07-17 22:04:58,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:58,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:58,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:04:58,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:04:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:04:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 31 transitions. [2020-07-17 22:04:58,248 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 31 transitions. Word has length 26 [2020-07-17 22:04:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:04:58,249 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 31 transitions. [2020-07-17 22:04:58,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:04:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2020-07-17 22:04:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:04:58,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:04:58,252 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:04:58,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:04:58,254 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:04:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:04:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 859982537, now seen corresponding path program 1 times [2020-07-17 22:04:58,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:04:58,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459084479] [2020-07-17 22:04:58,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:04:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:04:58,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:04:58,506 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-17 22:04:58,520 INFO L168 Benchmark]: Toolchain (without parser) took 3490.82 ms. Allocated memory was 144.2 MB in the beginning and 249.6 MB in the end (delta: 105.4 MB). Free memory was 100.7 MB in the beginning and 192.3 MB in the end (delta: -91.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,521 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:04:58,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.75 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 179.6 MB in the end (delta: -79.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,524 INFO L168 Benchmark]: Boogie Preprocessor took 66.45 ms. Allocated memory is still 201.3 MB. Free memory was 179.6 MB in the beginning and 177.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,525 INFO L168 Benchmark]: RCFGBuilder took 578.19 ms. Allocated memory is still 201.3 MB. Free memory was 177.3 MB in the beginning and 149.0 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,527 INFO L168 Benchmark]: TraceAbstraction took 2459.99 ms. Allocated memory was 201.3 MB in the beginning and 249.6 MB in the end (delta: 48.2 MB). Free memory was 148.0 MB in the beginning and 192.3 MB in the end (delta: -44.2 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,532 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 378.75 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 179.6 MB in the end (delta: -79.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.45 ms. Allocated memory is still 201.3 MB. Free memory was 179.6 MB in the beginning and 177.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 578.19 ms. Allocated memory is still 201.3 MB. Free memory was 177.3 MB in the beginning and 149.0 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2459.99 ms. Allocated memory was 201.3 MB in the beginning and 249.6 MB in the end (delta: 48.2 MB). Free memory was 148.0 MB in the beginning and 192.3 MB in the end (delta: -44.2 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...