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/sum10-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:20:56,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:20:56,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:20:56,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:20:56,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:20:56,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:20:56,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:20:56,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:20:56,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:20:56,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:20:56,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:20:56,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:20:56,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:20:56,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:20:56,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:20:56,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:20:56,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:20:56,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:20:56,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:20:56,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:20:56,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:20:56,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:20:56,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:20:56,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:20:56,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:20:56,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:20:56,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:20:56,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:20:56,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:20:56,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:20:56,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:20:56,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:20:56,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:20:56,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:20:56,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:20:56,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:20:56,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:20:56,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:20:56,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:20:56,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:20:56,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:20:56,126 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:20:56,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:20:56,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:20:56,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:20:56,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:20:56,151 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:20:56,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:20:56,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:20:56,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:20:56,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:20:56,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:20:56,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:20:56,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:20:56,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:20:56,159 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:20:56,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:20:56,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:20:56,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:20:56,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:20:56,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:20:56,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:20:56,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:20:56,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:20:56,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:20:56,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:20:56,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:20:56,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:20:56,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:20:56,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:20:56,163 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:20:56,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:20:56,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:20:56,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:20:56,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:20:56,529 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:20:56,530 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum10-1.i [2019-10-13 23:20:56,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd950ff6/4d626107ceb242fe84ea98a66e5f123c/FLAGe84ea304f [2019-10-13 23:20:57,036 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:20:57,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum10-1.i [2019-10-13 23:20:57,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd950ff6/4d626107ceb242fe84ea98a66e5f123c/FLAGe84ea304f [2019-10-13 23:20:57,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd950ff6/4d626107ceb242fe84ea98a66e5f123c [2019-10-13 23:20:57,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:20:57,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:20:57,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:20:57,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:20:57,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:20:57,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:20:57" (1/1) ... [2019-10-13 23:20:57,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4924bc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57, skipping insertion in model container [2019-10-13 23:20:57,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:20:57" (1/1) ... [2019-10-13 23:20:57,446 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:20:57,466 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:20:57,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:20:57,700 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:20:57,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:20:57,840 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:20:57,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57 WrapperNode [2019-10-13 23:20:57,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:20:57,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:20:57,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:20:57,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:20:57,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57" (1/1) ... [2019-10-13 23:20:57,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57" (1/1) ... [2019-10-13 23:20:57,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57" (1/1) ... [2019-10-13 23:20:57,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57" (1/1) ... [2019-10-13 23:20:57,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57" (1/1) ... [2019-10-13 23:20:57,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57" (1/1) ... [2019-10-13 23:20:57,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57" (1/1) ... [2019-10-13 23:20:57,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:20:57,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:20:57,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:20:57,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:20:57,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57" (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:20:57,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:20:57,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:20:57,970 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-10-13 23:20:57,970 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:20:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:20:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:20:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-10-13 23:20:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 23:20:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:20:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 23:20:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 23:20:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 23:20:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:20:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:20:58,322 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:20:58,322 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 23:20:58,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:20:58 BoogieIcfgContainer [2019-10-13 23:20:58,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:20:58,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:20:58,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:20:58,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:20:58,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:20:57" (1/3) ... [2019-10-13 23:20:58,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c72f4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:20:58, skipping insertion in model container [2019-10-13 23:20:58,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:57" (2/3) ... [2019-10-13 23:20:58,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c72f4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:20:58, skipping insertion in model container [2019-10-13 23:20:58,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:20:58" (3/3) ... [2019-10-13 23:20:58,331 INFO L109 eAbstractionObserver]: Analyzing ICFG sum10-1.i [2019-10-13 23:20:58,341 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:20:58,354 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:20:58,367 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:20:58,391 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:20:58,391 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:20:58,391 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:20:58,391 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:20:58,391 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:20:58,392 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:20:58,392 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:20:58,392 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:20:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 23:20:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 23:20:58,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:58,415 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:20:58,417 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1818423299, now seen corresponding path program 1 times [2019-10-13 23:20:58,428 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:58,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762353275] [2019-10-13 23:20:58,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:58,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:58,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:58,589 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:20:58,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762353275] [2019-10-13 23:20:58,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:20:58,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:20:58,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285941769] [2019-10-13 23:20:58,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:58,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:58,613 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 23:20:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:58,654 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-13 23:20:58,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:58,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 23:20:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:58,662 INFO L225 Difference]: With dead ends: 41 [2019-10-13 23:20:58,663 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 23:20:58,666 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:20:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 23:20:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 23:20:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 23:20:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 23:20:58,704 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-13 23:20:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:58,705 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 23:20:58,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 23:20:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 23:20:58,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:58,707 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:20:58,708 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2093950433, now seen corresponding path program 1 times [2019-10-13 23:20:58,709 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:58,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552685926] [2019-10-13 23:20:58,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:58,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:58,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:58,815 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:20:58,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552685926] [2019-10-13 23:20:58,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405831362] [2019-10-13 23:20:58,817 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:20:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:58,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:20:58,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:58,937 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:20:58,937 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:58,994 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:20:58,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:20:58,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-13 23:20:58,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010517514] [2019-10-13 23:20:58,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:58,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:58,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:58,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:20:59,000 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 23:20:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:59,013 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-13 23:20:59,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:59,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 23:20:59,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:59,015 INFO L225 Difference]: With dead ends: 33 [2019-10-13 23:20:59,015 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 23:20:59,016 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:20:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 23:20:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 23:20:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 23:20:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 23:20:59,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-13 23:20:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:59,029 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 23:20:59,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 23:20:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:20:59,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:59,032 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:20:59,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:59,236 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:59,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash 903502258, now seen corresponding path program 1 times [2019-10-13 23:20:59,237 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:59,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912825914] [2019-10-13 23:20:59,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:59,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:59,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:59,321 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:20:59,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912825914] [2019-10-13 23:20:59,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:20:59,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:20:59,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463313835] [2019-10-13 23:20:59,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:59,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:59,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:59,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:59,324 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-13 23:20:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:59,340 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-13 23:20:59,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:59,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 23:20:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:59,342 INFO L225 Difference]: With dead ends: 31 [2019-10-13 23:20:59,342 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 23:20:59,343 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:20:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 23:20:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 23:20:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 23:20:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-13 23:20:59,354 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-13 23:20:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:59,359 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-13 23:20:59,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-13 23:20:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 23:20:59,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:59,361 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:20:59,361 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:59,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2130547361, now seen corresponding path program 1 times [2019-10-13 23:20:59,362 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:59,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101416934] [2019-10-13 23:20:59,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:59,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:59,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:59,450 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:20:59,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101416934] [2019-10-13 23:20:59,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933915508] [2019-10-13 23:20:59,452 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:20:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:59,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:20:59,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:59,559 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:20:59,560 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:59,627 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:20:59,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [362758570] [2019-10-13 23:20:59,652 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:59,653 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:59,659 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:59,667 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:59,668 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:59,855 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:02,032 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:02,098 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:02,103 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:02,104 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:02,105 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:02,106 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (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 (<= (mod v_prenex_29 4294967296) 2147483647) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (= (mod v_prenex_29 4294967296) main_~ret5~0) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (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)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= 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)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)))) (not (= main_~ret~1 main_~ret5~0))) (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 (<= (mod v_prenex_29 4294967296) 2147483647) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (= (mod v_prenex_29 4294967296) main_~ret5~0) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (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)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= 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)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)))))) [2019-10-13 23:21:02,106 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:02,106 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:02,106 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 9)) (<= 9 main_~i~2) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) [2019-10-13 23:21:02,107 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:02,107 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:02,107 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (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 10))) (and (= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) |main_#t~ret4|) (<= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (not (< main_~i~1 10))))) (exists ((v_prenex_1 Int) (v_sum_~ret~0_BEFORE_RETURN_1 Int)) (or (and (= |main_#t~ret4| (+ (mod v_prenex_1 4294967296) (- 4294967296))) (not (< main_~i~1 10)) (not (<= (mod v_prenex_1 4294967296) 2147483647))) (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) |main_#t~ret4|) (not (< main_~i~1 10)))))) [2019-10-13 23:21:02,107 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:02,108 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:02,108 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:02,108 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:02,108 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:02,109 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:02,109 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:02,109 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-13 23:21:02,110 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) (= 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) (not (< main_~i~1 10)) (<= 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)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) main_~ret~1) (= 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) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= 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 (< main_~i~1 10)) (not (<= (mod v_prenex_1 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:02,110 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:02,110 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (not (< sum_~i~0 10)) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 10 sum_~i~0)) [2019-10-13 23:21:02,499 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:02,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 23:21:02,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155498892] [2019-10-13 23:21:02,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 23:21:02,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:02,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 23:21:02,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:21:02,504 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-13 23:21:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:03,175 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-13 23:21:03,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:21:03,176 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-13 23:21:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:03,177 INFO L225 Difference]: With dead ends: 40 [2019-10-13 23:21:03,177 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 23:21:03,178 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:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 23:21:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 23:21:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 23:21:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-13 23:21:03,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-13 23:21:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:03,186 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-13 23:21:03,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 23:21:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-13 23:21:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 23:21:03,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:03,187 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:03,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:03,391 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash 356639231, now seen corresponding path program 2 times [2019-10-13 23:21:03,392 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:03,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447860778] [2019-10-13 23:21:03,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:03,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:03,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:03,509 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:03,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447860778] [2019-10-13 23:21:03,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865634708] [2019-10-13 23:21:03,513 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:03,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 23:21:03,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:03,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:21:03,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:03,627 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:03,628 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:03,664 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:03,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1232024783] [2019-10-13 23:21:03,666 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:03,666 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:03,667 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:03,667 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:03,667 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:03,701 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:05,367 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:05,402 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:05,406 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:05,406 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:05,407 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:05,407 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 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647))) (and (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (< main_~i~2 9)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (= main_~ret5~0 (mod v_prenex_224 4294967296))))) (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 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647))) (and (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (< main_~i~2 9)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (= main_~ret5~0 (mod v_prenex_224 4294967296))))))) [2019-10-13 23:21:05,407 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:05,407 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:05,408 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 9)) (<= 9 main_~i~2) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) [2019-10-13 23:21:05,408 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:05,408 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:05,408 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 (<= (mod v_prenex_195 4294967296) 2147483647)) (= (+ (mod v_prenex_195 4294967296) (- 4294967296)) |main_#t~ret4|) (not (< main_~i~1 10))) (and (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296)) (not (< main_~i~1 10)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)))) (exists ((v_prenex_196 Int) (v_sum_~ret~0_BEFORE_RETURN_28 Int)) (or (and (= |main_#t~ret4| (+ (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) (- 4294967296))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647)) (not (< main_~i~1 10))) (and (<= (mod v_prenex_196 4294967296) 2147483647) (= (mod v_prenex_196 4294967296) |main_#t~ret4|) (not (< main_~i~1 10)))))) [2019-10-13 23:21:05,409 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:05,409 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:05,409 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:05,409 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:05,409 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:05,409 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:05,410 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:05,410 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-13 23:21:05,410 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) (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296)) (= 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) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= 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))) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (<= (mod v_prenex_195 4294967296) 2147483647)) (= 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))) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (<= (mod v_prenex_196 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (< main_~i~1 10)) (= (mod v_prenex_196 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:05,410 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:05,411 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (not (< sum_~i~0 10)) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 10 sum_~i~0)) [2019-10-13 23:21:05,767 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:05,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-13 23:21:05,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228521388] [2019-10-13 23:21:05,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 23:21:05,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 23:21:05,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-13 23:21:05,770 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-13 23:21:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:06,682 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-13 23:21:06,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:21:06,682 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-13 23:21:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:06,684 INFO L225 Difference]: With dead ends: 44 [2019-10-13 23:21:06,684 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 23:21:06,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 23:21:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 23:21:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-13 23:21:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 23:21:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-13 23:21:06,693 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-13 23:21:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:06,693 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-13 23:21:06,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 23:21:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-13 23:21:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:21:06,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:06,695 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:06,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:06,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:06,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:06,900 INFO L82 PathProgramCache]: Analyzing trace with hash 906031436, now seen corresponding path program 3 times [2019-10-13 23:21:06,900 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:06,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046459067] [2019-10-13 23:21:06,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:06,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:06,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:06,992 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:06,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046459067] [2019-10-13 23:21:06,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074400078] [2019-10-13 23:21:06,992 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:07,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 23:21:07,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:07,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 23:21:07,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-13 23:21:07,166 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-13 23:21:07,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1707105596] [2019-10-13 23:21:07,253 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:07,253 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:07,254 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:07,254 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:07,255 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:07,274 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:08,974 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:09,000 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:09,004 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:09,005 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:09,005 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:09,005 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (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 (= (mod v_prenex_417 4294967296) main_~ret5~0) (not (< main_~i~2 9)) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (= (+ (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) (- 4294967296)) main_~ret5~0)) (and (= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) main_~ret5~0) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296)))))) (not (= main_~ret~1 main_~ret5~0))) (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 (= (mod v_prenex_417 4294967296) main_~ret5~0) (not (< main_~i~2 9)) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (= (+ (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) (- 4294967296)) main_~ret5~0)) (and (= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) main_~ret5~0) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296)))))))) [2019-10-13 23:21:09,006 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:09,006 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:09,006 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 9)) (<= 9 main_~i~2) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) [2019-10-13 23:21:09,006 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:09,006 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:09,006 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 10))) (and (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) |main_#t~ret4|) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (not (< main_~i~1 10))))) (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 10))) (and (not (<= (mod v_prenex_389 4294967296) 2147483647)) (= (+ (mod v_prenex_389 4294967296) (- 4294967296)) |main_#t~ret4|) (not (< main_~i~1 10)))))) [2019-10-13 23:21:09,007 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:09,007 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:09,007 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:09,007 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:09,007 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:09,007 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:09,008 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:09,008 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-13 23:21:09,008 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 (<= main_~ret~1 2147483647) (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647) (<= main_~ret~1 2147483647) (= 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) (not (< main_~i~1 10)) (<= 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) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (< main_~i~1 10)) (<= 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) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:09,008 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:09,008 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (not (< sum_~i~0 10)) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 10 sum_~i~0)) [2019-10-13 23:21:09,439 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:09,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 11] total 28 [2019-10-13 23:21:09,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738390945] [2019-10-13 23:21:09,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 23:21:09,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:09,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 23:21:09,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2019-10-13 23:21:09,443 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 29 states. [2019-10-13 23:21:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:10,692 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-13 23:21:10,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 23:21:10,693 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2019-10-13 23:21:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:10,694 INFO L225 Difference]: With dead ends: 54 [2019-10-13 23:21:10,695 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 23:21:10,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=420, Invalid=2336, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 23:21:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 23:21:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-13 23:21:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 23:21:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-13 23:21:10,705 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-13 23:21:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:10,705 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-13 23:21:10,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 23:21:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-13 23:21:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 23:21:10,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:10,707 INFO L380 BasicCegarLoop]: trace histogram [30, 6, 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:10,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:10,917 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:10,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:10,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1834628722, now seen corresponding path program 4 times [2019-10-13 23:21:10,918 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:10,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784044683] [2019-10-13 23:21:10,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:10,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:10,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-10-13 23:21:11,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784044683] [2019-10-13 23:21:11,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094664703] [2019-10-13 23:21:11,049 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:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:11,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 23:21:11,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-10-13 23:21:11,226 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-10-13 23:21:11,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [262892035] [2019-10-13 23:21:11,326 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:11,326 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:11,327 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:11,327 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:11,327 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:11,342 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:12,599 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:12,622 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:12,625 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:12,625 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:12,625 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:12,626 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:12,626 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_sum_~ret~0_BEFORE_RETURN_84 Int) (v_sum_~ret~0_BEFORE_RETURN_83 Int)) (or (and (not (<= (mod v_prenex_611 4294967296) 2147483647)) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_611 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296)) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (<= (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_612 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (= (mod v_prenex_612 4294967296) main_~ret5~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647))))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_sum_~ret~0_BEFORE_RETURN_84 Int) (v_sum_~ret~0_BEFORE_RETURN_83 Int)) (or (and (not (<= (mod v_prenex_611 4294967296) 2147483647)) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_611 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296)) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (<= (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_612 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (= (mod v_prenex_612 4294967296) main_~ret5~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647))))))) [2019-10-13 23:21:12,626 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:12,626 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 9)) (<= 9 main_~i~2) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) [2019-10-13 23:21:12,627 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:12,627 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:12,627 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_prenex_584 Int) (v_sum_~ret~0_BEFORE_RETURN_80 Int)) (or (and (= |main_#t~ret4| (+ (mod v_prenex_584 4294967296) (- 4294967296))) (not (<= (mod v_prenex_584 4294967296) 2147483647)) (not (< main_~i~1 10))) (and (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647) (not (< main_~i~1 10))))) (exists ((v_prenex_583 Int) (v_sum_~ret~0_BEFORE_RETURN_79 Int)) (or (and (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647)) (not (< main_~i~1 10)) (= (+ (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) (- 4294967296)) |main_#t~ret4|)) (and (= (mod v_prenex_583 4294967296) |main_#t~ret4|) (<= (mod v_prenex_583 4294967296) 2147483647) (not (< main_~i~1 10)))))) [2019-10-13 23:21:12,627 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:12,627 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:12,627 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:12,628 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:12,628 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:12,628 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:12,628 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:12,628 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-13 23:21:12,629 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_prenex_583 Int) (v_prenex_584 Int) (v_sum_~ret~0_BEFORE_RETURN_79 Int) (v_sum_~ret~0_BEFORE_RETURN_80 Int)) (or (and (<= main_~ret~1 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_584 4294967296) 2147483647)) (not (< main_~i~1 10)) (= main_~ret~1 (+ (mod v_prenex_584 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (<= (mod v_prenex_583 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (< main_~i~1 10)) (= main_~ret~1 (mod v_prenex_583 4294967296)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= 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) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647)) (= 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))) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:12,629 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:12,629 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (not (< sum_~i~0 10)) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 10 sum_~i~0)) [2019-10-13 23:21:13,008 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:13,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 23 [2019-10-13 23:21:13,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970274999] [2019-10-13 23:21:13,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 23:21:13,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:13,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 23:21:13,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-10-13 23:21:13,012 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 24 states. [2019-10-13 23:21:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:13,841 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2019-10-13 23:21:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:21:13,841 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2019-10-13 23:21:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:13,842 INFO L225 Difference]: With dead ends: 64 [2019-10-13 23:21:13,842 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 23:21:13,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2019-10-13 23:21:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 23:21:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-13 23:21:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 23:21:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-13 23:21:13,852 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 61 [2019-10-13 23:21:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:13,852 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-13 23:21:13,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 23:21:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-13 23:21:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 23:21:13,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:13,855 INFO L380 BasicCegarLoop]: trace histogram [30, 10, 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:14,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:14,059 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:14,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1863540466, now seen corresponding path program 5 times [2019-10-13 23:21:14,060 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:14,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845686177] [2019-10-13 23:21:14,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:14,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:14,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-13 23:21:14,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845686177] [2019-10-13 23:21:14,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897040824] [2019-10-13 23:21:14,130 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:14,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 23:21:14,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:14,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:21:14,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 246 proven. 1 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-13 23:21:14,340 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-13 23:21:14,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1772387946] [2019-10-13 23:21:14,366 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:14,366 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:14,366 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:14,366 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:14,367 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:14,386 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:15,621 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:15,641 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:15,643 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:15,643 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:15,644 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:15,644 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,644 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 (= main_~ret5~0 (mod v_prenex_806 4294967296)) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_806 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= 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))) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_109 4294967296) 2147483647) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_109 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (= (+ (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)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0))))) (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 (= main_~ret5~0 (mod v_prenex_806 4294967296)) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_806 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= 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))) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_109 4294967296) 2147483647) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_109 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (= (+ (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)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:21:15,644 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:15,645 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 9)) (<= 9 main_~i~2) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) [2019-10-13 23:21:15,645 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,645 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:15,645 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)) (= (+ (mod v_prenex_778 4294967296) (- 4294967296)) |main_#t~ret4|) (not (< main_~i~1 10))) (and (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_106 4294967296)) (not (< main_~i~1 10)) (<= (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 10)) (= (mod v_prenex_777 4294967296) |main_#t~ret4|)) (and (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_105 4294967296) 2147483647)) (= |main_#t~ret4| (+ (mod v_sum_~ret~0_BEFORE_RETURN_105 4294967296) (- 4294967296))) (not (< main_~i~1 10)))))) [2019-10-13 23:21:15,645 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:15,645 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,646 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:15,646 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:15,646 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:15,646 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:15,646 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:15,646 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-13 23:21:15,647 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 (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_106 4294967296)) (<= main_~ret~1 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (< main_~i~1 10)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_106 4294967296) 2147483647) (<= 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) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (= main_~ret~1 (+ (mod v_sum_~ret~0_BEFORE_RETURN_105 4294967296) (- 4294967296))) (<= main_~ret~1 2147483647) (= 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)) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= (mod v_prenex_777 4294967296) 2147483647) (= main_~ret~1 (mod v_prenex_777 4294967296)) (<= main_~ret~1 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:15,647 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:15,647 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (not (< sum_~i~0 10)) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 10 sum_~i~0)) [2019-10-13 23:21:15,923 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:15,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 23:21:15,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197793071] [2019-10-13 23:21:15,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 23:21:15,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:15,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 23:21:15,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:21:15,926 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 18 states. [2019-10-13 23:21:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:17,369 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2019-10-13 23:21:17,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:21:17,369 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-10-13 23:21:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:17,371 INFO L225 Difference]: With dead ends: 61 [2019-10-13 23:21:17,371 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 23:21:17,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2019-10-13 23:21:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 23:21:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-13 23:21:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 23:21:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-13 23:21:17,380 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 65 [2019-10-13 23:21:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:17,380 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-13 23:21:17,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 23:21:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-13 23:21:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 23:21:17,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:17,382 INFO L380 BasicCegarLoop]: trace histogram [30, 10, 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:17,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:17,591 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:17,591 INFO L82 PathProgramCache]: Analyzing trace with hash -626033123, now seen corresponding path program 6 times [2019-10-13 23:21:17,592 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:17,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632488097] [2019-10-13 23:21:17,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:17,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:17,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-13 23:21:17,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632488097] [2019-10-13 23:21:17,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536491333] [2019-10-13 23:21:17,673 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:17,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 23:21:17,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:17,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 23:21:17,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 246 proven. 10 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-13 23:21:17,920 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-13 23:21:17,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1653332123] [2019-10-13 23:21:17,974 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:17,974 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:17,975 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:17,975 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:17,975 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:17,993 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:19,182 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:19,212 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:19,214 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:19,214 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:19,215 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:19,215 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:19,215 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (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 (= main_~ret5~0 (+ (mod v_prenex_1000 4294967296) (- 4294967296))) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_prenex_1000 4294967296) 2147483647))) (and (= (mod v_prenex_999 4294967296) main_~ret5~0) (not (< main_~i~2 9)) (<= (mod v_prenex_999 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_136 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_136 4294967296) 2147483647) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) (- 4294967296)))))) (not (= main_~ret~1 main_~ret5~0))) (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 (= main_~ret5~0 (+ (mod v_prenex_1000 4294967296) (- 4294967296))) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_prenex_1000 4294967296) 2147483647))) (and (= (mod v_prenex_999 4294967296) main_~ret5~0) (not (< main_~i~2 9)) (<= (mod v_prenex_999 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_136 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_136 4294967296) 2147483647) (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) (and (not (< main_~i~2 9)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) (- 4294967296)))))))) [2019-10-13 23:21:19,215 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:19,215 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (not (< main_~i~2 9)) (<= 9 main_~i~2) (= (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 36)) main_~temp~0)) [2019-10-13 23:21:19,216 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:19,216 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:19,216 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_prenex_972 Int) (v_sum_~ret~0_BEFORE_RETURN_132 Int)) (or (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 10))) (and (not (<= (mod v_prenex_972 4294967296) 2147483647)) (= (+ (mod v_prenex_972 4294967296) (- 4294967296)) |main_#t~ret4|) (not (< main_~i~1 10))))) (exists ((v_prenex_971 Int) (v_sum_~ret~0_BEFORE_RETURN_131 Int)) (or (and (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_131 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_131 4294967296) 2147483647) (not (< main_~i~1 10))) (and (= |main_#t~ret4| (+ (mod v_prenex_971 4294967296) (- 4294967296))) (not (<= (mod v_prenex_971 4294967296) 2147483647)) (not (< main_~i~1 10)))))) [2019-10-13 23:21:19,216 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:19,216 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:19,216 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:19,217 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:19,217 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:19,217 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:19,217 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:19,217 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-13 23:21:19,217 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) (= 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)) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_132 4294967296) 2147483647) (= 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)) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_971 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (= 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))) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_972 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (= 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))) (not (< main_~i~1 10)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:19,218 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:19,218 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (not (< sum_~i~0 10)) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 10 sum_~i~0)) [2019-10-13 23:21:19,525 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:19,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 22 [2019-10-13 23:21:19,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749286110] [2019-10-13 23:21:19,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 23:21:19,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 23:21:19,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-13 23:21:19,529 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 23 states. [2019-10-13 23:21:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:20,510 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2019-10-13 23:21:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:21:20,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-10-13 23:21:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:20,512 INFO L225 Difference]: With dead ends: 66 [2019-10-13 23:21:20,512 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 23:21:20,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 23:21:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 23:21:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-13 23:21:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 23:21:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-13 23:21:20,520 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 68 [2019-10-13 23:21:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:20,521 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-13 23:21:20,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 23:21:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-13 23:21:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 23:21:20,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:20,522 INFO L380 BasicCegarLoop]: trace histogram [30, 10, 9, 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:20,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:20,727 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:20,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2107357042, now seen corresponding path program 7 times [2019-10-13 23:21:20,728 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:20,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939650051] [2019-10-13 23:21:20,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:20,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:20,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat