/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_1210.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:40:45,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:40:45,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:40:45,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:40:45,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:40:45,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:40:45,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:40:45,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:40:45,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:40:45,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:40:45,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:40:45,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:40:45,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:40:45,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:40:45,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:40:45,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:40:45,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:40:45,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:40:45,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:40:45,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:40:45,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:40:45,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:40:45,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:40:45,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:40:45,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:40:45,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:40:45,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:40:45,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:40:45,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:40:45,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:40:45,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:40:45,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:40:45,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:40:45,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:40:45,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:40:45,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:40:45,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:40:45,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:40:45,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:40:45,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:40:45,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:40:45,204 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-10 14:40:45,240 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:40:45,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:40:45,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:40:45,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:40:45,245 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:40:45,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:40:45,245 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:40:45,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:40:45,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:40:45,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:40:45,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:40:45,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:40:45,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:40:45,248 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:40:45,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:40:45,248 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:40:45,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:40:45,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:40:45,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:40:45,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:40:45,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:40:45,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:40:45,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:40:45,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:40:45,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:40:45,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:40:45,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:40:45,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:40:45,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:40:45,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:40:45,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:40:45,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:40:45,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:40:45,550 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:40:45,551 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:40:45,551 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1210.c [2020-07-10 14:40:45,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9497d3c3e/8947111fa4e44d8ea614ae8d05c05820/FLAGe5aaed236 [2020-07-10 14:40:46,099 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:40:46,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1210.c [2020-07-10 14:40:46,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9497d3c3e/8947111fa4e44d8ea614ae8d05c05820/FLAGe5aaed236 [2020-07-10 14:40:46,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9497d3c3e/8947111fa4e44d8ea614ae8d05c05820 [2020-07-10 14:40:46,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:40:46,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:40:46,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:40:46,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:40:46,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:40:46,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:40:46" (1/1) ... [2020-07-10 14:40:46,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@927c463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46, skipping insertion in model container [2020-07-10 14:40:46,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:40:46" (1/1) ... [2020-07-10 14:40:46,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:40:46,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:40:46,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:40:46,732 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:40:46,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:40:46,895 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:40:46,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46 WrapperNode [2020-07-10 14:40:46,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:40:46,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:40:46,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:40:46,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:40:46,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46" (1/1) ... [2020-07-10 14:40:46,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46" (1/1) ... [2020-07-10 14:40:46,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46" (1/1) ... [2020-07-10 14:40:46,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46" (1/1) ... [2020-07-10 14:40:46,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46" (1/1) ... [2020-07-10 14:40:46,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46" (1/1) ... [2020-07-10 14:40:46,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46" (1/1) ... [2020-07-10 14:40:46,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:40:46,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:40:46,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:40:46,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:40:46,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46" (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-10 14:40:47,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:40:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:40:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-10 14:40:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2020-07-10 14:40:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:40:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:40:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-10 14:40:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2020-07-10 14:40:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:40:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:40:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:40:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:40:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:40:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:40:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:40:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:40:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:40:47,771 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:40:47,771 INFO L295 CfgBuilder]: Removed 20 assume(true) statements. [2020-07-10 14:40:47,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:40:47 BoogieIcfgContainer [2020-07-10 14:40:47,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:40:47,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:40:47,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:40:47,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:40:47,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:40:46" (1/3) ... [2020-07-10 14:40:47,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7202009e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:40:47, skipping insertion in model container [2020-07-10 14:40:47,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:46" (2/3) ... [2020-07-10 14:40:47,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7202009e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:40:47, skipping insertion in model container [2020-07-10 14:40:47,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:40:47" (3/3) ... [2020-07-10 14:40:47,790 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1210.c [2020-07-10 14:40:47,801 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:40:47,810 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:40:47,824 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:40:47,852 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:40:47,853 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:40:47,853 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:40:47,853 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:40:47,853 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:40:47,853 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:40:47,853 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:40:47,854 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:40:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2020-07-10 14:40:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 14:40:47,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:40:47,878 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] [2020-07-10 14:40:47,879 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:40:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:40:47,884 INFO L82 PathProgramCache]: Analyzing trace with hash 204549601, now seen corresponding path program 1 times [2020-07-10 14:40:47,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:40:47,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129453664] [2020-07-10 14:40:47,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:40:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:48,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {78#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {61#true} is VALID [2020-07-10 14:40:48,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {61#true} assume true; {61#true} is VALID [2020-07-10 14:40:48,121 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {61#true} {61#true} #174#return; {61#true} is VALID [2020-07-10 14:40:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:48,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {79#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0; {61#true} is VALID [2020-07-10 14:40:48,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {61#true} assume !true; {62#false} is VALID [2020-07-10 14:40:48,157 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {62#false} is VALID [2020-07-10 14:40:48,158 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#false} assume ~j0~0 < 20; {62#false} is VALID [2020-07-10 14:40:48,158 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#false} assume ~j0~0 < 0; {62#false} is VALID [2020-07-10 14:40:48,158 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#false} assume !true; {62#false} is VALID [2020-07-10 14:40:48,159 INFO L280 TraceCheckUtils]: 6: Hoare triple {62#false} #res := ~x; {62#false} is VALID [2020-07-10 14:40:48,159 INFO L280 TraceCheckUtils]: 7: Hoare triple {62#false} assume true; {62#false} is VALID [2020-07-10 14:40:48,160 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {62#false} {61#true} #178#return; {62#false} is VALID [2020-07-10 14:40:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:48,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {61#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {61#true} is VALID [2020-07-10 14:40:48,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {61#true} assume true; {61#true} is VALID [2020-07-10 14:40:48,173 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {61#true} {62#false} #180#return; {62#false} is VALID [2020-07-10 14:40:48,175 INFO L263 TraceCheckUtils]: 0: Hoare triple {61#true} call ULTIMATE.init(); {78#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} is VALID [2020-07-10 14:40:48,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {61#true} is VALID [2020-07-10 14:40:48,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {61#true} assume true; {61#true} is VALID [2020-07-10 14:40:48,176 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {61#true} {61#true} #174#return; {61#true} is VALID [2020-07-10 14:40:48,177 INFO L263 TraceCheckUtils]: 4: Hoare triple {61#true} call #t~ret26 := main(); {61#true} is VALID [2020-07-10 14:40:48,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {61#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(8); {61#true} is VALID [2020-07-10 14:40:48,180 INFO L263 TraceCheckUtils]: 6: Hoare triple {61#true} call #t~ret21 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {79#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:48,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {79#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0; {61#true} is VALID [2020-07-10 14:40:48,181 INFO L280 TraceCheckUtils]: 8: Hoare triple {61#true} assume !true; {62#false} is VALID [2020-07-10 14:40:48,182 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {62#false} is VALID [2020-07-10 14:40:48,182 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#false} assume ~j0~0 < 20; {62#false} is VALID [2020-07-10 14:40:48,182 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#false} assume ~j0~0 < 0; {62#false} is VALID [2020-07-10 14:40:48,183 INFO L280 TraceCheckUtils]: 12: Hoare triple {62#false} assume !true; {62#false} is VALID [2020-07-10 14:40:48,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#false} #res := ~x; {62#false} is VALID [2020-07-10 14:40:48,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#false} assume true; {62#false} is VALID [2020-07-10 14:40:48,184 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {62#false} {61#true} #178#return; {62#false} is VALID [2020-07-10 14:40:48,184 INFO L280 TraceCheckUtils]: 16: Hoare triple {62#false} ~res~0 := #t~ret21;havoc #t~ret21;call #t~mem22 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); {62#false} is VALID [2020-07-10 14:40:48,185 INFO L263 TraceCheckUtils]: 17: Hoare triple {62#false} call #t~ret23 := isnan_double(#t~mem22); {61#true} is VALID [2020-07-10 14:40:48,185 INFO L280 TraceCheckUtils]: 18: Hoare triple {61#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {61#true} is VALID [2020-07-10 14:40:48,185 INFO L280 TraceCheckUtils]: 19: Hoare triple {61#true} assume true; {61#true} is VALID [2020-07-10 14:40:48,186 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {61#true} {62#false} #180#return; {62#false} is VALID [2020-07-10 14:40:48,186 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#false} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;#t~short25 := 0 != #t~ret23; {62#false} is VALID [2020-07-10 14:40:48,187 INFO L280 TraceCheckUtils]: 22: Hoare triple {62#false} assume !#t~short25; {62#false} is VALID [2020-07-10 14:40:48,187 INFO L280 TraceCheckUtils]: 23: Hoare triple {62#false} assume #t~short25;havoc #t~ret24;havoc #t~mem22;havoc #t~short25;havoc #t~ret23; {62#false} is VALID [2020-07-10 14:40:48,187 INFO L280 TraceCheckUtils]: 24: Hoare triple {62#false} assume !false; {62#false} is VALID [2020-07-10 14:40:48,191 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-10 14:40:48,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129453664] [2020-07-10 14:40:48,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:40:48,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:40:48,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331730915] [2020-07-10 14:40:48,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 14:40:48,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:40:48,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:40:48,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:40:48,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:40:48,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:40:48,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:40:48,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:40:48,273 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2020-07-10 14:40:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:48,909 INFO L93 Difference]: Finished difference Result 108 states and 162 transitions. [2020-07-10 14:40:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:40:48,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 14:40:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:40:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:40:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2020-07-10 14:40:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:40:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2020-07-10 14:40:48,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2020-07-10 14:40:49,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:40:49,262 INFO L225 Difference]: With dead ends: 108 [2020-07-10 14:40:49,263 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 14:40:49,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-10 14:40:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 14:40:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-10 14:40:49,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:40:49,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:49,346 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:49,347 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:49,354 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-10 14:40:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-10 14:40:49,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:49,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:49,356 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:49,356 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:49,362 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-10 14:40:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-10 14:40:49,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:49,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:49,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:40:49,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:40:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 14:40:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-10 14:40:49,370 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 25 [2020-07-10 14:40:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:40:49,371 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-10 14:40:49,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:40:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-10 14:40:49,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:40:49,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:40:49,373 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] [2020-07-10 14:40:49,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:40:49,374 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:40:49,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:40:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1987482264, now seen corresponding path program 1 times [2020-07-10 14:40:49,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:40:49,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917271407] [2020-07-10 14:40:49,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:40:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:49,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {417#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {397#true} is VALID [2020-07-10 14:40:49,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-10 14:40:49,584 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {397#true} {397#true} #174#return; {397#true} is VALID [2020-07-10 14:40:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:49,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {418#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0; {397#true} is VALID [2020-07-10 14:40:49,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {397#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);~i0~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~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~i1~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~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {397#true} is VALID [2020-07-10 14:40:49,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#true} goto; {397#true} is VALID [2020-07-10 14:40:49,619 INFO L280 TraceCheckUtils]: 3: Hoare triple {397#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {397#true} is VALID [2020-07-10 14:40:49,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {397#true} assume ~j0~0 < 20; {397#true} is VALID [2020-07-10 14:40:49,619 INFO L280 TraceCheckUtils]: 5: Hoare triple {397#true} assume ~j0~0 < 0; {397#true} is VALID [2020-07-10 14:40:49,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {397#true} call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.allocOnStack(8);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4);call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4);call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8);call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8);havoc #t~mem4;call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset);havoc ~#iw_u~0.base, ~#iw_u~0.offset; {397#true} is VALID [2020-07-10 14:40:49,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {397#true} goto; {397#true} is VALID [2020-07-10 14:40:49,620 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#true} #res := ~x; {397#true} is VALID [2020-07-10 14:40:49,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-10 14:40:49,621 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #178#return; {397#true} is VALID [2020-07-10 14:40:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:49,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {397#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {397#true} is VALID [2020-07-10 14:40:49,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-10 14:40:49,628 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {397#true} {397#true} #180#return; {397#true} is VALID [2020-07-10 14:40:49,630 INFO L263 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {417#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} is VALID [2020-07-10 14:40:49,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {417#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {397#true} is VALID [2020-07-10 14:40:49,630 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-10 14:40:49,630 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #174#return; {397#true} is VALID [2020-07-10 14:40:49,631 INFO L263 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret26 := main(); {397#true} is VALID [2020-07-10 14:40:49,631 INFO L280 TraceCheckUtils]: 5: Hoare triple {397#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(8); {397#true} is VALID [2020-07-10 14:40:49,633 INFO L263 TraceCheckUtils]: 6: Hoare triple {397#true} call #t~ret21 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {418#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:49,634 INFO L280 TraceCheckUtils]: 7: Hoare triple {418#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0; {397#true} is VALID [2020-07-10 14:40:49,634 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#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);~i0~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~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~i1~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~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {397#true} is VALID [2020-07-10 14:40:49,634 INFO L280 TraceCheckUtils]: 9: Hoare triple {397#true} goto; {397#true} is VALID [2020-07-10 14:40:49,635 INFO L280 TraceCheckUtils]: 10: Hoare triple {397#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {397#true} is VALID [2020-07-10 14:40:49,635 INFO L280 TraceCheckUtils]: 11: Hoare triple {397#true} assume ~j0~0 < 20; {397#true} is VALID [2020-07-10 14:40:49,635 INFO L280 TraceCheckUtils]: 12: Hoare triple {397#true} assume ~j0~0 < 0; {397#true} is VALID [2020-07-10 14:40:49,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {397#true} call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.allocOnStack(8);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4);call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4);call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8);call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8);havoc #t~mem4;call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset);havoc ~#iw_u~0.base, ~#iw_u~0.offset; {397#true} is VALID [2020-07-10 14:40:49,636 INFO L280 TraceCheckUtils]: 14: Hoare triple {397#true} goto; {397#true} is VALID [2020-07-10 14:40:49,636 INFO L280 TraceCheckUtils]: 15: Hoare triple {397#true} #res := ~x; {397#true} is VALID [2020-07-10 14:40:49,636 INFO L280 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-10 14:40:49,637 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {397#true} {397#true} #178#return; {397#true} is VALID [2020-07-10 14:40:49,637 INFO L280 TraceCheckUtils]: 18: Hoare triple {397#true} ~res~0 := #t~ret21;havoc #t~ret21;call #t~mem22 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); {397#true} is VALID [2020-07-10 14:40:49,637 INFO L263 TraceCheckUtils]: 19: Hoare triple {397#true} call #t~ret23 := isnan_double(#t~mem22); {397#true} is VALID [2020-07-10 14:40:49,638 INFO L280 TraceCheckUtils]: 20: Hoare triple {397#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {397#true} is VALID [2020-07-10 14:40:49,638 INFO L280 TraceCheckUtils]: 21: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-10 14:40:49,638 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {397#true} {397#true} #180#return; {397#true} is VALID [2020-07-10 14:40:49,638 INFO L280 TraceCheckUtils]: 23: Hoare triple {397#true} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;#t~short25 := 0 != #t~ret23; {397#true} is VALID [2020-07-10 14:40:49,639 INFO L280 TraceCheckUtils]: 24: Hoare triple {397#true} assume !#t~short25; {416#(not |main_#t~short25|)} is VALID [2020-07-10 14:40:49,641 INFO L280 TraceCheckUtils]: 25: Hoare triple {416#(not |main_#t~short25|)} assume #t~short25;havoc #t~ret24;havoc #t~mem22;havoc #t~short25;havoc #t~ret23; {398#false} is VALID [2020-07-10 14:40:49,642 INFO L280 TraceCheckUtils]: 26: Hoare triple {398#false} assume !false; {398#false} is VALID [2020-07-10 14:40:49,643 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-10 14:40:49,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917271407] [2020-07-10 14:40:49,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:40:49,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:40:49,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466656917] [2020-07-10 14:40:49,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 14:40:49,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:40:49,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:40:49,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:40:49,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:40:49,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:40:49,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:40:49,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:40:49,685 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2020-07-10 14:40:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:50,284 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-07-10 14:40:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:40:50,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 14:40:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:40:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:40:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2020-07-10 14:40:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:40:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2020-07-10 14:40:50,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2020-07-10 14:40:50,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:40:50,392 INFO L225 Difference]: With dead ends: 57 [2020-07-10 14:40:50,392 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 14:40:50,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:40:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 14:40:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-10 14:40:50,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:40:50,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:50,430 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:50,430 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:50,435 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-10 14:40:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-10 14:40:50,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:50,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:50,436 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:50,437 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-10 14:40:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:50,453 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-10 14:40:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-10 14:40:50,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:50,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:50,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:40:50,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:40:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 14:40:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-10 14:40:50,462 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 27 [2020-07-10 14:40:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:40:50,462 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-10 14:40:50,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:40:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-10 14:40:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 14:40:50,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:40:50,464 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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-10 14:40:50,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:40:50,466 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:40:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:40:50,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1590755806, now seen corresponding path program 1 times [2020-07-10 14:40:50,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:40:50,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38679265] [2020-07-10 14:40:50,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:40:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:40:50,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:40:50,603 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.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-10 14:40:50,610 INFO L168 Benchmark]: Toolchain (without parser) took 4141.39 ms. Allocated memory was 138.4 MB in the beginning and 246.9 MB in the end (delta: 108.5 MB). Free memory was 102.4 MB in the beginning and 210.4 MB in the end (delta: -107.9 MB). Peak memory consumption was 619.3 kB. Max. memory is 7.1 GB. [2020-07-10 14:40:50,611 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 14:40:50,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.77 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 179.4 MB in the end (delta: -77.2 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:40:50,613 INFO L168 Benchmark]: Boogie Preprocessor took 86.40 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 176.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:40:50,614 INFO L168 Benchmark]: RCFGBuilder took 790.17 ms. Allocated memory is still 202.4 MB. Free memory was 176.0 MB in the beginning and 125.1 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:40:50,615 INFO L168 Benchmark]: TraceAbstraction took 2825.88 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 124.4 MB in the beginning and 210.4 MB in the end (delta: -86.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 14:40:50,620 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 426.77 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 179.4 MB in the end (delta: -77.2 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.40 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 176.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 790.17 ms. Allocated memory is still 202.4 MB. Free memory was 176.0 MB in the beginning and 125.1 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2825.88 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 124.4 MB in the beginning and 210.4 MB in the end (delta: -86.0 MB). There was no memory consumed. 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...