/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/float_req_bl_1211b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:05:54,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:05:54,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:05:54,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:05:54,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:05:54,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:05:54,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:05:54,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:05:54,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:05:54,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:05:54,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:05:54,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:05:54,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:05:54,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:05:54,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:05:54,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:05:54,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:05:54,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:05:54,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:05:54,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:05:54,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:05:54,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:05:54,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:05:54,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:05:54,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:05:54,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:05:54,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:05:54,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:05:54,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:05:54,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:05:54,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:05:54,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:05:54,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:05:54,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:05:54,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:05:54,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:05:54,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:05:54,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:05:54,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:05:54,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:05:54,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:05:54,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:05:54,899 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:05:54,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:05:54,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:05:54,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:05:54,901 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:05:54,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:05:54,902 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:05:54,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:05:54,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:05:54,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:05:54,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:05:54,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:05:54,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:05:54,903 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:05:54,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:05:54,904 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:05:54,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:05:54,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:05:54,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:05:54,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:05:54,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:05:54,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:05:54,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:05:54,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:05:54,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:05:54,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:05:54,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:05:54,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:05:54,908 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:05:54,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:05:55,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:05:55,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:05:55,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:05:55,212 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:05:55,212 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:05:55,213 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1211b.c [2020-07-17 22:05:55,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab1cfa5a/cc14b468a8984fc6a86d86d82bcc110e/FLAG46432c949 [2020-07-17 22:05:55,746 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:05:55,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1211b.c [2020-07-17 22:05:55,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab1cfa5a/cc14b468a8984fc6a86d86d82bcc110e/FLAG46432c949 [2020-07-17 22:05:56,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab1cfa5a/cc14b468a8984fc6a86d86d82bcc110e [2020-07-17 22:05:56,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:05:56,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:05:56,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:05:56,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:05:56,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:05:56,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf275e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56, skipping insertion in model container [2020-07-17 22:05:56,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:05:56,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:05:56,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:05:56,391 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:05:56,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:05:56,550 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:05:56,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56 WrapperNode [2020-07-17 22:05:56,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:05:56,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:05:56,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:05:56,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:05:56,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:05:56,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:05:56,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:05:56,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:05:56,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:05:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:05:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:05:56,681 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2020-07-17 22:05:56,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-17 22:05:56,681 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2020-07-17 22:05:56,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:05:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:05:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-17 22:05:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2020-07-17 22:05:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:05:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-17 22:05:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:05:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:05:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:05:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-17 22:05:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-17 22:05:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2020-07-17 22:05:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:05:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-07-17 22:05:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:05:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:05:57,328 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:05:57,329 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-17 22:05:57,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:05:57 BoogieIcfgContainer [2020-07-17 22:05:57,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:05:57,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:05:57,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:05:57,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:05:57,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:05:56" (1/3) ... [2020-07-17 22:05:57,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4ab15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:05:57, skipping insertion in model container [2020-07-17 22:05:57,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (2/3) ... [2020-07-17 22:05:57,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4ab15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:05:57, skipping insertion in model container [2020-07-17 22:05:57,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:05:57" (3/3) ... [2020-07-17 22:05:57,342 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211b.c [2020-07-17 22:05:57,352 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:05:57,359 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:05:57,373 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:05:57,397 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:05:57,397 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:05:57,398 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:05:57,398 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:05:57,398 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:05:57,398 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:05:57,399 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:05:57,399 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:05:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-17 22:05:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:05:57,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:05:57,426 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-17 22:05:57,427 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:05:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:05:57,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1328912444, now seen corresponding path program 1 times [2020-07-17 22:05:57,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:05:57,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491013721] [2020-07-17 22:05:57,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:05:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:57,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#(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; {62#true} is VALID [2020-07-17 22:05:57,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-17 22:05:57,645 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {62#true} {62#true} #170#return; {62#true} is VALID [2020-07-17 22:05:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:57,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#(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 ~j0~0;havoc ~i~0; {62#true} is VALID [2020-07-17 22:05:57,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-17 22:05:57,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {63#false} is VALID [2020-07-17 22:05:57,683 INFO L280 TraceCheckUtils]: 3: Hoare triple {63#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {63#false} is VALID [2020-07-17 22:05:57,683 INFO L280 TraceCheckUtils]: 4: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-17 22:05:57,683 INFO L280 TraceCheckUtils]: 5: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-17 22:05:57,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {63#false} #res := ~x; {63#false} is VALID [2020-07-17 22:05:57,684 INFO L280 TraceCheckUtils]: 7: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-17 22:05:57,685 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {63#false} {62#true} #164#return; {63#false} is VALID [2020-07-17 22:05:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:57,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {62#true} is VALID [2020-07-17 22:05:57,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-17 22:05:57,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#false} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {63#false} is VALID [2020-07-17 22:05:57,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-17 22:05:57,703 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {63#false} {63#false} #166#return; {63#false} is VALID [2020-07-17 22:05:57,706 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {81#(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-17 22:05:57,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#(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; {62#true} is VALID [2020-07-17 22:05:57,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-17 22:05:57,707 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #170#return; {62#true} is VALID [2020-07-17 22:05:57,708 INFO L263 TraceCheckUtils]: 4: Hoare triple {62#true} call #t~ret24 := main(); {62#true} is VALID [2020-07-17 22:05:57,708 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4);call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4);havoc #t~nondet17; {62#true} is VALID [2020-07-17 22:05:57,712 INFO L263 TraceCheckUtils]: 6: Hoare triple {62#true} call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:57,712 INFO L280 TraceCheckUtils]: 7: Hoare triple {82#(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 ~j0~0;havoc ~i~0; {62#true} is VALID [2020-07-17 22:05:57,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-17 22:05:57,713 INFO L280 TraceCheckUtils]: 9: Hoare triple {63#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {63#false} is VALID [2020-07-17 22:05:57,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {63#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {63#false} is VALID [2020-07-17 22:05:57,714 INFO L280 TraceCheckUtils]: 11: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-17 22:05:57,714 INFO L280 TraceCheckUtils]: 12: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-17 22:05:57,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {63#false} #res := ~x; {63#false} is VALID [2020-07-17 22:05:57,715 INFO L280 TraceCheckUtils]: 14: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-17 22:05:57,716 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {63#false} {62#true} #164#return; {63#false} is VALID [2020-07-17 22:05:57,716 INFO L280 TraceCheckUtils]: 16: Hoare triple {63#false} ~res~0 := #t~ret18;havoc #t~ret18;call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {63#false} is VALID [2020-07-17 22:05:57,716 INFO L263 TraceCheckUtils]: 17: Hoare triple {63#false} call #t~ret20 := isinf_float(#t~mem19); {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:57,717 INFO L280 TraceCheckUtils]: 18: Hoare triple {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {62#true} is VALID [2020-07-17 22:05:57,718 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-17 22:05:57,718 INFO L280 TraceCheckUtils]: 20: Hoare triple {63#false} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {63#false} is VALID [2020-07-17 22:05:57,719 INFO L280 TraceCheckUtils]: 21: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-17 22:05:57,719 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {63#false} {63#false} #166#return; {63#false} is VALID [2020-07-17 22:05:57,719 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647;#t~short23 := 0 != #t~ret20; {63#false} is VALID [2020-07-17 22:05:57,720 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !#t~short23; {63#false} is VALID [2020-07-17 22:05:57,720 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} assume #t~short23;havoc #t~short23;havoc #t~short22;havoc #t~mem19;havoc #t~ret20;havoc #t~ret21; {63#false} is VALID [2020-07-17 22:05:57,721 INFO L280 TraceCheckUtils]: 26: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-17 22:05:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:05:57,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491013721] [2020-07-17 22:05:57,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:05:57,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:05:57,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808386685] [2020-07-17 22:05:57,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-17 22:05:57,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:05:57,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:05:57,803 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-17 22:05:57,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:05:57,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:05:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:05:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:05:57,817 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 4 states. [2020-07-17 22:05:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:58,401 INFO L93 Difference]: Finished difference Result 110 states and 158 transitions. [2020-07-17 22:05:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:05:58,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-17 22:05:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:05:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:05:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2020-07-17 22:05:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:05:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2020-07-17 22:05:58,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 158 transitions. [2020-07-17 22:05:58,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:05:58,690 INFO L225 Difference]: With dead ends: 110 [2020-07-17 22:05:58,691 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 22:05:58,695 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-17 22:05:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 22:05:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-17 22:05:58,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:05:58,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,780 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,781 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:58,787 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-17 22:05:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:05:58,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:58,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:58,789 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,789 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:58,795 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-17 22:05:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:05:58,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:58,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:58,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:05:58,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:05:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 22:05:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-17 22:05:58,805 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2020-07-17 22:05:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:05:58,805 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-17 22:05:58,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:05:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:05:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:05:58,810 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:05:58,811 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] [2020-07-17 22:05:58,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:05:58,812 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:05:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:05:58,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2017954314, now seen corresponding path program 1 times [2020-07-17 22:05:58,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:05:58,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264085423] [2020-07-17 22:05:58,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:05:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:59,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {431#(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; {408#true} is VALID [2020-07-17 22:05:59,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:59,038 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {408#true} {408#true} #170#return; {408#true} is VALID [2020-07-17 22:05:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:59,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {432#(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 ~j0~0;havoc ~i~0; {408#true} is VALID [2020-07-17 22:05:59,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_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, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {408#true} is VALID [2020-07-17 22:05:59,085 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:59,085 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {408#true} is VALID [2020-07-17 22:05:59,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {408#true} assume ~j0~0 < 23; {408#true} is VALID [2020-07-17 22:05:59,086 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#true} assume ~j0~0 < 0; {408#true} is VALID [2020-07-17 22:05:59,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#true} call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; {408#true} is VALID [2020-07-17 22:05:59,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:59,087 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#true} #res := ~x; {408#true} is VALID [2020-07-17 22:05:59,087 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:59,087 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {408#true} {408#true} #164#return; {408#true} is VALID [2020-07-17 22:05:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:59,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {408#true} is VALID [2020-07-17 22:05:59,102 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#true} call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4);call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4);~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4);havoc #t~union16;havoc #t~mem15;call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset);havoc ~#gf_u~4.base, ~#gf_u~4.offset; {408#true} is VALID [2020-07-17 22:05:59,102 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:59,102 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#true} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {408#true} is VALID [2020-07-17 22:05:59,103 INFO L280 TraceCheckUtils]: 4: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:59,103 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {408#true} {408#true} #166#return; {408#true} is VALID [2020-07-17 22:05:59,104 INFO L263 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {431#(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-17 22:05:59,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {431#(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; {408#true} is VALID [2020-07-17 22:05:59,105 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:59,105 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #170#return; {408#true} is VALID [2020-07-17 22:05:59,105 INFO L263 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret24 := main(); {408#true} is VALID [2020-07-17 22:05:59,106 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4);call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4);havoc #t~nondet17; {408#true} is VALID [2020-07-17 22:05:59,107 INFO L263 TraceCheckUtils]: 6: Hoare triple {408#true} call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:59,108 INFO L280 TraceCheckUtils]: 7: Hoare triple {432#(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 ~j0~0;havoc ~i~0; {408#true} is VALID [2020-07-17 22:05:59,108 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_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, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {408#true} is VALID [2020-07-17 22:05:59,108 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:59,109 INFO L280 TraceCheckUtils]: 10: Hoare triple {408#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {408#true} is VALID [2020-07-17 22:05:59,109 INFO L280 TraceCheckUtils]: 11: Hoare triple {408#true} assume ~j0~0 < 23; {408#true} is VALID [2020-07-17 22:05:59,109 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#true} assume ~j0~0 < 0; {408#true} is VALID [2020-07-17 22:05:59,110 INFO L280 TraceCheckUtils]: 13: Hoare triple {408#true} call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; {408#true} is VALID [2020-07-17 22:05:59,110 INFO L280 TraceCheckUtils]: 14: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:59,110 INFO L280 TraceCheckUtils]: 15: Hoare triple {408#true} #res := ~x; {408#true} is VALID [2020-07-17 22:05:59,111 INFO L280 TraceCheckUtils]: 16: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:59,111 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {408#true} {408#true} #164#return; {408#true} is VALID [2020-07-17 22:05:59,111 INFO L280 TraceCheckUtils]: 18: Hoare triple {408#true} ~res~0 := #t~ret18;havoc #t~ret18;call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {408#true} is VALID [2020-07-17 22:05:59,113 INFO L263 TraceCheckUtils]: 19: Hoare triple {408#true} call #t~ret20 := isinf_float(#t~mem19); {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:59,114 INFO L280 TraceCheckUtils]: 20: Hoare triple {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {408#true} is VALID [2020-07-17 22:05:59,114 INFO L280 TraceCheckUtils]: 21: Hoare triple {408#true} call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4);call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4);~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4);havoc #t~union16;havoc #t~mem15;call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset);havoc ~#gf_u~4.base, ~#gf_u~4.offset; {408#true} is VALID [2020-07-17 22:05:59,115 INFO L280 TraceCheckUtils]: 22: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:59,115 INFO L280 TraceCheckUtils]: 23: Hoare triple {408#true} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {408#true} is VALID [2020-07-17 22:05:59,115 INFO L280 TraceCheckUtils]: 24: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:59,115 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {408#true} {408#true} #166#return; {408#true} is VALID [2020-07-17 22:05:59,116 INFO L280 TraceCheckUtils]: 26: Hoare triple {408#true} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647;#t~short23 := 0 != #t~ret20; {408#true} is VALID [2020-07-17 22:05:59,117 INFO L280 TraceCheckUtils]: 27: Hoare triple {408#true} assume !#t~short23; {430#(not |main_#t~short23|)} is VALID [2020-07-17 22:05:59,119 INFO L280 TraceCheckUtils]: 28: Hoare triple {430#(not |main_#t~short23|)} assume #t~short23;havoc #t~short23;havoc #t~short22;havoc #t~mem19;havoc #t~ret20;havoc #t~ret21; {409#false} is VALID [2020-07-17 22:05:59,120 INFO L280 TraceCheckUtils]: 29: Hoare triple {409#false} assume !false; {409#false} is VALID [2020-07-17 22:05:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:05:59,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264085423] [2020-07-17 22:05:59,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:05:59,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:05:59,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093949200] [2020-07-17 22:05:59,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-17 22:05:59,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:05:59,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:05:59,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:05:59,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:05:59,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:05:59,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:05:59,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:05:59,164 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2020-07-17 22:05:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:59,695 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2020-07-17 22:05:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:05:59,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-17 22:05:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:05:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:05:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2020-07-17 22:05:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:05:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2020-07-17 22:05:59,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2020-07-17 22:05:59,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:05:59,820 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:05:59,820 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 22:05:59,821 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-17 22:05:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 22:05:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-17 22:05:59,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:05:59,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,861 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,861 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:59,865 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-17 22:05:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-17 22:05:59,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:59,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:59,866 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,867 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:59,870 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-17 22:05:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-17 22:05:59,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:59,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:59,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:05:59,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:05:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 22:05:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-17 22:05:59,879 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2020-07-17 22:05:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:05:59,879 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-17 22:05:59,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:05:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-17 22:05:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:05:59,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:05:59,881 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] [2020-07-17 22:05:59,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:05:59,882 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:05:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:05:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2060718957, now seen corresponding path program 1 times [2020-07-17 22:05:59,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:05:59,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949819847] [2020-07-17 22:05:59,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:06:00,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:06:00,100 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-17 22:06:00,107 INFO L168 Benchmark]: Toolchain (without parser) took 3960.55 ms. Allocated memory was 145.8 MB in the beginning and 246.9 MB in the end (delta: 101.2 MB). Free memory was 103.8 MB in the beginning and 212.1 MB in the end (delta: -108.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:06:00,108 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:06:00,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.30 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 103.4 MB in the beginning and 180.2 MB in the end (delta: -76.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:00,110 INFO L168 Benchmark]: Boogie Preprocessor took 65.98 ms. Allocated memory is still 203.4 MB. Free memory was 180.2 MB in the beginning and 176.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:00,111 INFO L168 Benchmark]: RCFGBuilder took 715.38 ms. Allocated memory is still 203.4 MB. Free memory was 176.9 MB in the beginning and 130.8 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:00,111 INFO L168 Benchmark]: TraceAbstraction took 2769.76 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 130.1 MB in the beginning and 212.1 MB in the end (delta: -81.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:06:00,116 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.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 401.30 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 103.4 MB in the beginning and 180.2 MB in the end (delta: -76.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.98 ms. Allocated memory is still 203.4 MB. Free memory was 180.2 MB in the beginning and 176.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 715.38 ms. Allocated memory is still 203.4 MB. Free memory was 176.9 MB in the beginning and 130.8 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2769.76 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 130.1 MB in the beginning and 212.1 MB in the end (delta: -81.9 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...