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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:25,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:25,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:25,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:25,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:25,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:25,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:25,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:25,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:25,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:25,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:25,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:25,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:25,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:25,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:25,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:25,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:25,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:25,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:25,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:25,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:25,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:25,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:25,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:25,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:25,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:25,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:25,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:25,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:25,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:25,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:25,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:25,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:25,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:25,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:25,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:25,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:25,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:25,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:25,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:25,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:25,674 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:25,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:25,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:25,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:25,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:25,694 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:25,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:25,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:25,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:25,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:25,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:25,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:25,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:25,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:25,697 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:25,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:25,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:25,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:25,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:25,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:25,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:25,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:25,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:25,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:25,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:25,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:25,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:25,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:25,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:25,700 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:25,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:25,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:25,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:25,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:25,994 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:25,995 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_ground-1.i [2019-10-13 21:33:26,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cd77fbf/e0f7d2b5c9a448aab071b2a8f310651f/FLAG13a6db869 [2019-10-13 21:33:26,555 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:26,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy3_ground-1.i [2019-10-13 21:33:26,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cd77fbf/e0f7d2b5c9a448aab071b2a8f310651f/FLAG13a6db869 [2019-10-13 21:33:26,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cd77fbf/e0f7d2b5c9a448aab071b2a8f310651f [2019-10-13 21:33:26,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:26,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:26,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:26,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:26,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:26,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39589b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26, skipping insertion in model container [2019-10-13 21:33:26,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,998 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:27,019 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:27,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:27,234 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:27,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:27,275 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:27,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27 WrapperNode [2019-10-13 21:33:27,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:27,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:27,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:27,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:27,364 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:27" (1/1) ... [2019-10-13 21:33:27,365 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:27" (1/1) ... [2019-10-13 21:33:27,372 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:27" (1/1) ... [2019-10-13 21:33:27,374 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:27" (1/1) ... [2019-10-13 21:33:27,387 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:27" (1/1) ... [2019-10-13 21:33:27,392 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:27" (1/1) ... [2019-10-13 21:33:27,394 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:27" (1/1) ... [2019-10-13 21:33:27,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:27,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:27,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:27,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:27,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (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:27,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:27,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:27,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:27,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:27,899 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:27,900 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 21:33:27,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:27 BoogieIcfgContainer [2019-10-13 21:33:27,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:27,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:27,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:27,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:27,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:26" (1/3) ... [2019-10-13 21:33:27,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da0cb86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:27, skipping insertion in model container [2019-10-13 21:33:27,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (2/3) ... [2019-10-13 21:33:27,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da0cb86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:27, skipping insertion in model container [2019-10-13 21:33:27,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:27" (3/3) ... [2019-10-13 21:33:27,907 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy3_ground-1.i [2019-10-13 21:33:27,916 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:27,923 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:27,933 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:27,955 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:27,956 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:27,956 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:27,956 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:27,956 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:27,956 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:27,956 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:27,956 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 21:33:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:33:27,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:27,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:27,981 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:27,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1206026117, now seen corresponding path program 1 times [2019-10-13 21:33:27,996 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:27,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388266663] [2019-10-13 21:33:27,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,172 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:28,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388266663] [2019-10-13 21:33:28,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:28,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:28,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684099149] [2019-10-13 21:33:28,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:28,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:28,198 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-13 21:33:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:28,232 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-13 21:33:28,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:28,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:33:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:28,244 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:33:28,244 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 21:33:28,247 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:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 21:33:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 21:33:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 21:33:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-13 21:33:28,284 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14 [2019-10-13 21:33:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:28,285 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-13 21:33:28,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-13 21:33:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:33:28,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:28,287 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:28,287 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash 89083319, now seen corresponding path program 1 times [2019-10-13 21:33:28,288 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:28,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377253874] [2019-10-13 21:33:28,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,353 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:28,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377253874] [2019-10-13 21:33:28,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:28,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:28,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871523879] [2019-10-13 21:33:28,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:28,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:28,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:28,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:28,357 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-10-13 21:33:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:28,388 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-10-13 21:33:28,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:28,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 21:33:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:28,390 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:33:28,390 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:33:28,392 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:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:33:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:33:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:33:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-13 21:33:28,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2019-10-13 21:33:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:28,399 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-13 21:33:28,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-13 21:33:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:33:28,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:28,400 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:28,400 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:28,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1551222113, now seen corresponding path program 1 times [2019-10-13 21:33:28,401 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:28,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540544257] [2019-10-13 21:33:28,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,512 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:28,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540544257] [2019-10-13 21:33:28,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306837581] [2019-10-13 21:33:28,513 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:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:28,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:28,621 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:28,622 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:28,661 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:28,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1010663008] [2019-10-13 21:33:28,689 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:28,689 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:28,696 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:28,705 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:28,706 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:28,891 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:29,302 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:29,648 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:30,019 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:30,037 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:30,047 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:30,048 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:30,048 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:30,049 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 217#(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:30,049 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 222#(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:30,049 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 231#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:30,050 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:30,050 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 207#(and (= |main_#t~mem10| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem9|) (= 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:30,051 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:30,051 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:30,051 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 236#(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:30,052 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:30,052 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:30,052 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:33:30,052 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 212#(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:30,053 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 227#(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:30,054 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 202#(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:30,416 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:30,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:30,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670691206] [2019-10-13 21:33:30,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:30,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:30,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:30,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:30,419 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-13 21:33:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:31,073 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-10-13 21:33:31,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:31,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-10-13 21:33:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:31,076 INFO L225 Difference]: With dead ends: 52 [2019-10-13 21:33:31,076 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 21:33:31,078 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:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 21:33:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-10-13 21:33:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:33:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-13 21:33:31,086 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-10-13 21:33:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:31,087 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-13 21:33:31,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-13 21:33:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:33:31,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:31,088 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:31,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:31,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash -697307259, now seen corresponding path program 2 times [2019-10-13 21:33:31,294 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:31,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692752165] [2019-10-13 21:33:31,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:31,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:31,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:33:31,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692752165] [2019-10-13 21:33:31,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252033002] [2019-10-13 21:33:31,428 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:31,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:31,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:31,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:31,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:31,518 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:31,518 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:31,552 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:31,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1273841155] [2019-10-13 21:33:31,554 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:31,554 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:31,555 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:31,555 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:31,555 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:31,581 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:31,892 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:32,447 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:32,460 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:32,465 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:32,465 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:32,466 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:32,466 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 217#(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:32,466 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 222#(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:32,466 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 231#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:32,466 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:32,467 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 207#(and (= |main_#t~mem10| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem9|) (= 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:32,467 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:32,467 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:32,468 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 236#(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:32,468 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:32,468 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:32,468 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:33:32,468 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 212#(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:32,469 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 227#(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:32,469 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 202#(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:32,779 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:32,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-13 21:33:32,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191387852] [2019-10-13 21:33:32,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:32,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:32,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:32,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:32,782 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 23 states. [2019-10-13 21:33:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:33,689 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2019-10-13 21:33:33,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:33:33,690 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-10-13 21:33:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:33,691 INFO L225 Difference]: With dead ends: 68 [2019-10-13 21:33:33,691 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 21:33:33,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:33:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 21:33:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2019-10-13 21:33:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-13 21:33:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-13 21:33:33,702 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 24 [2019-10-13 21:33:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:33,702 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-13 21:33:33,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-13 21:33:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 21:33:33,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:33,704 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:33,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:33,909 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:33,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1288000311, now seen corresponding path program 3 times [2019-10-13 21:33:33,910 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:33,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934567723] [2019-10-13 21:33:33,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:33,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:33,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-13 21:33:34,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934567723] [2019-10-13 21:33:34,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110034034] [2019-10-13 21:33:34,055 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:34,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:34,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:34,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:33:34,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-13 21:33:34,176 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-13 21:33:34,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1284312580] [2019-10-13 21:33:34,244 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:34,244 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:34,245 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:34,245 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:34,245 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:34,270 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:34,790 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:35,070 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:35,092 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:35,096 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:35,096 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:35,097 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:35,097 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 217#(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:35,097 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 222#(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:35,097 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 231#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:35,098 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:35,098 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 207#(and (= |main_#t~mem10| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem9|) (= 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:35,098 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:35,098 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:35,098 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 236#(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:35,098 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:35,099 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:35,099 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:33:35,099 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 212#(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:35,099 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 227#(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:35,099 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 202#(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:35,366 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:35,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-13 21:33:35,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089281270] [2019-10-13 21:33:35,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:33:35,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:35,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:33:35,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:33:35,369 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 25 states. [2019-10-13 21:33:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:36,206 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2019-10-13 21:33:36,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:33:36,207 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-10-13 21:33:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:36,208 INFO L225 Difference]: With dead ends: 87 [2019-10-13 21:33:36,210 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 21:33:36,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:33:36,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 21:33:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-10-13 21:33:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 21:33:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-13 21:33:36,233 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 37 [2019-10-13 21:33:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:36,234 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-13 21:33:36,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:33:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-13 21:33:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 21:33:36,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:36,239 INFO L380 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:36,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:36,450 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:36,450 INFO L82 PathProgramCache]: Analyzing trace with hash 498732933, now seen corresponding path program 4 times [2019-10-13 21:33:36,451 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:36,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219872012] [2019-10-13 21:33:36,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:36,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:36,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-13 21:33:36,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219872012] [2019-10-13 21:33:36,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916318697] [2019-10-13 21:33:36,646 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:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:36,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:33:36,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-13 21:33:36,764 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-13 21:33:36,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2073947273] [2019-10-13 21:33:37,000 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:37,001 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:37,001 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:37,001 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:37,002 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:37,028 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:37,675 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:37,682 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:37,685 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:37,685 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:37,686 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,686 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 217#(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:37,686 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 222#(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:37,686 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 231#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:37,686 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,687 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 207#(and (= |main_#t~mem10| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem9|) (= 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:37,687 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:37,687 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:37,687 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 236#(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:37,687 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,688 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:37,688 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:33:37,688 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 212#(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:37,688 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 227#(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:37,689 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 202#(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:37,981 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:37,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 21:33:37,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098635382] [2019-10-13 21:33:37,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:33:37,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:37,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:33:37,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:33:37,984 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 39 states. [2019-10-13 21:33:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:39,331 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2019-10-13 21:33:39,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:33:39,338 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 44 [2019-10-13 21:33:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:39,339 INFO L225 Difference]: With dead ends: 101 [2019-10-13 21:33:39,339 INFO L226 Difference]: Without dead ends: 71 [2019-10-13 21:33:39,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 21:33:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-13 21:33:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2019-10-13 21:33:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 21:33:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-10-13 21:33:39,356 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 44 [2019-10-13 21:33:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:39,356 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-10-13 21:33:39,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:33:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-10-13 21:33:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:33:39,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:39,358 INFO L380 BasicCegarLoop]: trace histogram [26, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:39,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:39,567 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:39,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:39,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1364485307, now seen corresponding path program 5 times [2019-10-13 21:33:39,568 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:39,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482762429] [2019-10-13 21:33:39,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-13 21:33:39,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482762429] [2019-10-13 21:33:39,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320282887] [2019-10-13 21:33:39,998 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:40,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:33:40,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:40,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 21:33:40,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-13 21:33:40,498 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-13 21:33:40,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [957758987] [2019-10-13 21:33:40,656 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:40,656 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:40,657 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:40,657 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:40,657 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:40,680 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:41,327 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:41,336 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:41,339 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:41,339 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:41,339 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:41,339 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 217#(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:41,340 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 222#(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:41,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 231#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:41,340 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:41,340 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 207#(and (= |main_#t~mem10| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem9|) (= 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:41,340 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:41,341 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:41,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 236#(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:41,341 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:41,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:41,341 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:33:41,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 227#(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:41,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 212#(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:41,342 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 202#(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:41,877 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:41,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9, 11] total 53 [2019-10-13 21:33:41,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024459246] [2019-10-13 21:33:41,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-13 21:33:41,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-13 21:33:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=2202, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 21:33:41,881 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 53 states. [2019-10-13 21:33:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:44,697 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2019-10-13 21:33:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-13 21:33:44,697 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 58 [2019-10-13 21:33:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:44,700 INFO L225 Difference]: With dead ends: 126 [2019-10-13 21:33:44,700 INFO L226 Difference]: Without dead ends: 96 [2019-10-13 21:33:44,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1684, Invalid=8416, Unknown=0, NotChecked=0, Total=10100 [2019-10-13 21:33:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-13 21:33:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2019-10-13 21:33:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-13 21:33:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-13 21:33:44,716 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 58 [2019-10-13 21:33:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:44,716 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-13 21:33:44,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-13 21:33:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-13 21:33:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 21:33:44,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:44,718 INFO L380 BasicCegarLoop]: trace histogram [27, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:44,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:44,928 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:44,929 INFO L82 PathProgramCache]: Analyzing trace with hash -738951561, now seen corresponding path program 6 times [2019-10-13 21:33:44,929 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:44,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401968433] [2019-10-13 21:33:44,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:44,930 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:44,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-13 21:33:45,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401968433] [2019-10-13 21:33:45,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750502257] [2019-10-13 21:33:45,232 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,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:45,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:45,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:33:45,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-10-13 21:33:45,895 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-10-13 21:33:46,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2038346576] [2019-10-13 21:33:46,958 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:46,958 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:46,959 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:46,959 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:46,959 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:46,976 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:47,630 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:47,636 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:47,640 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:47,640 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:47,640 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,640 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 217#(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,641 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 222#(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,641 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 231#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:47,641 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,641 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 207#(and (= |main_#t~mem10| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem9|) (= 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,642 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,642 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,642 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 236#(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,642 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,642 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:47,643 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:33:47,643 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 227#(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,643 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 212#(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:47,643 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 202#(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:48,143 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:48,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 30, 30, 11] total 83 [2019-10-13 21:33:48,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627131832] [2019-10-13 21:33:48,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-13 21:33:48,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:48,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-13 21:33:48,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1817, Invalid=4989, Unknown=0, NotChecked=0, Total=6806 [2019-10-13 21:33:48,148 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 83 states. [2019-10-13 21:33:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:52,675 INFO L93 Difference]: Finished difference Result 182 states and 221 transitions. [2019-10-13 21:33:52,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-13 21:33:52,676 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-10-13 21:33:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:52,678 INFO L225 Difference]: With dead ends: 182 [2019-10-13 21:33:52,678 INFO L226 Difference]: Without dead ends: 128 [2019-10-13 21:33:52,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5984 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5475, Invalid=20285, Unknown=0, NotChecked=0, Total=25760 [2019-10-13 21:33:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-13 21:33:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2019-10-13 21:33:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-13 21:33:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-10-13 21:33:52,699 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 83 [2019-10-13 21:33:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:52,700 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-10-13 21:33:52,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-13 21:33:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-10-13 21:33:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:33:52,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:52,702 INFO L380 BasicCegarLoop]: trace histogram [56, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:52,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:52,906 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:52,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1199056401, now seen corresponding path program 7 times [2019-10-13 21:33:52,907 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:52,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313325554] [2019-10-13 21:33:52,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 1836 trivial. 0 not checked. [2019-10-13 21:33:53,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313325554] [2019-10-13 21:33:53,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689020872] [2019-10-13 21:33:53,237 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,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:53,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 21:33:53,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-10-13 21:33:55,048 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-10-13 21:33:58,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [319379979] [2019-10-13 21:33:58,907 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:58,908 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:58,908 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:58,908 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:58,908 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:58,928 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:59,326 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:59,589 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:59,600 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:59,603 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:59,603 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:59,603 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,603 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 217#(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:59,603 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 222#(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:59,604 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 231#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:59,604 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,604 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 207#(and (= |main_#t~mem10| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* main_~x~0 4) |main_~#a4~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem9|) (= 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:59,604 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:59,604 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:59,604 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 236#(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:59,605 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,605 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:59,605 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:33:59,605 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 227#(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:59,605 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 212#(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,606 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 202#(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:34:00,209 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:00,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 59, 59, 11] total 142 [2019-10-13 21:34:00,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027254361] [2019-10-13 21:34:00,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-10-13 21:34:00,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:00,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-10-13 21:34:00,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6851, Invalid=13171, Unknown=0, NotChecked=0, Total=20022 [2019-10-13 21:34:00,216 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 142 states.