/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1012b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:53:22,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:53:22,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:53:22,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:53:22,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:53:22,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:53:22,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:53:22,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:53:22,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:53:22,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:53:22,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:53:22,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:53:22,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:53:22,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:53:22,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:53:22,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:53:22,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:53:22,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:53:22,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:53:22,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:53:22,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:53:22,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:53:22,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:53:22,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:53:22,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:53:22,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:53:22,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:53:22,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:53:22,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:53:22,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:53:22,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:53:22,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:53:22,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:53:22,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:53:22,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:53:22,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:53:22,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:53:22,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:53:22,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:53:22,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:53:22,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:53:22,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 15:53:22,224 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:53:22,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:53:22,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:53:22,227 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:53:22,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:53:22,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:53:22,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:53:22,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:53:22,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:53:22,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:53:22,229 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:53:22,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:53:22,230 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:53:22,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:53:22,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:53:22,231 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:53:22,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:53:22,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:53:22,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:53:22,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:53:22,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:53:22,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:53:22,232 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:53:22,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:53:22,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:53:22,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:53:22,545 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:53:22,546 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:53:22,547 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1012b.c [2020-07-08 15:53:22,618 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b80b1428b/3af03cf2b4464c6d83b6c6ad0da6ee10/FLAG01b2fb69e [2020-07-08 15:53:23,115 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:53:23,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1012b.c [2020-07-08 15:53:23,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b80b1428b/3af03cf2b4464c6d83b6c6ad0da6ee10/FLAG01b2fb69e [2020-07-08 15:53:23,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b80b1428b/3af03cf2b4464c6d83b6c6ad0da6ee10 [2020-07-08 15:53:23,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:53:23,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:53:23,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:53:23,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:53:23,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:53:23,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:53:23" (1/1) ... [2020-07-08 15:53:23,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5c6b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23, skipping insertion in model container [2020-07-08 15:53:23,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:53:23" (1/1) ... [2020-07-08 15:53:23,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:53:23,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:53:23,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:53:23,754 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:53:23,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:53:23,907 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:53:23,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23 WrapperNode [2020-07-08 15:53:23,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:53:23,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:53:23,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:53:23,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:53:23,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23" (1/1) ... [2020-07-08 15:53:23,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23" (1/1) ... [2020-07-08 15:53:23,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23" (1/1) ... [2020-07-08 15:53:23,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23" (1/1) ... [2020-07-08 15:53:23,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23" (1/1) ... [2020-07-08 15:53:23,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23" (1/1) ... [2020-07-08 15:53:23,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23" (1/1) ... [2020-07-08 15:53:23,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:53:23,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:53:23,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:53:23,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:53:23,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23" (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-08 15:53:24,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:53:24,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:53:24,029 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-08 15:53:24,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2020-07-08 15:53:24,030 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2020-07-08 15:53:24,030 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2020-07-08 15:53:24,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:53:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:53:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-08 15:53:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2020-07-08 15:53:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 15:53:24,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 15:53:24,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 15:53:24,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 15:53:24,032 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2020-07-08 15:53:24,032 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2020-07-08 15:53:24,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 15:53:24,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 15:53:24,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:53:24,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:53:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:53:24,587 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:53:24,587 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-08 15:53:24,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:53:24 BoogieIcfgContainer [2020-07-08 15:53:24,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:53:24,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:53:24,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:53:24,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:53:24,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:53:23" (1/3) ... [2020-07-08 15:53:24,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b10325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:53:24, skipping insertion in model container [2020-07-08 15:53:24,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:23" (2/3) ... [2020-07-08 15:53:24,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b10325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:53:24, skipping insertion in model container [2020-07-08 15:53:24,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:53:24" (3/3) ... [2020-07-08 15:53:24,602 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1012b.c [2020-07-08 15:53:24,613 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:53:24,625 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:53:24,639 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:53:24,663 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:53:24,663 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:53:24,664 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:53:24,664 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:53:24,664 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:53:24,664 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:53:24,665 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:53:24,665 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:53:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2020-07-08 15:53:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 15:53:24,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:24,692 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, 1, 1] [2020-07-08 15:53:24,692 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1675366147, now seen corresponding path program 1 times [2020-07-08 15:53:24,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:24,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1439374521] [2020-07-08 15:53:24,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:24,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {102#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {78#true} is VALID [2020-07-08 15:53:24,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} #valid := #valid[0 := 0]; {78#true} is VALID [2020-07-08 15:53:24,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume 0 < #StackHeapBarrier; {78#true} is VALID [2020-07-08 15:53:24,926 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-08 15:53:24,927 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {78#true} {78#true} #134#return; {78#true} is VALID [2020-07-08 15:53:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:24,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {78#true} is VALID [2020-07-08 15:53:24,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} havoc ~high~0; {78#true} is VALID [2020-07-08 15:53:24,984 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume !true; {79#false} is VALID [2020-07-08 15:53:24,985 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#false} assume !true; {79#false} is VALID [2020-07-08 15:53:24,985 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#false} #res := ~x; {79#false} is VALID [2020-07-08 15:53:24,986 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#false} assume true; {79#false} is VALID [2020-07-08 15:53:24,986 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {79#false} {78#true} #130#return; {79#false} is VALID [2020-07-08 15:53:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:25,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {78#true} is VALID [2020-07-08 15:53:25,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} havoc ~hx~0; {78#true} is VALID [2020-07-08 15:53:25,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} havoc ~lx~0; {78#true} is VALID [2020-07-08 15:53:25,030 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume !true; {79#false} is VALID [2020-07-08 15:53:25,030 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {79#false} is VALID [2020-07-08 15:53:25,031 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#false} ~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); {79#false} is VALID [2020-07-08 15:53:25,031 INFO L280 TraceCheckUtils]: 6: Hoare triple {79#false} ~hx~0 := 2146435072 - ~hx~0; {79#false} is VALID [2020-07-08 15:53:25,031 INFO L280 TraceCheckUtils]: 7: Hoare triple {79#false} #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); {79#false} is VALID [2020-07-08 15:53:25,032 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#false} assume true; {79#false} is VALID [2020-07-08 15:53:25,032 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {79#false} {79#false} #132#return; {79#false} is VALID [2020-07-08 15:53:25,034 INFO L263 TraceCheckUtils]: 0: Hoare triple {78#true} call ULTIMATE.init(); {102#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 15:53:25,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {102#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {78#true} is VALID [2020-07-08 15:53:25,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} #valid := #valid[0 := 0]; {78#true} is VALID [2020-07-08 15:53:25,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume 0 < #StackHeapBarrier; {78#true} is VALID [2020-07-08 15:53:25,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-08 15:53:25,036 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {78#true} #134#return; {78#true} is VALID [2020-07-08 15:53:25,037 INFO L263 TraceCheckUtils]: 6: Hoare triple {78#true} call #t~ret12 := main(); {78#true} is VALID [2020-07-08 15:53:25,038 INFO L280 TraceCheckUtils]: 7: Hoare triple {78#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); {78#true} is VALID [2020-07-08 15:53:25,039 INFO L263 TraceCheckUtils]: 8: Hoare triple {78#true} call #t~ret10 := fabs_double(~x~0); {103#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:25,040 INFO L280 TraceCheckUtils]: 9: Hoare triple {103#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {78#true} is VALID [2020-07-08 15:53:25,040 INFO L280 TraceCheckUtils]: 10: Hoare triple {78#true} havoc ~high~0; {78#true} is VALID [2020-07-08 15:53:25,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {78#true} assume !true; {79#false} is VALID [2020-07-08 15:53:25,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {79#false} assume !true; {79#false} is VALID [2020-07-08 15:53:25,042 INFO L280 TraceCheckUtils]: 13: Hoare triple {79#false} #res := ~x; {79#false} is VALID [2020-07-08 15:53:25,042 INFO L280 TraceCheckUtils]: 14: Hoare triple {79#false} assume true; {79#false} is VALID [2020-07-08 15:53:25,042 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {79#false} {78#true} #130#return; {79#false} is VALID [2020-07-08 15:53:25,043 INFO L280 TraceCheckUtils]: 16: Hoare triple {79#false} ~res~0 := #t~ret10; {79#false} is VALID [2020-07-08 15:53:25,043 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#false} havoc #t~ret10; {79#false} is VALID [2020-07-08 15:53:25,043 INFO L263 TraceCheckUtils]: 18: Hoare triple {79#false} call #t~ret11 := isinf_double(~res~0); {103#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:25,044 INFO L280 TraceCheckUtils]: 19: Hoare triple {103#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {78#true} is VALID [2020-07-08 15:53:25,044 INFO L280 TraceCheckUtils]: 20: Hoare triple {78#true} havoc ~hx~0; {78#true} is VALID [2020-07-08 15:53:25,044 INFO L280 TraceCheckUtils]: 21: Hoare triple {78#true} havoc ~lx~0; {78#true} is VALID [2020-07-08 15:53:25,045 INFO L280 TraceCheckUtils]: 22: Hoare triple {78#true} assume !true; {79#false} is VALID [2020-07-08 15:53:25,046 INFO L280 TraceCheckUtils]: 23: Hoare triple {79#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {79#false} is VALID [2020-07-08 15:53:25,046 INFO L280 TraceCheckUtils]: 24: Hoare triple {79#false} ~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); {79#false} is VALID [2020-07-08 15:53:25,046 INFO L280 TraceCheckUtils]: 25: Hoare triple {79#false} ~hx~0 := 2146435072 - ~hx~0; {79#false} is VALID [2020-07-08 15:53:25,047 INFO L280 TraceCheckUtils]: 26: Hoare triple {79#false} #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); {79#false} is VALID [2020-07-08 15:53:25,047 INFO L280 TraceCheckUtils]: 27: Hoare triple {79#false} assume true; {79#false} is VALID [2020-07-08 15:53:25,047 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {79#false} {79#false} #132#return; {79#false} is VALID [2020-07-08 15:53:25,048 INFO L280 TraceCheckUtils]: 29: Hoare triple {79#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {79#false} is VALID [2020-07-08 15:53:25,048 INFO L280 TraceCheckUtils]: 30: Hoare triple {79#false} assume 0 == #t~ret11; {79#false} is VALID [2020-07-08 15:53:25,048 INFO L280 TraceCheckUtils]: 31: Hoare triple {79#false} havoc #t~ret11; {79#false} is VALID [2020-07-08 15:53:25,049 INFO L280 TraceCheckUtils]: 32: Hoare triple {79#false} assume !false; {79#false} is VALID [2020-07-08 15:53:25,053 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-08 15:53:25,054 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:53:25,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1439374521] [2020-07-08 15:53:25,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:53:25,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 15:53:25,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648563860] [2020-07-08 15:53:25,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-08 15:53:25,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:53:25,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 15:53:25,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:25,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 15:53:25,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:53:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 15:53:25,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 15:53:25,151 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2020-07-08 15:53:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:25,713 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2020-07-08 15:53:25,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 15:53:25,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-08 15:53:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:53:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:53:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2020-07-08 15:53:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:53:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2020-07-08 15:53:25,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2020-07-08 15:53:25,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:25,979 INFO L225 Difference]: With dead ends: 138 [2020-07-08 15:53:25,980 INFO L226 Difference]: Without dead ends: 68 [2020-07-08 15:53:25,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 15:53:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-08 15:53:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-08 15:53:26,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:53:26,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2020-07-08 15:53:26,083 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-08 15:53:26,083 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-08 15:53:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:26,089 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2020-07-08 15:53:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2020-07-08 15:53:26,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:26,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:26,091 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-08 15:53:26,092 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-08 15:53:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:26,098 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2020-07-08 15:53:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2020-07-08 15:53:26,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:26,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:26,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:53:26,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:53:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-08 15:53:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2020-07-08 15:53:26,106 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 33 [2020-07-08 15:53:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:53:26,107 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2020-07-08 15:53:26,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 15:53:26,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 67 transitions. [2020-07-08 15:53:26,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2020-07-08 15:53:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-08 15:53:26,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:26,200 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, 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, 1, 1, 1, 1, 1] [2020-07-08 15:53:26,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:53:26,201 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:26,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:26,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1980992917, now seen corresponding path program 1 times [2020-07-08 15:53:26,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:26,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426921041] [2020-07-08 15:53:26,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:26,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:53:26,374 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:1012) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1159) 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.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:266) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) 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-08 15:53:26,381 INFO L168 Benchmark]: Toolchain (without parser) took 2860.08 ms. Allocated memory was 145.8 MB in the beginning and 236.5 MB in the end (delta: 90.7 MB). Free memory was 102.2 MB in the beginning and 84.9 MB in the end (delta: 17.3 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:26,382 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 15:53:26,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.60 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 102.0 MB in the beginning and 181.3 MB in the end (delta: -79.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:26,385 INFO L168 Benchmark]: Boogie Preprocessor took 55.16 ms. Allocated memory is still 202.9 MB. Free memory was 181.3 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:26,385 INFO L168 Benchmark]: RCFGBuilder took 628.21 ms. Allocated memory is still 202.9 MB. Free memory was 179.0 MB in the beginning and 140.0 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:26,386 INFO L168 Benchmark]: TraceAbstraction took 1784.16 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 139.4 MB in the beginning and 84.9 MB in the end (delta: 54.5 MB). Peak memory consumption was 88.0 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:26,391 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.27 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 386.60 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 102.0 MB in the beginning and 181.3 MB in the end (delta: -79.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.16 ms. Allocated memory is still 202.9 MB. Free memory was 181.3 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 628.21 ms. Allocated memory is still 202.9 MB. Free memory was 179.0 MB in the beginning and 140.0 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1784.16 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 139.4 MB in the beginning and 84.9 MB in the end (delta: 54.5 MB). Peak memory consumption was 88.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...