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/sum60-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:04,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:04,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:04,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:04,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:04,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:04,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:04,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:04,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:04,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:04,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:04,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:04,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:04,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:04,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:04,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:04,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:04,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:04,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:04,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:04,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:04,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:04,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:04,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:04,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:04,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:04,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:04,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:04,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:04,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:04,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:04,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:04,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:04,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:04,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:04,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:04,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:04,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:04,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:04,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:04,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:04,720 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-13 23:21:04,746 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:04,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:04,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:04,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:04,750 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:04,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:04,750 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:04,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:04,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:04,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:04,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:04,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:04,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:04,752 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:04,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:04,752 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:04,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:04,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:04,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:04,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:04,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:04,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:04,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:04,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:04,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:04,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:04,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:04,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:04,757 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-13 23:21:05,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:05,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:05,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:05,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:05,059 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:05,060 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum60-2.i [2019-10-13 23:21:05,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a092185/13932a860b8b43969be5e5288bbf1190/FLAG1e8247126 [2019-10-13 23:21:05,588 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:05,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum60-2.i [2019-10-13 23:21:05,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a092185/13932a860b8b43969be5e5288bbf1190/FLAG1e8247126 [2019-10-13 23:21:06,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a092185/13932a860b8b43969be5e5288bbf1190 [2019-10-13 23:21:06,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:06,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:06,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:06,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:06,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:06,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:06" (1/1) ... [2019-10-13 23:21:06,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b66671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06, skipping insertion in model container [2019-10-13 23:21:06,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:06" (1/1) ... [2019-10-13 23:21:06,037 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:06,056 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:06,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:06,271 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:06,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:06,397 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:06,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06 WrapperNode [2019-10-13 23:21:06,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:06,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:06,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:06,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:06,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06" (1/1) ... [2019-10-13 23:21:06,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06" (1/1) ... [2019-10-13 23:21:06,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06" (1/1) ... [2019-10-13 23:21:06,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06" (1/1) ... [2019-10-13 23:21:06,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06" (1/1) ... [2019-10-13 23:21:06,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06" (1/1) ... [2019-10-13 23:21:06,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06" (1/1) ... [2019-10-13 23:21:06,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:06,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:06,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:06,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:06,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06" (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-13 23:21:06,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:06,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-10-13 23:21:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:21:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-10-13 23:21:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 23:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 23:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 23:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 23:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:21:06,928 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:21:06,928 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 23:21:06,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:06 BoogieIcfgContainer [2019-10-13 23:21:06,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:21:06,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:21:06,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:21:06,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:21:06,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:06" (1/3) ... [2019-10-13 23:21:06,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2534b76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:06, skipping insertion in model container [2019-10-13 23:21:06,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:06" (2/3) ... [2019-10-13 23:21:06,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2534b76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:06, skipping insertion in model container [2019-10-13 23:21:06,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:06" (3/3) ... [2019-10-13 23:21:06,937 INFO L109 eAbstractionObserver]: Analyzing ICFG sum60-2.i [2019-10-13 23:21:06,947 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:21:06,955 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:21:06,967 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:21:06,993 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:21:06,994 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:21:06,994 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:21:06,994 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:21:06,994 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:21:06,994 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:21:06,994 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:21:06,995 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:21:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 23:21:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 23:21:07,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:07,021 INFO L380 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-13 23:21:07,023 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1818423299, now seen corresponding path program 1 times [2019-10-13 23:21:07,035 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:07,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973427893] [2019-10-13 23:21:07,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:07,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:07,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:21:07,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973427893] [2019-10-13 23:21:07,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:07,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:07,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530935812] [2019-10-13 23:21:07,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:07,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:07,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:07,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:07,224 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 23:21:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:07,269 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-13 23:21:07,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:07,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 23:21:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:07,288 INFO L225 Difference]: With dead ends: 41 [2019-10-13 23:21:07,289 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 23:21:07,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 23:21:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 23:21:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 23:21:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 23:21:07,358 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-13 23:21:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:07,359 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 23:21:07,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 23:21:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 23:21:07,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:07,364 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:07,365 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2093950433, now seen corresponding path program 1 times [2019-10-13 23:21:07,367 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:07,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828422602] [2019-10-13 23:21:07,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:07,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:07,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:21:07,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828422602] [2019-10-13 23:21:07,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542155435] [2019-10-13 23:21:07,507 INFO L94 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-13 23:21:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:07,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:21:07,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:21:07,615 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:21:07,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:21:07,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-13 23:21:07,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117164262] [2019-10-13 23:21:07,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:07,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:07,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:07,674 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 23:21:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:07,688 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-13 23:21:07,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:07,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 23:21:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:07,690 INFO L225 Difference]: With dead ends: 33 [2019-10-13 23:21:07,690 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 23:21:07,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 23:21:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 23:21:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 23:21:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 23:21:07,705 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-13 23:21:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:07,705 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 23:21:07,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 23:21:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:21:07,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:07,709 INFO L380 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-13 23:21:07,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:07,911 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:07,911 INFO L82 PathProgramCache]: Analyzing trace with hash 903502258, now seen corresponding path program 1 times [2019-10-13 23:21:07,911 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:07,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067947634] [2019-10-13 23:21:07,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:07,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:07,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:21:08,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067947634] [2019-10-13 23:21:08,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:08,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:08,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701704096] [2019-10-13 23:21:08,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:08,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:08,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:08,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:08,021 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-13 23:21:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:08,039 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-13 23:21:08,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:08,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 23:21:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:08,041 INFO L225 Difference]: With dead ends: 31 [2019-10-13 23:21:08,042 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 23:21:08,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 23:21:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 23:21:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 23:21:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-13 23:21:08,048 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-13 23:21:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:08,050 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-13 23:21:08,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-13 23:21:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 23:21:08,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:08,052 INFO L380 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, 1] [2019-10-13 23:21:08,052 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2130547361, now seen corresponding path program 1 times [2019-10-13 23:21:08,053 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:08,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274485302] [2019-10-13 23:21:08,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:08,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:08,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:21:08,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274485302] [2019-10-13 23:21:08,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455856073] [2019-10-13 23:21:08,182 INFO L94 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-13 23:21:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:08,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:21:08,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:21:08,305 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:21:08,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2031008543] [2019-10-13 23:21:08,368 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:08,369 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:08,375 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:08,383 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:08,384 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:08,509 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:10,580 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:10,632 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:10,639 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:10,639 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:10,640 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:10,640 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(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 (not (< main_~i~2 59)) (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (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)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= (mod v_prenex_29 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_prenex_29 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236))))))) (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 (not (< main_~i~2 59)) (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (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)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= (mod v_prenex_29 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_prenex_29 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:21:10,640 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:10,641 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:10,641 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 59)) (<= 59 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) [2019-10-13 23:21:10,641 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:10,641 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:10,641 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_prenex_1 Int) (v_sum_~ret~0_BEFORE_RETURN_1 Int)) (or (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (not (< main_~i~1 60)) (= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) |main_#t~ret4|)) (and (not (< main_~i~1 60)) (= |main_#t~ret4| (+ (mod v_prenex_1 4294967296) (- 4294967296))) (not (<= (mod v_prenex_1 4294967296) 2147483647))))) (exists ((v_prenex_2 Int) (v_sum_~ret~0_BEFORE_RETURN_2 Int)) (or (and (not (<= (mod v_prenex_2 4294967296) 2147483647)) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) |main_#t~ret4|) (not (< main_~i~1 60))) (and (not (< main_~i~1 60)) (= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) |main_#t~ret4|) (<= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647))))) [2019-10-13 23:21:10,642 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:10,642 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:10,643 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:10,644 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:10,644 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:10,644 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:10,644 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:10,645 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 60 main_~i~1) (not (< main_~i~1 60))) [2019-10-13 23:21:10,645 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(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 (not (<= (mod v_prenex_2 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (<= main_~ret~1 2147483647) (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296)) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) main_~ret~1) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_prenex_1 4294967296) (- 4294967296))) (not (<= (mod v_prenex_1 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:10,645 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:10,645 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(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 60)) (<= 60 sum_~i~0)) [2019-10-13 23:21:11,006 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:11,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 23:21:11,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217380717] [2019-10-13 23:21:11,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 23:21:11,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 23:21:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:21:11,010 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-13 23:21:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:13,712 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-13 23:21:13,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:21:13,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-13 23:21:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:13,714 INFO L225 Difference]: With dead ends: 40 [2019-10-13 23:21:13,714 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 23:21:13,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-13 23:21:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 23:21:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 23:21:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 23:21:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-13 23:21:13,722 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-13 23:21:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:13,722 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-13 23:21:13,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 23:21:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-13 23:21:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 23:21:13,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:13,724 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:13,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:13,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash 356639231, now seen corresponding path program 2 times [2019-10-13 23:21:13,927 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:13,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133044251] [2019-10-13 23:21:13,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:13,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:13,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:21:14,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133044251] [2019-10-13 23:21:14,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571695646] [2019-10-13 23:21:14,002 INFO L92 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-13 23:21:14,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 23:21:14,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:14,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:21:14,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 23:21:14,094 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 23:21:14,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2140722099] [2019-10-13 23:21:14,136 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:14,136 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:14,136 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:14,137 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:14,137 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:14,171 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:15,684 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:15,755 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:15,758 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:15,759 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:15,759 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:15,760 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (exists ((v_sum_~ret~0_BEFORE_RETURN_32 Int) (v_prenex_224 Int) (v_sum_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_223 Int)) (or (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_sum_~ret~0_BEFORE_RETURN_32 Int) (v_prenex_224 Int) (v_sum_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_223 Int)) (or (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))))))) [2019-10-13 23:21:15,760 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:15,761 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:15,761 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 59)) (<= 59 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) [2019-10-13 23:21:15,761 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:15,761 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:15,761 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_sum_~ret~0_BEFORE_RETURN_27 Int) (v_prenex_195 Int)) (or (and (not (< main_~i~1 60)) (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)) (and (not (<= (mod v_prenex_195 4294967296) 2147483647)) (not (< main_~i~1 60)) (= (+ (mod v_prenex_195 4294967296) (- 4294967296)) |main_#t~ret4|)))) (exists ((v_prenex_196 Int) (v_sum_~ret~0_BEFORE_RETURN_28 Int)) (or (and (<= (mod v_prenex_196 4294967296) 2147483647) (not (< main_~i~1 60)) (= (mod v_prenex_196 4294967296) |main_#t~ret4|)) (and (not (< main_~i~1 60)) (= |main_#t~ret4| (+ (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) (- 4294967296))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647)))))) [2019-10-13 23:21:15,761 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:15,762 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:15,762 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:15,762 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:15,762 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:15,762 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:15,762 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:15,762 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 60 main_~i~1) (not (< main_~i~1 60))) [2019-10-13 23:21:15,762 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_sum_~ret~0_BEFORE_RETURN_27 Int) (v_prenex_196 Int) (v_sum_~ret~0_BEFORE_RETURN_28 Int) (v_prenex_195 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647)) (= main_~ret~1 (+ (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (<= (mod v_prenex_195 4294967296) 2147483647)) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_prenex_195 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296)) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (<= (mod v_prenex_196 4294967296) 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_prenex_196 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:15,763 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:15,763 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(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 60)) (<= 60 sum_~i~0)) [2019-10-13 23:21:18,219 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:18,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-13 23:21:18,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468433686] [2019-10-13 23:21:18,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 23:21:18,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:18,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 23:21:18,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=397, Unknown=1, NotChecked=0, Total=462 [2019-10-13 23:21:18,223 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-13 23:21:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:19,214 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-13 23:21:19,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:21:19,214 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-13 23:21:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:19,216 INFO L225 Difference]: With dead ends: 44 [2019-10-13 23:21:19,216 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 23:21:19,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=210, Invalid=1271, Unknown=1, NotChecked=0, Total=1482 [2019-10-13 23:21:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 23:21:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-13 23:21:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 23:21:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-13 23:21:19,226 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-13 23:21:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:19,226 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-13 23:21:19,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 23:21:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-13 23:21:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:21:19,228 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:19,228 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:19,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:19,432 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash 906031436, now seen corresponding path program 3 times [2019-10-13 23:21:19,434 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:19,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257108035] [2019-10-13 23:21:19,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:19,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:19,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:21:19,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257108035] [2019-10-13 23:21:19,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604901559] [2019-10-13 23:21:19,566 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:19,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 23:21:19,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:19,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 23:21:19,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:21:19,708 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:21:19,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1624552080] [2019-10-13 23:21:19,806 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:19,807 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:19,808 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:19,808 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:19,808 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:19,833 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:21,217 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:21,245 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:21,248 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:21,248 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:21,248 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:21,249 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_sum_~ret~0_BEFORE_RETURN_58 Int) (v_sum_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int)) (or (and (not (< main_~i~2 59)) (= (mod v_prenex_417 4294967296) main_~ret5~0) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647)) (= (+ (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) (- 4294967296)) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236))))))) (and (exists ((v_sum_~ret~0_BEFORE_RETURN_58 Int) (v_sum_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int)) (or (and (not (< main_~i~2 59)) (= (mod v_prenex_417 4294967296) main_~ret5~0) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647)) (= (+ (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) (- 4294967296)) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:21:21,249 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:21,249 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:21,249 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 59)) (<= 59 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) [2019-10-13 23:21:21,249 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:21,250 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:21,250 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_sum_~ret~0_BEFORE_RETURN_54 Int) (v_prenex_390 Int)) (or (and (= (mod v_sum_~ret~0_BEFORE_RETURN_54 4294967296) |main_#t~ret4|) (<= (mod v_sum_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647) (not (< main_~i~1 60))) (and (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) |main_#t~ret4|) (not (< main_~i~1 60)) (not (<= (mod v_prenex_390 4294967296) 2147483647))))) (exists ((v_prenex_389 Int) (v_sum_~ret~0_BEFORE_RETURN_53 Int)) (or (and (= (mod v_sum_~ret~0_BEFORE_RETURN_53 4294967296) |main_#t~ret4|) (<= (mod v_sum_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647) (not (< main_~i~1 60))) (and (not (<= (mod v_prenex_389 4294967296) 2147483647)) (not (< main_~i~1 60)) (= (+ (mod v_prenex_389 4294967296) (- 4294967296)) |main_#t~ret4|))))) [2019-10-13 23:21:21,250 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:21,250 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:21,250 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:21,251 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:21,251 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:21,251 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:21,251 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:21,251 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 60 main_~i~1) (not (< main_~i~1 60))) [2019-10-13 23:21:21,251 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_sum_~ret~0_BEFORE_RETURN_54 Int) (v_prenex_389 Int) (v_sum_~ret~0_BEFORE_RETURN_53 Int) (v_prenex_390 Int)) (or (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647) (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_sum_~ret~0_BEFORE_RETURN_54 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) main_~ret~1) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (= (mod v_sum_~ret~0_BEFORE_RETURN_53 4294967296) main_~ret~1) (<= main_~ret~1 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (= main_~ret~1 (+ (mod v_prenex_389 4294967296) (- 4294967296))) (not (<= (mod v_prenex_389 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:21,252 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:21,252 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(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 60)) (<= 60 sum_~i~0)) [2019-10-13 23:21:21,591 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:21,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-13 23:21:21,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304272469] [2019-10-13 23:21:21,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 23:21:21,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:21,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 23:21:21,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-10-13 23:21:21,594 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 26 states. [2019-10-13 23:21:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:22,618 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-13 23:21:22,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 23:21:22,618 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-10-13 23:21:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:22,619 INFO L225 Difference]: With dead ends: 54 [2019-10-13 23:21:22,619 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 23:21:22,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-10-13 23:21:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 23:21:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-13 23:21:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 23:21:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-13 23:21:22,628 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-13 23:21:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:22,629 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-13 23:21:22,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 23:21:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-13 23:21:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 23:21:22,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:22,631 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:22,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:22,835 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1194663378, now seen corresponding path program 4 times [2019-10-13 23:21:22,836 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:22,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888162758] [2019-10-13 23:21:22,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:22,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:22,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:21:22,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888162758] [2019-10-13 23:21:22,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206867989] [2019-10-13 23:21:22,997 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:23,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 23:21:23,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:21:23,148 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:21:23,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1955497839] [2019-10-13 23:21:23,422 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:23,422 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:23,423 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:23,423 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:23,423 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:23,440 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:24,992 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:25,037 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:25,041 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:25,041 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:25,041 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:25,042 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_611 Int) (v_sum_~ret~0_BEFORE_RETURN_84 Int) (v_prenex_612 Int) (v_sum_~ret~0_BEFORE_RETURN_83 Int)) (or (and (not (< main_~i~2 59)) (not (<= (mod v_prenex_611 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_611 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_612 4294967296) 2147483647) (= (mod v_prenex_612 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236))))))) (and (exists ((v_prenex_611 Int) (v_sum_~ret~0_BEFORE_RETURN_84 Int) (v_prenex_612 Int) (v_sum_~ret~0_BEFORE_RETURN_83 Int)) (or (and (not (< main_~i~2 59)) (not (<= (mod v_prenex_611 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_611 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_612 4294967296) 2147483647) (= (mod v_prenex_612 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:21:25,042 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:25,042 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:25,042 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 59)) (<= 59 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) [2019-10-13 23:21:25,042 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:25,043 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:25,043 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_prenex_583 Int) (v_sum_~ret~0_BEFORE_RETURN_79 Int)) (or (and (= (mod v_prenex_583 4294967296) |main_#t~ret4|) (not (< main_~i~1 60)) (<= (mod v_prenex_583 4294967296) 2147483647)) (and (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647)) (not (< main_~i~1 60)) (= (+ (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) (- 4294967296)) |main_#t~ret4|)))) (exists ((v_prenex_584 Int) (v_sum_~ret~0_BEFORE_RETURN_80 Int)) (or (and (not (< main_~i~1 60)) (= |main_#t~ret4| (+ (mod v_prenex_584 4294967296) (- 4294967296))) (not (<= (mod v_prenex_584 4294967296) 2147483647))) (and (not (< main_~i~1 60)) (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647))))) [2019-10-13 23:21:25,043 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:25,043 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:25,043 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:25,043 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:25,044 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:25,044 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:25,044 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:25,044 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 60 main_~i~1) (not (< main_~i~1 60))) [2019-10-13 23:21:25,044 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_prenex_583 Int) (v_sum_~ret~0_BEFORE_RETURN_79 Int) (v_prenex_584 Int) (v_sum_~ret~0_BEFORE_RETURN_80 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (<= (mod v_prenex_583 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (mod v_prenex_583 4294967296)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647)) (not (< main_~i~1 60)) (= main_~ret~1 (+ (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_584 4294967296) 2147483647)) (= main_~ret~1 (+ (mod v_prenex_584 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:25,045 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:25,045 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(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 60)) (<= 60 sum_~i~0)) [2019-10-13 23:21:25,438 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:25,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 23:21:25,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335889808] [2019-10-13 23:21:25,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-13 23:21:25,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:25,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-13 23:21:25,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 23:21:25,442 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 40 states. [2019-10-13 23:21:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:26,946 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2019-10-13 23:21:26,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-13 23:21:26,946 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-10-13 23:21:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:26,948 INFO L225 Difference]: With dead ends: 68 [2019-10-13 23:21:26,948 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 23:21:26,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1244, Invalid=4158, Unknown=0, NotChecked=0, Total=5402 [2019-10-13 23:21:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 23:21:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-13 23:21:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 23:21:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-13 23:21:26,960 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2019-10-13 23:21:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:26,961 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-13 23:21:26,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-13 23:21:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-13 23:21:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 23:21:26,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:26,963 INFO L380 BasicCegarLoop]: trace histogram [26, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:27,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:27,174 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:27,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1997950062, now seen corresponding path program 5 times [2019-10-13 23:21:27,175 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:27,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045891624] [2019-10-13 23:21:27,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:27,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:27,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:21:27,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045891624] [2019-10-13 23:21:27,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583891059] [2019-10-13 23:21:27,627 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:27,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 23:21:27,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:27,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:21:27,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-13 23:21:27,846 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-13 23:21:27,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1048924796] [2019-10-13 23:21:27,895 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:27,896 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:27,896 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:27,896 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:27,897 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:27,913 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:29,128 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:29,150 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:29,153 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:29,153 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:29,153 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:29,154 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_sum_~ret~0_BEFORE_RETURN_109 Int) (v_prenex_806 Int) (v_sum_~ret~0_BEFORE_RETURN_110 Int) (v_prenex_805 Int)) (or (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_110 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_110 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= main_~ret5~0 (mod v_prenex_806 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_806 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_109 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_109 4294967296)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= (+ (mod v_prenex_805 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_805 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236))))))) (and (exists ((v_sum_~ret~0_BEFORE_RETURN_109 Int) (v_prenex_806 Int) (v_sum_~ret~0_BEFORE_RETURN_110 Int) (v_prenex_805 Int)) (or (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_110 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_110 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= main_~ret5~0 (mod v_prenex_806 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_806 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_109 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_109 4294967296)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= (+ (mod v_prenex_805 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_805 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:21:29,154 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:29,154 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:29,154 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 59)) (<= 59 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) [2019-10-13 23:21:29,155 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:29,155 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 23:21:29,155 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_sum_~ret~0_BEFORE_RETURN_106 Int) (v_prenex_778 Int)) (or (and (not (<= (mod v_prenex_778 4294967296) 2147483647)) (not (< main_~i~1 60)) (= (+ (mod v_prenex_778 4294967296) (- 4294967296)) |main_#t~ret4|)) (and (not (< main_~i~1 60)) (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_106 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_106 4294967296) 2147483647)))) (exists ((v_prenex_777 Int) (v_sum_~ret~0_BEFORE_RETURN_105 Int)) (or (and (<= (mod v_prenex_777 4294967296) 2147483647) (not (< main_~i~1 60)) (= (mod v_prenex_777 4294967296) |main_#t~ret4|)) (and (not (< main_~i~1 60)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_105 4294967296) 2147483647)) (= |main_#t~ret4| (+ (mod v_sum_~ret~0_BEFORE_RETURN_105 4294967296) (- 4294967296))))))) [2019-10-13 23:21:29,155 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:29,155 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:29,156 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:29,156 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:29,156 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:29,156 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:29,156 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:29,158 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 60 main_~i~1) (not (< main_~i~1 60))) [2019-10-13 23:21:29,159 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_prenex_777 Int) (v_sum_~ret~0_BEFORE_RETURN_106 Int) (v_sum_~ret~0_BEFORE_RETURN_105 Int) (v_prenex_778 Int)) (or (and (<= (mod v_prenex_777 4294967296) 2147483647) (= main_~ret~1 (mod v_prenex_777 4294967296)) (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_778 4294967296) 2147483647)) (= (+ (mod v_prenex_778 4294967296) (- 4294967296)) main_~ret~1) (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (= main_~ret~1 (+ (mod v_sum_~ret~0_BEFORE_RETURN_105 4294967296) (- 4294967296))) (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_105 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_106 4294967296)) (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_sum_~ret~0_BEFORE_RETURN_106 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:29,159 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:29,159 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(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 60)) (<= 60 sum_~i~0)) [2019-10-13 23:21:29,777 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:29,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4, 11] total 43 [2019-10-13 23:21:29,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262152894] [2019-10-13 23:21:29,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-13 23:21:29,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-13 23:21:29,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1443, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 23:21:29,781 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 44 states. [2019-10-13 23:21:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:31,959 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-13 23:21:31,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-13 23:21:31,959 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-10-13 23:21:31,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:31,961 INFO L225 Difference]: With dead ends: 72 [2019-10-13 23:21:31,961 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 23:21:31,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1349, Invalid=5457, Unknown=0, NotChecked=0, Total=6806 [2019-10-13 23:21:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 23:21:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-13 23:21:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 23:21:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-13 23:21:31,972 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 63 [2019-10-13 23:21:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:31,973 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-13 23:21:31,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-13 23:21:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-13 23:21:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 23:21:31,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:31,975 INFO L380 BasicCegarLoop]: trace histogram [27, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:32,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:32,179 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:32,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:32,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1475332959, now seen corresponding path program 6 times [2019-10-13 23:21:32,180 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:32,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713489419] [2019-10-13 23:21:32,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:32,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:32,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 23:21:32,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713489419] [2019-10-13 23:21:32,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939972604] [2019-10-13 23:21:32,664 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:32,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 23:21:32,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:32,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 23:21:32,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 23:21:32,933 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 23:21:33,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159570800] [2019-10-13 23:21:33,932 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:33,932 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:33,932 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:33,933 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:33,933 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:33,957 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:35,227 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:35,254 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:35,257 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:35,258 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:35,258 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:35,258 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_sum_~ret~0_BEFORE_RETURN_136 Int) (v_prenex_1000 Int) (v_sum_~ret~0_BEFORE_RETURN_135 Int) (v_prenex_999 Int)) (or (and (not (< main_~i~2 59)) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_136 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_136 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= (mod v_prenex_999 4294967296) main_~ret5~0) (<= (mod v_prenex_999 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= main_~ret5~0 (+ (mod v_prenex_1000 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_1000 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236))))))) (and (exists ((v_sum_~ret~0_BEFORE_RETURN_136 Int) (v_prenex_1000 Int) (v_sum_~ret~0_BEFORE_RETURN_135 Int) (v_prenex_999 Int)) (or (and (not (< main_~i~2 59)) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_136 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_136 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= (mod v_prenex_999 4294967296) main_~ret5~0) (<= (mod v_prenex_999 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) (and (not (< main_~i~2 59)) (= main_~ret5~0 (+ (mod v_prenex_1000 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_1000 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:21:35,259 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:35,259 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:35,259 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 59)) (<= 59 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 236)))) [2019-10-13 23:21:35,260 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:35,260 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:35,260 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_prenex_971 Int) (v_sum_~ret~0_BEFORE_RETURN_131 Int)) (or (and (= |main_#t~ret4| (+ (mod v_prenex_971 4294967296) (- 4294967296))) (not (<= (mod v_prenex_971 4294967296) 2147483647)) (not (< main_~i~1 60))) (and (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_131 4294967296)) (not (< main_~i~1 60)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_131 4294967296) 2147483647)))) (exists ((v_prenex_972 Int) (v_sum_~ret~0_BEFORE_RETURN_132 Int)) (or (and (not (<= (mod v_prenex_972 4294967296) 2147483647)) (not (< main_~i~1 60)) (= (+ (mod v_prenex_972 4294967296) (- 4294967296)) |main_#t~ret4|)) (and (= (mod v_sum_~ret~0_BEFORE_RETURN_132 4294967296) |main_#t~ret4|) (<= (mod v_sum_~ret~0_BEFORE_RETURN_132 4294967296) 2147483647) (not (< main_~i~1 60)))))) [2019-10-13 23:21:35,261 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:35,261 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:21:35,261 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:35,261 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:35,262 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:35,262 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:35,262 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:35,262 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 60 main_~i~1) (not (< main_~i~1 60))) [2019-10-13 23:21:35,263 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_prenex_972 Int) (v_prenex_971 Int) (v_sum_~ret~0_BEFORE_RETURN_132 Int) (v_sum_~ret~0_BEFORE_RETURN_131 Int)) (or (and (<= main_~ret~1 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_132 4294967296) 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_132 4294967296)) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_972 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~ret~1 (+ (mod v_prenex_972 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_971 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~ret~1 (+ (mod v_prenex_971 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 60)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_sum_~ret~0_BEFORE_RETURN_131 4294967296) 2147483647) (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_131 4294967296)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:35,263 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:35,263 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(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 60)) (<= 60 sum_~i~0)) [2019-10-13 23:21:35,870 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:35,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-13 23:21:35,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000762784] [2019-10-13 23:21:35,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-13 23:21:35,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:35,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-13 23:21:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=3090, Unknown=0, NotChecked=0, Total=4830 [2019-10-13 23:21:35,875 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 70 states. [2019-10-13 23:21:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:39,388 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2019-10-13 23:21:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-13 23:21:39,388 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 67 [2019-10-13 23:21:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:39,390 INFO L225 Difference]: With dead ends: 104 [2019-10-13 23:21:39,390 INFO L226 Difference]: Without dead ends: 83 [2019-10-13 23:21:39,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3929 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5099, Invalid=12723, Unknown=0, NotChecked=0, Total=17822 [2019-10-13 23:21:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-13 23:21:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-13 23:21:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-13 23:21:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-10-13 23:21:39,406 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2019-10-13 23:21:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:39,406 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-10-13 23:21:39,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-13 23:21:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-10-13 23:21:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 23:21:39,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:39,410 INFO L380 BasicCegarLoop]: trace histogram [56, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:39,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:39,611 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:39,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash 441486205, now seen corresponding path program 7 times [2019-10-13 23:21:39,612 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:39,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329042910] [2019-10-13 23:21:39,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:39,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:39,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 23:21:41,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329042910] [2019-10-13 23:21:41,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162225349] [2019-10-13 23:21:41,001 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:41,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 23:21:41,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 23:21:41,312 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 23:21:42,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1820523570] [2019-10-13 23:21:42,861 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:42,861 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:42,862 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:42,862 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:42,862 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:42,879 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs