java -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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/reducercommutativity/sum.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:37:37,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:37:37,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:37:37,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:37:37,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:37:37,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:37:37,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:37:37,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:37:37,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:37:37,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:37:37,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:37:37,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:37:37,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:37:37,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:37:37,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:37:37,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:37:37,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:37:37,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:37:37,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:37:37,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:37:37,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:37:37,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:37:37,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:37:37,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:37:37,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:37:37,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:37:37,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:37:37,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:37:37,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:37:37,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:37:37,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:37:37,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:37:37,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:37:37,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:37:37,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:37:37,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:37:37,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:37:37,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:37:37,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:37:37,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:37:37,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:37:37,336 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 [2019-10-07 15:37:37,365 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:37:37,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:37:37,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:37:37,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:37:37,367 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:37:37,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:37:37,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:37:37,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:37:37,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:37:37,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:37:37,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:37:37,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:37:37,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:37:37,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:37:37,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:37:37,369 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:37:37,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:37:37,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:37:37,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:37:37,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:37:37,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:37:37,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:37:37,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:37:37,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:37:37,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:37:37,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:37:37,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:37:37,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:37:37,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 15:37:37,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:37:37,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:37:37,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:37:37,674 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:37:37,675 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:37:37,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum.i [2019-10-07 15:37:37,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc3f953a/76226aba96dc47989386105bb2160288/FLAGd01187266 [2019-10-07 15:37:38,287 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:37:38,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum.i [2019-10-07 15:37:38,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc3f953a/76226aba96dc47989386105bb2160288/FLAGd01187266 [2019-10-07 15:37:38,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc3f953a/76226aba96dc47989386105bb2160288 [2019-10-07 15:37:38,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:37:38,710 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:37:38,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:37:38,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:37:38,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:37:38,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:37:38" (1/1) ... [2019-10-07 15:37:38,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70fc59ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:38, skipping insertion in model container [2019-10-07 15:37:38,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:37:38" (1/1) ... [2019-10-07 15:37:38,726 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:37:38,749 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:37:38,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:37:38,972 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:37:38,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:37:39,008 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:37:39,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39 WrapperNode [2019-10-07 15:37:39,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:37:39,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:37:39,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:37:39,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:37:39,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39" (1/1) ... [2019-10-07 15:37:39,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39" (1/1) ... [2019-10-07 15:37:39,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39" (1/1) ... [2019-10-07 15:37:39,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39" (1/1) ... [2019-10-07 15:37:39,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39" (1/1) ... [2019-10-07 15:37:39,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39" (1/1) ... [2019-10-07 15:37:39,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39" (1/1) ... [2019-10-07 15:37:39,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:37:39,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:37:39,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:37:39,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:37:39,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:37:39,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:37:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:37:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-10-07 15:37:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:37:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:37:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 15:37:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-10-07 15:37:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 15:37:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:37:39,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 15:37:39,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 15:37:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 15:37:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:37:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:37:39,593 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:37:39,594 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 15:37:39,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:37:39 BoogieIcfgContainer [2019-10-07 15:37:39,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:37:39,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:37:39,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:37:39,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:37:39,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:37:38" (1/3) ... [2019-10-07 15:37:39,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70948c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:37:39, skipping insertion in model container [2019-10-07 15:37:39,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:39" (2/3) ... [2019-10-07 15:37:39,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70948c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:37:39, skipping insertion in model container [2019-10-07 15:37:39,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:37:39" (3/3) ... [2019-10-07 15:37:39,602 INFO L109 eAbstractionObserver]: Analyzing ICFG sum.i [2019-10-07 15:37:39,612 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:37:39,620 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:37:39,632 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:37:39,657 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:37:39,658 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:37:39,658 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:37:39,658 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:37:39,658 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:37:39,659 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:37:39,659 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:37:39,659 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:37:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-07 15:37:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 15:37:39,684 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:39,685 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:37:39,687 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:39,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1602370502, now seen corresponding path program 1 times [2019-10-07 15:37:39,702 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:39,703 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:39,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:39,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 15:37:39,954 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:39,955 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:37:39,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:40,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:37:40,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:37:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 15:37:40,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:37:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 15:37:40,248 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 15:37:40,248 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2019-10-07 15:37:40,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:37:40,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:37:40,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 15:37:40,272 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-10-07 15:37:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:37:40,392 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-10-07 15:37:40,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:37:40,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-07 15:37:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:37:40,404 INFO L225 Difference]: With dead ends: 46 [2019-10-07 15:37:40,404 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 15:37:40,408 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 15:37:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 15:37:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 15:37:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 15:37:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-07 15:37:40,455 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 24 [2019-10-07 15:37:40,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:37:40,455 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-07 15:37:40,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:37:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-07 15:37:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 15:37:40,458 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:40,458 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:37:40,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:40,665 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:40,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1904412546, now seen corresponding path program 1 times [2019-10-07 15:37:40,666 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:40,666 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:40,667 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:40,667 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 15:37:40,799 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:40,800 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:37:40,800 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:37:40,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:37:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:37:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:37:40,805 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 4 states. [2019-10-07 15:37:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:37:40,857 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 15:37:40,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:37:40,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-07 15:37:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:37:40,859 INFO L225 Difference]: With dead ends: 30 [2019-10-07 15:37:40,859 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 15:37:40,860 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:37:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 15:37:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 15:37:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 15:37:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-10-07 15:37:40,867 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 27 [2019-10-07 15:37:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:37:40,870 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-07 15:37:40,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:37:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-10-07 15:37:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 15:37:40,871 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:40,872 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:37:40,872 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:40,873 INFO L82 PathProgramCache]: Analyzing trace with hash 852534480, now seen corresponding path program 1 times [2019-10-07 15:37:40,873 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:40,873 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:40,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:40,874 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 15:37:41,014 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:41,014 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:37:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:41,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 15:37:41,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:37:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 15:37:41,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:37:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 15:37:41,230 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:37:41,262 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:37:41,262 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:37:41,272 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:37:41,286 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:37:41,287 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:37:41,460 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 15:37:43,516 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-07 15:37:43,571 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-07 15:37:43,578 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:37:43,579 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:37:43,579 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 618#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 15:37:43,579 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 449#true [2019-10-07 15:37:43,579 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 609#(<= 0 sum_~i~0) [2019-10-07 15:37:43,580 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 492#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (not (< (+ main_~i~1 1) ~N~0))) [2019-10-07 15:37:43,580 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 90#(or (exists ((v_prenex_2 Int) (v_sum_~ret~0_BEFORE_RETURN_2 Int)) (or (and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) |main_#t~ret3|) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (<= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647)) (and (not (<= (mod v_prenex_2 4294967296) 2147483647)) (= 0 |#NULL.base|) (<= ~N~0 2147483647) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) |main_#t~ret3|)))) (exists ((v_prenex_1 Int) (v_sum_~ret~0_BEFORE_RETURN_1 Int)) (or (and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647)) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~ret3| (+ (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) (- 4294967296))) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (<= |#NULL.base| 0) (= (mod v_prenex_1 4294967296) |main_#t~ret3|) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (<= (mod v_prenex_1 4294967296) 2147483647))))) [2019-10-07 15:37:43,580 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:37:43,581 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 ~N~0) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-07 15:37:43,581 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 43#(and (<= ~N~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (select |old(#valid)| |main_~#x~0.base|) 0) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |main_~#x~0.offset|) (<= |main_~#x~0.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (<= 1 ~N~0) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) [2019-10-07 15:37:43,581 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 571#true [2019-10-07 15:37:43,581 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 350#true [2019-10-07 15:37:43,582 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 623#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 15:37:43,582 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:37:43,582 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 283#true [2019-10-07 15:37:43,582 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 557#true [2019-10-07 15:37:43,583 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 530#true [2019-10-07 15:37:43,583 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 562#(or (exists ((v_prenex_2 Int) (v_prenex_1 Int) (v_sum_~ret~0_BEFORE_RETURN_1 Int) (v_sum_~ret~0_BEFORE_RETURN_2 Int)) (or (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= main_~ret~1 (+ (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) (- 4294967296))) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647)) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (not (<= (mod v_prenex_2 4294967296) 2147483647)) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) main_~ret~1) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= main_~ret~1 (mod v_prenex_1 4294967296)) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (<= (mod v_prenex_1 4294967296) 2147483647)) (and (= 0 |#NULL.base|) (= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) main_~ret~1) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (<= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (v_sum_~ret~0_BEFORE_RETURN_1 Int) (v_sum_~ret~0_BEFORE_RETURN_2 Int)) (or (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (not (<= (mod v_prenex_2 4294967296) 2147483647)) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) main_~ret~1) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= main_~ret~1 (+ (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) (- 4294967296))) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647)) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= main_~ret~1 (mod v_prenex_1 4294967296)) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (<= (mod v_prenex_1 4294967296) 2147483647)) (and (= 0 |#NULL.base|) (= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) main_~ret~1) (= |#valid| (store |old(#valid)| |main_~#x~0.base| 1)) (= (store |old(#memory_int)| |main_~#x~0.base| (store (store (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset| (select (select |old(#memory_int)| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (+ |main_~#x~0.offset| 4) main_~temp~0)) |#memory_int|) (<= 0 |#NULL.base|) (< 1 ~N~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~N~0 2147483648)) (= (store |old(#length)| |main_~#x~0.base| (* 4 ~N~0)) |#length|) (not (= |main_~#x~0.base| 0)) (< |main_~#x~0.base| |#StackHeapBarrier|) (= |main_~#x~0.offset| 0) (<= |old(~N~0)| 0) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#x~0.base|) 0) (= main_~temp~0 (select (select |old(#memory_int)| |main_~#x~0.base|) |main_~#x~0.offset|)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 (+ main_~ret~1 2147483648)) (= 0 |old(~N~0)|) (<= main_~ret~1 2147483647) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (<= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647))))) [2019-10-07 15:37:43,587 INFO L193 IcfgInterpreter]: Reachable states at location L20 satisfy 38#(and (<= ~N~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-07 15:37:43,588 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 204#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_29 Int) (v_sum_~ret~0_BEFORE_RETURN_5 Int) (v_sum_~ret~0_BEFORE_RETURN_6 Int) (v_prenex_30 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647) (= (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) main_~ret5~0) (not (< (+ main_~i~1 1) ~N~0))) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_6 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0)))))) (and (exists ((v_prenex_29 Int) (v_sum_~ret~0_BEFORE_RETURN_5 Int) (v_sum_~ret~0_BEFORE_RETURN_6 Int) (v_prenex_30 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647) (= (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) main_~ret5~0) (not (< (+ main_~i~1 1) ~N~0))) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_6 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~1 1) ~N~0))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-07 15:37:43,588 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 614#(and (<= 0 sum_~i~0) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (not (< sum_~i~0 ~N~0))) [2019-10-07 15:37:44,445 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:37:44,446 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 12] total 21 [2019-10-07 15:37:44,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 15:37:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 15:37:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-10-07 15:37:44,452 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 22 states. [2019-10-07 15:37:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:37:45,152 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-10-07 15:37:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-07 15:37:45,152 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-10-07 15:37:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:37:45,154 INFO L225 Difference]: With dead ends: 36 [2019-10-07 15:37:45,154 INFO L226 Difference]: Without dead ends: 22 [2019-10-07 15:37:45,155 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-10-07 15:37:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-07 15:37:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-07 15:37:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-07 15:37:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-07 15:37:45,164 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 28 [2019-10-07 15:37:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:37:45,164 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-07 15:37:45,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 15:37:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-07 15:37:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-07 15:37:45,167 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:45,167 INFO L385 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:37:45,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:45,377 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash -808289344, now seen corresponding path program 2 times [2019-10-07 15:37:45,379 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:45,379 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:45,379 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:45,380 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:46,713 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 23 [2019-10-07 15:37:46,878 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 23 [2019-10-07 15:37:47,373 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 26 [2019-10-07 15:37:47,603 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 30 [2019-10-07 15:37:51,812 WARN L191 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 61 DAG size of output: 29 [2019-10-07 15:37:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 15:37:52,124 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:52,124 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:37:52,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:52,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-07 15:37:52,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 15:37:52,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 91 conjunts are in the unsatisfiable core [2019-10-07 15:37:52,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:37:52,706 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-10-07 15:37:54,083 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-10-07 15:37:54,511 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-10-07 15:37:56,305 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 176 DAG size of output: 172 [2019-10-07 15:37:57,705 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 168 DAG size of output: 164 [2019-10-07 15:37:58,333 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-10-07 15:37:59,228 WARN L191 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 145 [2019-10-07 15:37:59,936 WARN L191 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 135 [2019-10-07 15:38:00,250 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-10-07 15:38:00,651 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-10-07 15:38:01,628 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 130 [2019-10-07 15:38:01,970 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-10-07 15:38:02,479 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 59 [2019-10-07 15:38:02,901 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-07 15:38:03,167 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-07 15:38:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 15:38:19,169 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:38:20,779 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-10-07 15:38:20,799 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-07 15:38:21,704 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-07 15:38:25,911 WARN L191 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 272 DAG size of output: 63 [2019-10-07 15:38:26,157 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-10-07 15:38:26,811 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-07 15:39:39,625 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 117