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/array-examples/standard_copy3_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:26,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:26,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:26,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:26,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:26,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:26,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:26,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:26,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:26,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:26,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:26,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:26,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:26,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:26,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:26,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:26,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:26,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:26,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:26,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:26,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:26,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:26,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:26,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:26,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:26,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:26,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:26,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:26,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:26,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:26,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:26,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:26,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:26,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:26,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:26,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:26,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:26,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:26,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:26,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:26,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:26,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:33:26,609 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:26,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:26,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:26,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:26,614 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:26,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:26,615 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:26,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:26,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:26,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:26,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:26,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:26,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:26,618 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:26,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:26,619 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:26,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:26,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:26,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:26,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:26,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:26,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:26,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:26,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:26,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:26,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:26,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:26,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:26,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:33:26,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:26,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:26,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:26,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:26,902 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:26,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_ground-2.i [2019-10-13 21:33:26,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0dda48f/d9ac4514e6a8449ab82717fb1eab6e74/FLAG73dd735d0 [2019-10-13 21:33:27,468 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:27,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy3_ground-2.i [2019-10-13 21:33:27,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0dda48f/d9ac4514e6a8449ab82717fb1eab6e74/FLAG73dd735d0 [2019-10-13 21:33:27,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0dda48f/d9ac4514e6a8449ab82717fb1eab6e74 [2019-10-13 21:33:27,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:27,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:27,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:27,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:27,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:27,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:27" (1/1) ... [2019-10-13 21:33:27,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7110c535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27, skipping insertion in model container [2019-10-13 21:33:27,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:27" (1/1) ... [2019-10-13 21:33:27,836 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:27,853 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:28,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:28,103 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:28,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:28,177 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:28,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28 WrapperNode [2019-10-13 21:33:28,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:28,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:28,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:28,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:28,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:28,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:28,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:28,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:28,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:28,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:28,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:28,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:28,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:28,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:28,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:28,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:28,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:28,866 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:28,867 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 21:33:28,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:28 BoogieIcfgContainer [2019-10-13 21:33:28,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:28,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:28,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:28,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:28,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:27" (1/3) ... [2019-10-13 21:33:28,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172cd0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:28, skipping insertion in model container [2019-10-13 21:33:28,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (2/3) ... [2019-10-13 21:33:28,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172cd0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:28, skipping insertion in model container [2019-10-13 21:33:28,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:28" (3/3) ... [2019-10-13 21:33:28,877 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy3_ground-2.i [2019-10-13 21:33:28,887 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:28,897 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:28,907 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:28,933 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:28,933 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:28,933 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:28,933 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:28,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:28,934 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:28,934 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:28,934 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 21:33:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:33:28,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:28,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:28,962 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:28,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1715360832, now seen corresponding path program 1 times [2019-10-13 21:33:28,976 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:28,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093210049] [2019-10-13 21:33:28,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:33:29,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093210049] [2019-10-13 21:33:29,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:29,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:29,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510695594] [2019-10-13 21:33:29,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:29,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:29,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:29,183 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-13 21:33:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:29,219 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-13 21:33:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:29,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:33:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:29,230 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:33:29,230 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 21:33:29,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 21:33:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 21:33:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 21:33:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-13 21:33:29,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14 [2019-10-13 21:33:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:29,277 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-13 21:33:29,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-13 21:33:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:33:29,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:29,279 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:29,279 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1871332789, now seen corresponding path program 1 times [2019-10-13 21:33:29,280 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:29,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053264240] [2019-10-13 21:33:29,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:29,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053264240] [2019-10-13 21:33:29,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:29,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:29,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751718061] [2019-10-13 21:33:29,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:29,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:29,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:29,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:29,343 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-10-13 21:33:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:29,369 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-10-13 21:33:29,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:29,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 21:33:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:29,371 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:33:29,371 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:33:29,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:33:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:33:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:33:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-13 21:33:29,379 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2019-10-13 21:33:29,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:29,379 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-13 21:33:29,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-13 21:33:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:33:29,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:29,381 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:29,381 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash -313466217, now seen corresponding path program 1 times [2019-10-13 21:33:29,382 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:29,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280176749] [2019-10-13 21:33:29,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:33:29,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280176749] [2019-10-13 21:33:29,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315856739] [2019-10-13 21:33:29,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:29,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:29,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:33:29,653 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:33:29,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1738482503] [2019-10-13 21:33:29,725 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:29,726 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:29,733 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:29,741 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:29,742 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:29,901 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:30,488 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:31,174 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:31,195 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:31,204 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:31,204 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:31,205 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#a4~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_1|) |v_main_~#a4~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,205 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:31,206 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,206 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#a4~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_1|) |v_main_~#a4~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,207 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:31,207 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,207 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:31,207 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:31,208 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:31,208 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:31,208 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#a4~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_1|) |v_main_~#a4~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,209 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:31,209 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-13 21:33:31,209 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,209 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#a4~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_1|) |v_main_~#a4~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) [2019-10-13 21:33:31,560 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:31,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:31,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250679988] [2019-10-13 21:33:31,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:31,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:31,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:31,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:31,567 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-13 21:33:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:32,260 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-10-13 21:33:32,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:32,261 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-10-13 21:33:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:32,262 INFO L225 Difference]: With dead ends: 52 [2019-10-13 21:33:32,262 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 21:33:32,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 21:33:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-10-13 21:33:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:33:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-13 21:33:32,272 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-10-13 21:33:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:32,272 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-13 21:33:32,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-13 21:33:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:33:32,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,274 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:32,478 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1940789760, now seen corresponding path program 2 times [2019-10-13 21:33:32,479 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090228947] [2019-10-13 21:33:32,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:33:32,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090228947] [2019-10-13 21:33:32,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958365123] [2019-10-13 21:33:32,615 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:32,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:32,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:32,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:32,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:33:32,690 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:33:32,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [811726526] [2019-10-13 21:33:32,724 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:32,724 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:32,725 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:32,725 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:32,725 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:32,768 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:33,606 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:33,699 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:33,711 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:33,718 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:33,718 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:33,719 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a4~0.base_BEFORE_CALL_2| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_2|) |v_main_~#a4~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:33,719 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:33,719 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a4~0.base_BEFORE_CALL_2| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_2|) |v_main_~#a4~0.offset_BEFORE_CALL_2|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:33,719 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:33,720 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:33,720 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:33,721 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:33,721 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:33,721 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:33,722 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a4~0.base_BEFORE_CALL_2| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_2|) |v_main_~#a4~0.offset_BEFORE_CALL_2|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:33,722 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:33,722 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:33,723 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-13 21:33:33,723 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:33,723 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a4~0.base_BEFORE_CALL_2| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_2|) |v_main_~#a4~0.offset_BEFORE_CALL_2|))))) [2019-10-13 21:33:33,991 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:33,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-13 21:33:33,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829276251] [2019-10-13 21:33:33,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:33:33,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:33,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:33:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:33:33,993 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 19 states. [2019-10-13 21:33:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:34,648 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2019-10-13 21:33:34,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:34,648 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-10-13 21:33:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:34,649 INFO L225 Difference]: With dead ends: 64 [2019-10-13 21:33:34,650 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 21:33:34,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:33:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 21:33:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2019-10-13 21:33:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 21:33:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-13 21:33:34,660 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 24 [2019-10-13 21:33:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:34,661 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-13 21:33:34,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:33:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-13 21:33:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 21:33:34,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:34,662 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:34,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:34,865 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:34,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:34,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2133601280, now seen corresponding path program 3 times [2019-10-13 21:33:34,866 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:34,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937195982] [2019-10-13 21:33:34,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:34,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:34,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-13 21:33:35,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937195982] [2019-10-13 21:33:35,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188329724] [2019-10-13 21:33:35,089 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:35,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:35,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:35,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:35,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-13 21:33:35,256 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-13 21:33:35,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1657572] [2019-10-13 21:33:35,330 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:35,330 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:35,331 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:35,331 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:35,331 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:35,354 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:36,049 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:36,056 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:36,060 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:36,060 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:36,061 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a4~0.base_BEFORE_CALL_3| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_3|) |v_main_~#a4~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:36,061 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:36,062 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a4~0.base_BEFORE_CALL_3| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_3|) |v_main_~#a4~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:36,062 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,062 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:36,062 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,063 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:36,063 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,063 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,063 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a4~0.base_BEFORE_CALL_3| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_3|) |v_main_~#a4~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:36,064 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,064 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:36,064 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-13 21:33:36,065 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,065 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a4~0.base_BEFORE_CALL_3| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_3|) |v_main_~#a4~0.offset_BEFORE_CALL_3|))))) [2019-10-13 21:33:36,441 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:36,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 29 [2019-10-13 21:33:36,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765433286] [2019-10-13 21:33:36,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:33:36,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:36,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:33:36,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:33:36,445 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 29 states. [2019-10-13 21:33:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:37,649 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2019-10-13 21:33:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 21:33:37,650 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2019-10-13 21:33:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:37,651 INFO L225 Difference]: With dead ends: 88 [2019-10-13 21:33:37,651 INFO L226 Difference]: Without dead ends: 58 [2019-10-13 21:33:37,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=398, Invalid=2358, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 21:33:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-13 21:33:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-10-13 21:33:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-13 21:33:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-13 21:33:37,663 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 36 [2019-10-13 21:33:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:37,663 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-13 21:33:37,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:33:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-13 21:33:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 21:33:37,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:37,665 INFO L380 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:37,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:37,878 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:37,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:37,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1182805644, now seen corresponding path program 4 times [2019-10-13 21:33:37,879 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:37,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390729615] [2019-10-13 21:33:37,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:37,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:37,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 21:33:38,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390729615] [2019-10-13 21:33:38,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153765607] [2019-10-13 21:33:38,110 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:38,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:38,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 21:33:38,228 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 21:33:38,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [562335245] [2019-10-13 21:33:38,397 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:38,398 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:38,398 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:38,398 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:38,399 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:38,422 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:39,158 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:39,165 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:39,168 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:39,168 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:39,169 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a4~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_4|) |v_main_~#a4~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))))) [2019-10-13 21:33:39,169 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:39,172 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a4~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_4|) |v_main_~#a4~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))))) [2019-10-13 21:33:39,173 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,173 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:39,173 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,173 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:39,173 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:39,174 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:39,174 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a4~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_4|) |v_main_~#a4~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))))) [2019-10-13 21:33:39,174 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:39,174 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:39,175 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-13 21:33:39,175 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,175 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a4~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_4|) |v_main_~#a4~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:39,463 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:39,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-13 21:33:39,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618353594] [2019-10-13 21:33:39,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:33:39,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:39,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:33:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:33:39,467 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 35 states. [2019-10-13 21:33:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:40,661 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-10-13 21:33:40,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:33:40,665 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-10-13 21:33:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:40,666 INFO L225 Difference]: With dead ends: 103 [2019-10-13 21:33:40,667 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 21:33:40,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:33:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 21:33:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-10-13 21:33:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 21:33:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-10-13 21:33:40,679 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 45 [2019-10-13 21:33:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:40,679 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-10-13 21:33:40,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:33:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-10-13 21:33:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:33:40,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:40,681 INFO L380 BasicCegarLoop]: trace histogram [22, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:40,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:40,892 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash 837686988, now seen corresponding path program 5 times [2019-10-13 21:33:40,893 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:40,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919057855] [2019-10-13 21:33:40,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-10-13 21:33:41,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919057855] [2019-10-13 21:33:41,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700813953] [2019-10-13 21:33:41,100 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:42,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:42,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:42,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 21:33:42,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2019-10-13 21:33:42,782 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-10-13 21:33:42,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [186562735] [2019-10-13 21:33:42,902 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:42,902 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:42,902 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:42,902 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:42,903 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:42,922 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:43,149 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:43,586 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:43,594 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:43,597 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:43,597 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:43,598 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((v_prenex_18 Int) (|v_main_~#a4~0.base_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_5|) |v_main_~#a4~0.offset_BEFORE_CALL_5|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:43,598 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:43,598 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (exists ((v_prenex_18 Int) (|v_main_~#a4~0.base_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_5|) |v_main_~#a4~0.offset_BEFORE_CALL_5|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:43,598 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,599 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:43,599 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,599 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:43,599 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:43,599 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:33:43,600 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:43,600 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (exists ((v_prenex_18 Int) (|v_main_~#a4~0.base_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_5|) |v_main_~#a4~0.offset_BEFORE_CALL_5|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:43,600 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:43,600 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-13 21:33:43,601 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,601 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((v_prenex_18 Int) (|v_main_~#a4~0.base_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_5|) |v_main_~#a4~0.offset_BEFORE_CALL_5|))))) [2019-10-13 21:33:43,868 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:43,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10, 11] total 30 [2019-10-13 21:33:43,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124094237] [2019-10-13 21:33:43,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-13 21:33:43,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-13 21:33:43,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:33:43,871 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 30 states. [2019-10-13 21:33:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:45,066 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2019-10-13 21:33:45,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:33:45,067 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-10-13 21:33:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:45,068 INFO L225 Difference]: With dead ends: 122 [2019-10-13 21:33:45,068 INFO L226 Difference]: Without dead ends: 97 [2019-10-13 21:33:45,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=629, Invalid=2127, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 21:33:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-13 21:33:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2019-10-13 21:33:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 21:33:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-10-13 21:33:45,082 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 57 [2019-10-13 21:33:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:45,083 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2019-10-13 21:33:45,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-13 21:33:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2019-10-13 21:33:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-13 21:33:45,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:45,086 INFO L380 BasicCegarLoop]: trace histogram [22, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:45,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:45,292 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:45,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1909214368, now seen corresponding path program 6 times [2019-10-13 21:33:45,293 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:45,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278809976] [2019-10-13 21:33:45,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-13 21:33:45,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278809976] [2019-10-13 21:33:45,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208457427] [2019-10-13 21:33:45,783 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:45,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:45,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:45,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:33:45,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-13 21:33:46,329 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-13 21:33:47,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1155976144] [2019-10-13 21:33:47,359 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:47,359 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:47,360 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:47,360 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:47,360 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:47,377 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:47,965 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:47,976 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:47,979 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:47,979 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:47,980 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((|v_main_~#a4~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_6|) |v_main_~#a4~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,980 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:47,980 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a4~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_6|) |v_main_~#a4~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,980 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,980 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:47,981 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,981 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:47,981 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:47,981 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:47,981 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:47,981 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a4~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_6|) |v_main_~#a4~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,982 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:47,982 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-13 21:33:47,982 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,983 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((|v_main_~#a4~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_6|) |v_main_~#a4~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) [2019-10-13 21:33:48,463 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:48,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 25, 11] total 75 [2019-10-13 21:33:48,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014258734] [2019-10-13 21:33:48,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-13 21:33:48,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-13 21:33:48,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=4223, Unknown=0, NotChecked=0, Total=5550 [2019-10-13 21:33:48,467 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 75 states. [2019-10-13 21:33:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:52,566 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2019-10-13 21:33:52,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-13 21:33:52,567 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 84 [2019-10-13 21:33:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:52,569 INFO L225 Difference]: With dead ends: 184 [2019-10-13 21:33:52,569 INFO L226 Difference]: Without dead ends: 124 [2019-10-13 21:33:52,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4998 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4009, Invalid=16871, Unknown=0, NotChecked=0, Total=20880 [2019-10-13 21:33:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-13 21:33:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2019-10-13 21:33:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-13 21:33:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-10-13 21:33:52,590 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 84 [2019-10-13 21:33:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:52,590 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-10-13 21:33:52,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-13 21:33:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-10-13 21:33:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:33:52,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:52,592 INFO L380 BasicCegarLoop]: trace histogram [46, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:52,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:52,804 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1814523980, now seen corresponding path program 7 times [2019-10-13 21:33:52,805 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:52,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075863728] [2019-10-13 21:33:52,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2019-10-13 21:33:53,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075863728] [2019-10-13 21:33:53,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859704575] [2019-10-13 21:33:53,418 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:53,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-13 21:33:53,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-13 21:33:54,850 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-13 21:33:58,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1607589957] [2019-10-13 21:33:58,238 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:58,238 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:58,238 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:58,238 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:58,239 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:58,261 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:58,918 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:58,928 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:58,930 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:58,930 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:58,930 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((|v_main_~#a4~0.base_BEFORE_CALL_7| Int) (v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_7|) |v_main_~#a4~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_26) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:58,930 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:58,930 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a4~0.base_BEFORE_CALL_7| Int) (v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_7|) |v_main_~#a4~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_26) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:58,931 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,931 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:58,931 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,931 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:58,931 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:58,931 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:58,931 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:58,931 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a4~0.base_BEFORE_CALL_7| Int) (v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_7|) |v_main_~#a4~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_26) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:58,932 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:58,932 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-13 21:33:58,932 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,932 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((|v_main_~#a4~0.base_BEFORE_CALL_7| Int) (v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_7|) |v_main_~#a4~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_26) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) [2019-10-13 21:33:59,500 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:59,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 49, 49, 11] total 124 [2019-10-13 21:33:59,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584924056] [2019-10-13 21:33:59,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-10-13 21:33:59,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:59,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-10-13 21:33:59,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4778, Invalid=10474, Unknown=0, NotChecked=0, Total=15252 [2019-10-13 21:33:59,508 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 124 states.