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-36ac518-m [2019-10-07 15:37:44,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:37:44,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:37:44,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:37:44,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:37:44,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:37:44,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:37:44,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:37:44,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:37:44,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:37:44,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:37:44,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:37:44,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:37:44,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:37:44,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:37:44,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:37:44,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:37:44,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:37:44,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:37:44,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:37:44,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:37:44,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:37:44,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:37:44,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:37:44,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:37:44,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:37:44,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:37:44,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:37:44,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:37:44,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:37:44,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:37:44,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:37:44,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:37:44,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:37:44,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:37:44,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:37:44,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:37:44,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:37:44,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:37:44,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:37:44,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:37:44,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 15:37:44,379 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:37:44,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:37:44,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:37:44,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:37:44,382 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:37:44,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:37:44,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:37:44,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:37:44,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:37:44,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:37:44,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:37:44,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:37:44,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:37:44,385 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:37:44,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:37:44,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:37:44,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:37:44,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:37:44,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:37:44,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:37:44,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:37:44,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:37:44,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:37:44,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:37:44,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:37:44,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:37:44,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:37:44,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:37:44,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 15:37:44,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:37:44,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:37:44,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:37:44,674 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:37:44,675 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:37:44,675 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-07 15:37:44,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d21c711/d8f7a0678918463fb7fd75e29e8b6c5d/FLAG108969517 [2019-10-07 15:37:45,230 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:37:45,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum10-1.i [2019-10-07 15:37:45,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d21c711/d8f7a0678918463fb7fd75e29e8b6c5d/FLAG108969517 [2019-10-07 15:37:45,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d21c711/d8f7a0678918463fb7fd75e29e8b6c5d [2019-10-07 15:37:45,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:37:45,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:37:45,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:37:45,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:37:45,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:37:45,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:37:45" (1/1) ... [2019-10-07 15:37:45,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba71078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:45, skipping insertion in model container [2019-10-07 15:37:45,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:37:45" (1/1) ... [2019-10-07 15:37:45,643 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:37:45,661 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:37:45,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:37:45,881 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:37:45,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:37:46,006 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:37:46,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46 WrapperNode [2019-10-07 15:37:46,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:37:46,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:37:46,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:37:46,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:37:46,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46" (1/1) ... [2019-10-07 15:37:46,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46" (1/1) ... [2019-10-07 15:37:46,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46" (1/1) ... [2019-10-07 15:37:46,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46" (1/1) ... [2019-10-07 15:37:46,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46" (1/1) ... [2019-10-07 15:37:46,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46" (1/1) ... [2019-10-07 15:37:46,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46" (1/1) ... [2019-10-07 15:37:46,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:37:46,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:37:46,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:37:46,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:37:46,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:37:46,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:37:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:37:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-10-07 15:37:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:37:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:37:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 15:37:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-10-07 15:37:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 15:37:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:37:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 15:37:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 15:37:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 15:37:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:37:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:37:46,479 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:37:46,479 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 15:37:46,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:37:46 BoogieIcfgContainer [2019-10-07 15:37:46,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:37:46,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:37:46,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:37:46,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:37:46,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:37:45" (1/3) ... [2019-10-07 15:37:46,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435babd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:37:46, skipping insertion in model container [2019-10-07 15:37:46,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:37:46" (2/3) ... [2019-10-07 15:37:46,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435babd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:37:46, skipping insertion in model container [2019-10-07 15:37:46,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:37:46" (3/3) ... [2019-10-07 15:37:46,488 INFO L109 eAbstractionObserver]: Analyzing ICFG sum10-1.i [2019-10-07 15:37:46,497 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:37:46,504 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:37:46,514 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:37:46,544 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:37:46,544 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:37:46,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:37:46,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:37:46,545 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:37:46,545 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:37:46,545 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:37:46,545 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:37:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-07 15:37:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 15:37:46,586 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:46,588 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:37:46,590 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:46,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1818423299, now seen corresponding path program 1 times [2019-10-07 15:37:46,605 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:46,605 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:46,605 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:46,606 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:46,824 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-07 15:37:46,825 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:46,826 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:37:46,826 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:37:46,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:37:46,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:37:46,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:37:46,843 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-07 15:37:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:37:46,879 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-07 15:37:46,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:37:46,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-07 15:37:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:37:46,895 INFO L225 Difference]: With dead ends: 41 [2019-10-07 15:37:46,896 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 15:37:46,903 INFO L606 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-07 15:37:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 15:37:46,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 15:37:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 15:37:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-07 15:37:46,944 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-07 15:37:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:37:46,944 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-07 15:37:46,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:37:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-07 15:37:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 15:37:46,947 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:46,948 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:37:46,948 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2093950433, now seen corresponding path program 1 times [2019-10-07 15:37:46,949 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:46,949 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:46,949 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:46,950 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:47,017 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-07 15:37:47,017 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:47,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:37:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:47,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 15:37:47,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:37:47,137 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-07 15:37:47,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:37:47,202 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-07 15:37:47,203 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 15:37:47,203 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-07 15:37:47,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:37:47,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:37:47,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:37:47,205 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-07 15:37:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:37:47,217 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-07 15:37:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:37:47,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-07 15:37:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:37:47,219 INFO L225 Difference]: With dead ends: 33 [2019-10-07 15:37:47,219 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 15:37:47,221 INFO L606 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-07 15:37:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 15:37:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 15:37:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 15:37:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-07 15:37:47,227 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-07 15:37:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:37:47,227 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-07 15:37:47,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:37:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-07 15:37:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 15:37:47,228 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:47,229 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:37:47,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:47,438 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash 903502258, now seen corresponding path program 1 times [2019-10-07 15:37:47,439 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:47,439 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:47,439 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:47,439 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:47,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:47,550 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-07 15:37:47,551 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:47,551 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:37:47,552 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:37:47,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:37:47,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:37:47,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:37:47,553 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-07 15:37:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:37:47,570 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-07 15:37:47,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:37:47,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-07 15:37:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:37:47,572 INFO L225 Difference]: With dead ends: 31 [2019-10-07 15:37:47,573 INFO L226 Difference]: Without dead ends: 22 [2019-10-07 15:37:47,573 INFO L606 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-07 15:37:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-07 15:37:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-07 15:37:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-07 15:37:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-07 15:37:47,580 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-07 15:37:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:37:47,582 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-07 15:37:47,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:37:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-07 15:37:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 15:37:47,583 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:47,584 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:37:47,584 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2130547361, now seen corresponding path program 1 times [2019-10-07 15:37:47,585 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:47,585 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:47,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:47,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:47,688 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-07 15:37:47,688 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:47,688 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:37:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:47,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:37:47,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:37:47,814 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-07 15:37:47,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:37:47,872 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-07 15:37:47,872 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:37:47,901 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:37:47,901 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:37:47,908 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:37:47,914 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:37:47,914 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:37:48,047 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:37:50,075 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-07 15:37:50,164 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:37:50,169 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:37:50,169 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:37:50,169 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-07 15:37:50,170 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-07 15:37:50,170 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-07 15:37:50,170 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-07 15:37:50,171 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-07 15:37:50,171 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-07 15:37:50,171 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-07 15:37:50,171 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-07 15:37:50,171 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-07 15:37:50,172 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-07 15:37:50,172 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-07 15:37:50,172 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:37:50,172 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-07 15:37:50,172 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-07 15:37:50,173 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-07 15:37:50,173 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-07 15:37:50,174 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-07 15:37:50,175 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:37:50,175 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-07 15:37:50,604 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:37:50,604 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 15:37:50,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 15:37:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 15:37:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-07 15:37:50,607 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-07 15:37:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:37:51,350 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-07 15:37:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 15:37:51,350 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-07 15:37:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:37:51,351 INFO L225 Difference]: With dead ends: 40 [2019-10-07 15:37:51,352 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 15:37:51,353 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-07 15:37:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 15:37:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-07 15:37:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 15:37:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-07 15:37:51,359 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-07 15:37:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:37:51,360 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-07 15:37:51,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 15:37:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-07 15:37:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 15:37:51,361 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:51,361 INFO L385 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-07 15:37:51,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:51,566 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:51,566 INFO L82 PathProgramCache]: Analyzing trace with hash 356639231, now seen corresponding path program 2 times [2019-10-07 15:37:51,567 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:51,567 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:51,567 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:51,567 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:51,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:51,702 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-07 15:37:51,702 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:51,703 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:37:51,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:51,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 15:37:51,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 15:37:51,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:37:51,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:37:51,832 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-07 15:37:51,833 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:37:51,866 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-07 15:37:51,867 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:37:51,870 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:37:51,870 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:37:51,871 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:37:51,871 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:37:51,871 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:37:51,908 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:37:53,505 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-07 15:37:53,544 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:37:53,549 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:37:53,549 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:37:53,550 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-07 15:37:53,550 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-07 15:37:53,550 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-07 15:37:53,556 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-07 15:37:53,556 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-07 15:37:53,556 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-07 15:37:53,556 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-07 15:37:53,557 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 (<= (mod v_prenex_196 4294967296) 2147483647) (= (mod v_prenex_196 4294967296) |main_#t~ret4|) (not (< main_~i~1 10))) (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)))))) [2019-10-07 15:37:53,557 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-07 15:37:53,557 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-07 15:37:53,558 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-07 15:37:53,558 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:37:53,558 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-07 15:37:53,559 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-07 15:37:53,559 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-07 15:37:53,559 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-07 15:37:53,559 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-07 15:37:53,559 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:37:53,559 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-07 15:37:53,933 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:37:53,934 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-07 15:37:53,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 15:37:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 15:37:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-07 15:37:53,947 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-07 15:37:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:37:54,858 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-07 15:37:54,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 15:37:54,858 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-07 15:37:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:37:54,859 INFO L225 Difference]: With dead ends: 44 [2019-10-07 15:37:54,859 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 15:37:54,861 INFO L606 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-07 15:37:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 15:37:54,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-07 15:37:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 15:37:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-07 15:37:54,869 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-07 15:37:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:37:54,869 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-07 15:37:54,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 15:37:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-07 15:37:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 15:37:54,871 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:37:54,871 INFO L385 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-07 15:37:55,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:37:55,075 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:37:55,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:37:55,076 INFO L82 PathProgramCache]: Analyzing trace with hash 906031436, now seen corresponding path program 3 times [2019-10-07 15:37:55,076 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:37:55,076 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:55,076 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:55,077 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:37:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:37:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:37:55,209 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-07 15:37:55,209 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:37:55,209 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:37:55,209 INFO L93 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-07 15:37:55,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 15:37:55,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 15:37:55,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 15:37:55,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:37:55,382 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-07 15:37:55,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:37:55,481 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-07 15:37:55,482 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:37:55,483 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:37:55,484 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:37:55,484 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:37:55,485 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:37:55,485 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:37:55,516 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:37:57,191 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-07 15:37:57,220 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:37:57,223 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:37:57,224 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:37:57,224 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-07 15:37:57,224 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-07 15:37:57,224 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-07 15:37:57,225 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-07 15:37:57,225 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-07 15:37:57,225 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-07 15:37:57,225 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-07 15:37:57,225 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-07 15:37:57,225 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-07 15:37:57,226 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-07 15:37:57,226 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-07 15:37:57,226 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:37:57,226 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-07 15:37:57,226 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-07 15:37:57,226 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-07 15:37:57,227 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-07 15:37:57,227 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-07 15:37:57,227 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:37:57,227 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-07 15:37:57,708 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:37:57,708 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 11] total 28 [2019-10-07 15:37:57,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 15:37:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 15:37:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2019-10-07 15:37:57,710 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 29 states. [2019-10-07 15:38:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:38:01,044 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-07 15:38:01,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-07 15:38:01,044 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2019-10-07 15:38:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:38:01,045 INFO L225 Difference]: With dead ends: 54 [2019-10-07 15:38:01,046 INFO L226 Difference]: Without dead ends: 36 [2019-10-07 15:38:01,048 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=420, Invalid=2336, Unknown=0, NotChecked=0, Total=2756 [2019-10-07 15:38:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-07 15:38:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-07 15:38:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-07 15:38:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-07 15:38:01,056 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-07 15:38:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:38:01,056 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-07 15:38:01,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 15:38:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-07 15:38:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-07 15:38:01,058 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:38:01,058 INFO L385 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-07 15:38:01,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:38:01,271 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:38:01,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:38:01,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1834628722, now seen corresponding path program 4 times [2019-10-07 15:38:01,272 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:38:01,272 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:38:01,273 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:38:01,273 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:38:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:38:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:38:01,405 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-07 15:38:01,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:38:01,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:38:01,406 INFO L93 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-07 15:38:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:38:01,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 15:38:01,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:38:01,566 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-07 15:38:01,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:38:01,639 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-07 15:38:01,640 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:38:01,641 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:38:01,641 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:38:01,642 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:38:01,642 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:38:01,642 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:38:01,658 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:38:02,948 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-07 15:38:02,972 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:38:02,977 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:38:02,977 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:38:02,977 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-07 15:38:02,978 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-07 15:38:02,978 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-07 15:38:02,978 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-07 15:38:02,978 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-07 15:38:02,979 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-07 15:38:02,979 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-07 15:38:02,979 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-07 15:38:02,979 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-07 15:38:02,979 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-07 15:38:02,980 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-07 15:38:02,980 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:38:02,980 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-07 15:38:02,980 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-07 15:38:02,980 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-07 15:38:02,980 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-07 15:38:02,981 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-07 15:38:02,981 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:38:02,981 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-07 15:38:03,335 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:38:03,335 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 23 [2019-10-07 15:38:03,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 15:38:03,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 15:38:03,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-10-07 15:38:03,337 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 24 states. [2019-10-07 15:38:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:38:04,228 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2019-10-07 15:38:04,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 15:38:04,228 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2019-10-07 15:38:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:38:04,229 INFO L225 Difference]: With dead ends: 64 [2019-10-07 15:38:04,229 INFO L226 Difference]: Without dead ends: 40 [2019-10-07 15:38:04,231 INFO L606 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-07 15:38:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-07 15:38:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-07 15:38:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-07 15:38:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-07 15:38:04,239 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 61 [2019-10-07 15:38:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:38:04,239 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-07 15:38:04,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 15:38:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-07 15:38:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-07 15:38:04,241 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:38:04,241 INFO L385 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-07 15:38:04,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:38:04,445 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:38:04,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:38:04,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1863540466, now seen corresponding path program 5 times [2019-10-07 15:38:04,446 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:38:04,446 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:38:04,446 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:38:04,446 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:38:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:38:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:38:04,547 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-07 15:38:04,547 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:38:04,547 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:38:04,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 15:38:04,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 15:38:04,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 15:38:04,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:38:04,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:38:04,759 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-07 15:38:04,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:38:04,791 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-07 15:38:04,792 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:38:04,794 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:38:04,794 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:38:04,794 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:38:04,795 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:38:04,795 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:38:04,813 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:38:06,086 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-07 15:38:06,108 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:38:06,110 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:38:06,110 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:38:06,111 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-07 15:38:06,111 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-07 15:38:06,111 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-07 15:38:06,111 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-07 15:38:06,112 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-07 15:38:06,112 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-07 15:38:06,112 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-07 15:38:06,112 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-07 15:38:06,112 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-07 15:38:06,113 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-07 15:38:06,113 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-07 15:38:06,113 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:38:06,113 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-07 15:38:06,113 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-07 15:38:06,113 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-07 15:38:06,113 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-07 15:38:06,114 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-07 15:38:06,114 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:38:06,115 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-07 15:38:06,386 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:38:06,387 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 15:38:06,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 15:38:06,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 15:38:06,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-07 15:38:06,389 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 18 states. [2019-10-07 15:38:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:38:07,078 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2019-10-07 15:38:07,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 15:38:07,079 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-10-07 15:38:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:38:07,080 INFO L225 Difference]: With dead ends: 61 [2019-10-07 15:38:07,081 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 15:38:07,082 INFO L606 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-07 15:38:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 15:38:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-07 15:38:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 15:38:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-07 15:38:07,089 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 65 [2019-10-07 15:38:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:38:07,090 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-07 15:38:07,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 15:38:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-07 15:38:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 15:38:07,091 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:38:07,091 INFO L385 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-07 15:38:07,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:38:07,305 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:38:07,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:38:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash -626033123, now seen corresponding path program 6 times [2019-10-07 15:38:07,305 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:38:07,305 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:38:07,305 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:38:07,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:38:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:38:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:38:07,387 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-07 15:38:07,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:38:07,388 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:38:07,388 INFO L93 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-07 15:38:07,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 15:38:07,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 15:38:07,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 15:38:07,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:38:07,625 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-07 15:38:07,626 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:38:07,675 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-07 15:38:07,676 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:38:07,677 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 15:38:07,677 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:38:07,678 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:38:07,678 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:38:07,678 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:38:07,698 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 15:38:08,993 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-07 15:38:09,015 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 15:38:09,018 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 15:38:09,019 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 15:38:09,019 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-07 15:38:09,019 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_sum_~ret~0_BEFORE_RETURN_136 Int) (v_prenex_1000 Int) (v_sum_~ret~0_BEFORE_RETURN_135 Int) (v_prenex_999 Int)) (or (and (= 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) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) (- 4294967296))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) 2147483647)))))) (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) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) (- 4294967296))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_135 4294967296) 2147483647))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-07 15:38:09,019 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-07 15:38:09,020 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-07 15:38:09,020 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-07 15:38:09,020 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-07 15:38:09,020 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-07 15:38:09,020 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-07 15:38:09,020 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-07 15:38:09,021 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-07 15:38:09,021 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-07 15:38:09,021 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 15:38:09,021 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-07 15:38:09,021 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-07 15:38:09,021 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-07 15:38:09,022 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (<= 10 main_~i~1) (not (< main_~i~1 10))) [2019-10-07 15:38:09,022 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-07 15:38:09,022 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-07 15:38:09,022 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-07 15:38:09,336 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 15:38:09,336 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 22 [2019-10-07 15:38:09,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 15:38:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 15:38:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-07 15:38:09,338 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 23 states. [2019-10-07 15:38:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:38:10,269 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2019-10-07 15:38:10,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 15:38:10,270 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-10-07 15:38:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:38:10,271 INFO L225 Difference]: With dead ends: 66 [2019-10-07 15:38:10,271 INFO L226 Difference]: Without dead ends: 48 [2019-10-07 15:38:10,272 INFO L606 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-07 15:38:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-07 15:38:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-07 15:38:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-07 15:38:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-07 15:38:10,282 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 68 [2019-10-07 15:38:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:38:10,282 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-07 15:38:10,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 15:38:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-07 15:38:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-07 15:38:10,283 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:38:10,284 INFO L385 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-07 15:38:10,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:38:10,489 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:38:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:38:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2107357042, now seen corresponding path program 7 times [2019-10-07 15:38:10,490 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:38:10,490 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:38:10,490 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:38:10,490 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:38:10,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:38:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:38:21,551 WARN L191 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-07 15:38:26,278 WARN L191 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 112 DAG size of output: 43 [2019-10-07 15:38:26,790 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 44 [2019-10-07 15:38:32,939 WARN L191 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 110 DAG size of output: 44 [2019-10-07 15:38:54,004 WARN L191 SmtUtils]: Spent 20.77 s on a formula simplification. DAG size of input: 144 DAG size of output: 50 [2019-10-07 15:38:58,903 WARN L191 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 165 DAG size of output: 57 [2019-10-07 15:39:16,105 WARN L191 SmtUtils]: Spent 16.96 s on a formula simplification. DAG size of input: 153 DAG size of output: 53 [2019-10-07 15:39:29,540 WARN L191 SmtUtils]: Spent 6.47 s on a formula simplification. DAG size of input: 145 DAG size of output: 69 [2019-10-07 15:39:31,554 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse34 (= |c_main_~#x~0.offset| 0))) (and (let ((.cse0 (<= 12 |c_main_~#x~0.offset|)) (.cse1 (<= 16 |c_main_~#x~0.offset|)) (.cse4 (<= 1 |c_main_~#x~0.offset|)) (.cse5 (<= 28 |c_main_~#x~0.offset|)) (.cse6 (<= (+ |c_main_~#x~0.offset| 1) 0)) (.cse33 (<= 32 |c_main_~#x~0.offset|))) (or .cse0 .cse1 (let ((.cse2 (<= 4 c_main_~i~2))) (and (let ((.cse7 (<= 24 |c_main_~#x~0.offset|)) (.cse3 (* 4 c_main_~i~2))) (or (and .cse2 (= 0 .cse3) (= c_main_~i~2 0)) .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (+ .cse3 |c_main_~#x~0.offset| 8))) (and (not (= .cse8 0)) .cse2 (not (= (+ |c_main_~#x~0.offset| 36) 0)) (let ((.cse11 (<= 20 |c_main_~#x~0.offset|)) (.cse9 (<= 8 |c_main_~#x~0.offset|)) (.cse10 (not .cse34))) (or (<= 4 |c_main_~#x~0.offset|) .cse0 .cse1 .cse4 .cse5 .cse9 .cse10 .cse6 .cse11 (let ((.cse12 (<= c_main_~i~2 4))) (and .cse2 (= .cse3 16) .cse12 (or .cse0 (and (or (= 9 c_main_~i~2) (not (= 36 .cse3))) .cse2 .cse12 (or .cse4 .cse6 (and (or (<= 36 |c_main_~#x~0.offset|) .cse5 (let ((.cse13 (= (+ |c_main_~#x~0.offset| 16) .cse3)) (.cse31 (+ |c_main_~#x~0.offset| 8))) (and .cse13 (= 16 .cse3) (or .cse9 (and (let ((.cse32 (select |c_#memory_int| |c_main_~#x~0.base|))) (let ((.cse23 (select .cse32 (+ .cse3 |c_main_~#x~0.offset| 4)))) (let ((.cse30 (- (* (- 4) c_main_~i~2))) (.cse29 (store .cse32 (+ .cse3 |c_main_~#x~0.offset|) .cse23))) (let ((.cse19 (select .cse29 0)) (.cse20 (select .cse29 .cse31)) (.cse21 (select .cse29 (+ |c_main_~#x~0.offset| 12))) (.cse22 (select .cse29 (+ .cse30 16))) (.cse24 (select .cse29 (+ |c_main_~#x~0.offset| 4))) (.cse25 (select .cse29 (+ .cse3 |c_main_~#x~0.offset| 12))) (.cse26 (select .cse29 .cse8)) (.cse27 (select .cse29 (+ .cse30 20)))) (let ((.cse15 (+ .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 c_main_~temp~0 .cse25 .cse26 .cse27))) (let ((.cse16 (= c_main_~ret~1 c_main_~ret2~0)) (.cse14 (* 4294967296 (div .cse15 4294967296)))) (let ((.cse18 (let ((.cse28 (* 4294967296 (div (+ .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 c_main_~temp~0 .cse25 .cse26 .cse27 2147483648) 4294967296)))) (and (<= .cse28 .cse14) (or (< .cse28 .cse14) (and (= (+ .cse28 c_main_~ret~1) .cse15) .cse16)) (<= .cse15 (+ .cse14 2147483647)))))) (or (let ((.cse17 (<= .cse15 (+ (* 4294967296 (div (+ .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 c_main_~temp~0 .cse25 .cse26 .cse27 (- 2147483648)) 4294967296)) 4294967295)))) (and (or (and (= (+ .cse14 c_main_~ret~1 4294967296) .cse15) (or .cse16 (<= (* 4294967296 (div (+ .cse14 4294967296) 4294967296)) .cse15)) .cse17) .cse18) .cse17)) .cse0 .cse1 .cse4 .cse18 .cse9 .cse6 .cse11 .cse7)))))))) .cse13 .cse2)) (not (= .cse31 0)))) .cse11 .cse33 .cse7) .cse2))) .cse4 .cse9 .cse10 .cse6))) .cse33 .cse7)) .cse34)))) .cse2 .cse34)) .cse4 .cse5 .cse6 .cse33)) .cse34)) is different from false [2019-10-07 15:39:48,560 WARN L191 SmtUtils]: Spent 16.75 s on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-10-07 15:40:13,394 WARN L191 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 124 DAG size of output: 53 [2019-10-07 15:40:15,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_main_~#x~0.offset| 0))) (and (let ((.cse3 (<= 28 |c_main_~#x~0.offset|)) (.cse1 (<= 16 |c_main_~#x~0.offset|)) (.cse0 (<= 12 |c_main_~#x~0.offset|)) (.cse2 (<= 1 |c_main_~#x~0.offset|)) (.cse7 (<= (+ |c_main_~#x~0.offset| 1) 0)) (.cse11 (<= 32 |c_main_~#x~0.offset|))) (or .cse0 .cse1 .cse2 .cse3 (let ((.cse6 (<= 7 c_main_~i~2))) (and .cse4 (let ((.cse8 (<= 24 |c_main_~#x~0.offset|)) (.cse5 (* 4 c_main_~i~2))) (or .cse2 .cse3 (and (= 0 .cse5) .cse6 (= c_main_~i~2 0)) .cse7 .cse8 (and (not (= (+ |c_main_~#x~0.offset| 36) 0)) .cse4 (let ((.cse10 (<= 20 |c_main_~#x~0.offset|)) (.cse9 (<= 8 |c_main_~#x~0.offset|))) (or (<= 4 |c_main_~#x~0.offset|) .cse0 .cse1 .cse2 .cse3 .cse9 (not .cse4) .cse7 .cse10 .cse11 .cse8 (let ((.cse12 (= 36 .cse5))) (and (or (= 28 .cse5) .cse12) (or (and (or .cse2 (and (or .cse0 .cse1 (<= 36 |c_main_~#x~0.offset|) .cse3 .cse9 (and (= (+ |c_main_~#x~0.offset| 28) .cse5) (or .cse9 (and (let ((.cse29 (select |c_#memory_int| |c_main_~#x~0.base|))) (let ((.cse25 (select .cse29 (+ .cse5 |c_main_~#x~0.offset| 4)))) (let ((.cse28 (store .cse29 (+ .cse5 |c_main_~#x~0.offset|) .cse25))) (let ((.cse18 (select .cse28 0)) (.cse19 (select .cse28 (+ |c_main_~#x~0.offset| 8))) (.cse20 (select .cse28 (+ |c_main_~#x~0.offset| 16))) (.cse21 (select .cse28 (+ |c_main_~#x~0.offset| 20))) (.cse22 (select .cse28 (+ |c_main_~#x~0.offset| 24))) (.cse23 (select .cse28 (+ (- (* (- 4) c_main_~i~2)) 8))) (.cse24 (select .cse28 (+ |c_main_~#x~0.offset| 12))) (.cse26 (select .cse28 (+ |c_main_~#x~0.offset| 4)))) (let ((.cse15 (+ .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 c_main_~temp~0))) (let ((.cse16 (= c_main_~ret~1 c_main_~ret2~0)) (.cse14 (* 4294967296 (div .cse15 4294967296)))) (let ((.cse13 (let ((.cse27 (* 4294967296 (div (+ .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 c_main_~temp~0 2147483648) 4294967296)))) (and (<= .cse27 .cse14) (or (< .cse27 .cse14) (and .cse16 (= (+ .cse27 c_main_~ret~1) .cse15))) (<= .cse15 (+ .cse14 2147483647)))))) (or .cse13 .cse0 .cse1 .cse2 (let ((.cse17 (<= .cse15 (+ (* 4294967296 (div (+ .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 c_main_~temp~0 (- 2147483648)) 4294967296)) 4294967295)))) (and (or .cse13 (and (or (<= (* 4294967296 (div (+ .cse14 4294967296) 4294967296)) .cse15) .cse16) .cse17 (= .cse15 (+ .cse14 c_main_~ret~1 4294967296)))) .cse17)) .cse9 .cse7 .cse10 .cse8)))))))) .cse6)) .cse6) .cse10 .cse11 .cse8) .cse6) .cse7) .cse6) .cse0 .cse2 .cse9 .cse7) (or (= 9 c_main_~i~2) (not .cse12)) (<= c_main_~i~2 7) .cse6))))))) .cse6)) .cse7 .cse11)) .cse4)) is different from false [2019-10-07 15:40:28,322 WARN L191 SmtUtils]: Spent 12.53 s on a formula simplification. DAG size of input: 121 DAG size of output: 52 [2019-10-07 15:40:30,830 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-10-07 15:40:31,582 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2019-10-07 15:40:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 2 proven. 576 refuted. 2 times theorem prover too weak. 37 trivial. 17 not checked. [2019-10-07 15:40:32,431 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:40:32,431 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:40:32,431 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:40:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:40:33,101 WARN L254 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-07 15:40:33,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:40:40,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:40:40,632 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 15:40:40,637 INFO L168 Benchmark]: Toolchain (without parser) took 175010.86 ms. Allocated memory was 137.9 MB in the beginning and 535.3 MB in the end (delta: 397.4 MB). Free memory was 101.3 MB in the beginning and 404.2 MB in the end (delta: -303.0 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. [2019-10-07 15:40:40,638 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 15:40:40,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.05 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 181.7 MB in the end (delta: -80.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-07 15:40:40,638 INFO L168 Benchmark]: Boogie Preprocessor took 40.03 ms. Allocated memory is still 202.4 MB. Free memory was 181.7 MB in the beginning and 179.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-07 15:40:40,638 INFO L168 Benchmark]: RCFGBuilder took 433.29 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 159.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-10-07 15:40:40,639 INFO L168 Benchmark]: TraceAbstraction took 174153.90 ms. Allocated memory was 202.4 MB in the beginning and 535.3 MB in the end (delta: 332.9 MB). Free memory was 158.7 MB in the beginning and 404.2 MB in the end (delta: -245.6 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2019-10-07 15:40:40,640 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 379.05 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 181.7 MB in the end (delta: -80.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.03 ms. Allocated memory is still 202.4 MB. Free memory was 181.7 MB in the beginning and 179.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 433.29 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 159.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 174153.90 ms. Allocated memory was 202.4 MB in the beginning and 535.3 MB in the end (delta: 332.9 MB). Free memory was 158.7 MB in the beginning and 404.2 MB in the end (delta: -245.6 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.NullPointerException de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.NullPointerException: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...