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_compare_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:52,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:52,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:52,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:52,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:52,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:52,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:52,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:52,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:52,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:52,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:52,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:52,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:52,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:52,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:52,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:52,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:52,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:52,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:52,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:52,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:52,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:52,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:52,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:52,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:52,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:52,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:52,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:52,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:52,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:52,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:52,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:52,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:52,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:52,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:52,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:52,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:52,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:52,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:52,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:52,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:52,096 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:32:52,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:52,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:52,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:52,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:52,121 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:52,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:52,121 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:52,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:52,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:52,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:52,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:52,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:52,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:52,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:52,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:52,123 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:52,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:52,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:52,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:52,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:52,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:52,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:52,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:52,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:52,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:52,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:52,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:52,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:52,128 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:32:52,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:52,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:52,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:52,430 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:52,431 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:52,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compare_ground.i [2019-10-13 21:32:52,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38fa12ba/b1d9fa4a3bf841bcb1539c474678c737/FLAG80fcef701 [2019-10-13 21:32:52,933 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:52,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compare_ground.i [2019-10-13 21:32:52,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38fa12ba/b1d9fa4a3bf841bcb1539c474678c737/FLAG80fcef701 [2019-10-13 21:32:53,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38fa12ba/b1d9fa4a3bf841bcb1539c474678c737 [2019-10-13 21:32:53,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:53,341 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:53,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:53,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:53,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:53,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:53" (1/1) ... [2019-10-13 21:32:53,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fbaaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53, skipping insertion in model container [2019-10-13 21:32:53,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:53" (1/1) ... [2019-10-13 21:32:53,357 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:53,379 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:53,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:53,616 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:53,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:53,659 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:53,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53 WrapperNode [2019-10-13 21:32:53,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:53,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:53,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:53,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:53,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53" (1/1) ... [2019-10-13 21:32:53,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53" (1/1) ... [2019-10-13 21:32:53,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53" (1/1) ... [2019-10-13 21:32:53,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53" (1/1) ... [2019-10-13 21:32:53,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53" (1/1) ... [2019-10-13 21:32:53,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53" (1/1) ... [2019-10-13 21:32:53,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53" (1/1) ... [2019-10-13 21:32:53,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:53,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:53,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:53,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:53,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53" (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:32:53,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:54,205 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:54,205 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:32:54,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:54 BoogieIcfgContainer [2019-10-13 21:32:54,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:54,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:54,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:54,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:54,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:53" (1/3) ... [2019-10-13 21:32:54,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac36bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:54, skipping insertion in model container [2019-10-13 21:32:54,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:53" (2/3) ... [2019-10-13 21:32:54,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac36bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:54, skipping insertion in model container [2019-10-13 21:32:54,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:54" (3/3) ... [2019-10-13 21:32:54,229 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_compare_ground.i [2019-10-13 21:32:54,242 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:54,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:54,259 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:54,282 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:54,282 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:54,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:54,283 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:54,283 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:54,283 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:54,283 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:54,283 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 21:32:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:54,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:54,303 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:54,305 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:54,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1664756858, now seen corresponding path program 1 times [2019-10-13 21:32:54,316 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:54,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773499540] [2019-10-13 21:32:54,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:54,472 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:32:54,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773499540] [2019-10-13 21:32:54,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:54,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:54,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465304681] [2019-10-13 21:32:54,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:54,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:54,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:54,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:54,495 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-13 21:32:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:54,522 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-10-13 21:32:54,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:54,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:32:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:54,532 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:32:54,532 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:32:54,536 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:32:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:32:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:32:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:32:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:32:54,574 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:32:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:54,574 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:32:54,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:32:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:54,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:54,577 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:54,579 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1165016204, now seen corresponding path program 1 times [2019-10-13 21:32:54,581 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:54,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64350999] [2019-10-13 21:32:54,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:54,658 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:32:54,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64350999] [2019-10-13 21:32:54,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:54,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:54,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843840873] [2019-10-13 21:32:54,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:54,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:54,663 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-10-13 21:32:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:54,674 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-13 21:32:54,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:54,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:32:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:54,675 INFO L225 Difference]: With dead ends: 29 [2019-10-13 21:32:54,676 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 21:32:54,677 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:32:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 21:32:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 21:32:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 21:32:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-13 21:32:54,682 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-10-13 21:32:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:54,682 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-13 21:32:54,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-13 21:32:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:32:54,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:54,684 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:54,684 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:54,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:54,685 INFO L82 PathProgramCache]: Analyzing trace with hash -695054757, now seen corresponding path program 1 times [2019-10-13 21:32:54,685 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:54,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607935263] [2019-10-13 21:32:54,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:54,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607935263] [2019-10-13 21:32:54,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197189326] [2019-10-13 21:32:54,763 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:32:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:54,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:54,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:54,863 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:54,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [420208613] [2019-10-13 21:32:54,942 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:32:54,942 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:54,950 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:54,959 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:54,968 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:55,127 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:55,493 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:32:55,515 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:55,525 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:55,526 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:55,526 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:55,526 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:55,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:55,527 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-13 21:32:55,527 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-13 21:32:55,528 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:55,528 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:55,529 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:32:55,529 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:32:55,529 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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:32:55,529 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:32:55,530 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:55,530 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:32:55,530 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:55,919 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:55,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 18 [2019-10-13 21:32:55,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511874769] [2019-10-13 21:32:55,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:32:55,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:32:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:32:55,924 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 18 states. [2019-10-13 21:32:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:56,509 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-10-13 21:32:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:32:56,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-10-13 21:32:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:56,510 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:32:56,510 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:32:56,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:32:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:32:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-10-13 21:32:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:32:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-13 21:32:56,524 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-13 21:32:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:56,524 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-13 21:32:56,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:32:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-13 21:32:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:32:56,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:56,526 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:56,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:56,727 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:56,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:56,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1936234603, now seen corresponding path program 2 times [2019-10-13 21:32:56,728 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:56,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237270420] [2019-10-13 21:32:56,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:56,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:56,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:56,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237270420] [2019-10-13 21:32:56,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071294648] [2019-10-13 21:32:56,821 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:32:56,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:32:56,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:56,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:56,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:56,898 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:56,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2060327424] [2019-10-13 21:32:56,920 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:32:56,920 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:56,921 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:56,921 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:56,921 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:56,965 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:57,185 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:32:57,208 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:57,214 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:57,214 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:57,214 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~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_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:57,215 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~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_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (<= __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:32:57,215 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:57,215 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-13 21:32:57,215 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-13 21:32:57,215 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:57,216 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~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_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (<= __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:32:57,216 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:57,217 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:32:57,217 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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:32:57,217 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:32:57,217 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:57,218 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~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_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) [2019-10-13 21:32:57,218 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:57,592 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:57,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 18 [2019-10-13 21:32:57,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415273022] [2019-10-13 21:32:57,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:32:57,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:57,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:32:57,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:32:57,595 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 18 states. [2019-10-13 21:32:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:58,132 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-10-13 21:32:58,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:32:58,133 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-10-13 21:32:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:58,134 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:32:58,135 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:32:58,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:32:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:32:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-13 21:32:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:32:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-13 21:32:58,144 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2019-10-13 21:32:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:58,145 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-13 21:32:58,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:32:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-13 21:32:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:32:58,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:58,147 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:58,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:58,348 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:58,349 INFO L82 PathProgramCache]: Analyzing trace with hash 62974394, now seen corresponding path program 3 times [2019-10-13 21:32:58,349 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:58,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516863462] [2019-10-13 21:32:58,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:58,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:58,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:58,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516863462] [2019-10-13 21:32:58,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554481265] [2019-10-13 21:32:58,439 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:32:58,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:32:58,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:58,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:32:58,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:58,554 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:58,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1797362691] [2019-10-13 21:32:58,628 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:32:58,629 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:58,629 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:58,632 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:58,632 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:58,670 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:58,841 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:32:58,851 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:58,855 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:58,855 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:58,855 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:58,855 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= __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:32:58,856 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:58,856 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-13 21:32:58,856 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-13 21:32:58,856 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:58,856 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= __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:32:58,857 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:32:58,857 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:32:58,857 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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:32:58,857 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:32:58,858 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:58,858 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) [2019-10-13 21:32:58,858 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:59,267 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:59,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 12] total 28 [2019-10-13 21:32:59,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173426727] [2019-10-13 21:32:59,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 21:32:59,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:59,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 21:32:59,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:32:59,271 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 28 states. [2019-10-13 21:33:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:00,295 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-13 21:33:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:33:00,296 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 21 [2019-10-13 21:33:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:00,297 INFO L225 Difference]: With dead ends: 56 [2019-10-13 21:33:00,297 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 21:33:00,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=364, Invalid=2186, Unknown=0, NotChecked=0, Total=2550 [2019-10-13 21:33:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 21:33:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-10-13 21:33:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:33:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-13 21:33:00,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2019-10-13 21:33:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:00,307 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-13 21:33:00,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 21:33:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-13 21:33:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:33:00,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:00,309 INFO L380 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:00,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:00,517 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1767947029, now seen corresponding path program 4 times [2019-10-13 21:33:00,518 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:00,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328268668] [2019-10-13 21:33:00,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:00,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:00,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:33:00,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328268668] [2019-10-13 21:33:00,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793204546] [2019-10-13 21:33:00,712 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:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:00,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:00,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:33:00,806 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:33:01,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [366198234] [2019-10-13 21:33:01,060 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:01,061 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:01,061 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:01,061 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:01,061 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:01,086 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:01,226 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:01,233 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:01,236 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:01,236 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:01,236 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:01,236 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __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:01,237 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:01,237 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-13 21:33:01,237 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-13 21:33:01,237 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:01,238 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __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:01,240 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:01,241 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:01,241 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:01,241 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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:01,241 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:01,241 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:01,242 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:01,581 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:01,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 12] total 36 [2019-10-13 21:33:01,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307847903] [2019-10-13 21:33:01,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-13 21:33:01,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:01,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-13 21:33:01,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=926, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 21:33:01,584 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 36 states. [2019-10-13 21:33:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:02,795 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2019-10-13 21:33:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-13 21:33:02,795 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 28 [2019-10-13 21:33:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:02,796 INFO L225 Difference]: With dead ends: 69 [2019-10-13 21:33:02,797 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 21:33:02,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=949, Invalid=3341, Unknown=0, NotChecked=0, Total=4290 [2019-10-13 21:33:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 21:33:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-10-13 21:33:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 21:33:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-10-13 21:33:02,808 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 28 [2019-10-13 21:33:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:02,809 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-10-13 21:33:02,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-13 21:33:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-10-13 21:33:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 21:33:02,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:02,810 INFO L380 BasicCegarLoop]: trace histogram [22, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:03,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:03,021 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:03,022 INFO L82 PathProgramCache]: Analyzing trace with hash -7782507, now seen corresponding path program 5 times [2019-10-13 21:33:03,022 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:03,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595268310] [2019-10-13 21:33:03,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:03,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:03,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:33:03,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595268310] [2019-10-13 21:33:03,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540860924] [2019-10-13 21:33:03,358 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:03,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:33:03,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:03,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:33:03,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:33:03,568 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:33:03,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1783140729] [2019-10-13 21:33:03,687 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:03,687 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:03,687 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:03,687 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:03,688 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:03,732 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:03,850 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:03,858 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:03,861 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:03,861 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:03,862 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:03,862 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~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:03,862 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:03,862 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-13 21:33:03,862 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-13 21:33:03,862 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:03,863 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~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:03,863 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:03,864 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:03,867 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:03,867 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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:03,868 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:03,868 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:33:03,868 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:04,362 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:04,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8, 8, 12] total 48 [2019-10-13 21:33:04,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806465156] [2019-10-13 21:33:04,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-13 21:33:04,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-13 21:33:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1832, Unknown=0, NotChecked=0, Total=2256 [2019-10-13 21:33:04,366 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 48 states. [2019-10-13 21:33:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:06,594 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-10-13 21:33:06,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-13 21:33:06,594 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 40 [2019-10-13 21:33:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:06,596 INFO L225 Difference]: With dead ends: 77 [2019-10-13 21:33:06,596 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 21:33:06,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1945 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1290, Invalid=6900, Unknown=0, NotChecked=0, Total=8190 [2019-10-13 21:33:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 21:33:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-10-13 21:33:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 21:33:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-10-13 21:33:06,609 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 40 [2019-10-13 21:33:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:06,610 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-10-13 21:33:06,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-13 21:33:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-10-13 21:33:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 21:33:06,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:06,611 INFO L380 BasicCegarLoop]: trace histogram [23, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:06,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:06,815 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1950177524, now seen corresponding path program 6 times [2019-10-13 21:33:06,817 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:06,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761051262] [2019-10-13 21:33:06,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:06,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:06,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:07,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761051262] [2019-10-13 21:33:07,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340223407] [2019-10-13 21:33:07,163 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:07,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:07,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:07,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:33:07,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:07,287 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:08,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [411192915] [2019-10-13 21:33:08,100 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:08,100 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:08,101 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:08,101 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:08,101 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:08,139 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:08,236 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:08,241 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:08,244 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:08,244 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:08,244 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:08,245 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) (<= 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:08,245 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:08,245 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-13 21:33:08,245 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-13 21:33:08,245 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:08,246 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) (<= 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:08,246 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:08,246 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:08,246 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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:08,247 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:08,247 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:08,247 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) [2019-10-13 21:33:08,247 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:08,650 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:08,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 12] total 62 [2019-10-13 21:33:08,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682832325] [2019-10-13 21:33:08,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-13 21:33:08,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-13 21:33:08,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1309, Invalid=2473, Unknown=0, NotChecked=0, Total=3782 [2019-10-13 21:33:08,655 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 62 states. [2019-10-13 21:33:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:11,223 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2019-10-13 21:33:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-13 21:33:11,224 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 48 [2019-10-13 21:33:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:11,226 INFO L225 Difference]: With dead ends: 109 [2019-10-13 21:33:11,226 INFO L226 Difference]: Without dead ends: 86 [2019-10-13 21:33:11,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3187 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3822, Invalid=9984, Unknown=0, NotChecked=0, Total=13806 [2019-10-13 21:33:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-13 21:33:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2019-10-13 21:33:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-13 21:33:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-10-13 21:33:11,242 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 48 [2019-10-13 21:33:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:11,243 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-10-13 21:33:11,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-13 21:33:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-10-13 21:33:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 21:33:11,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:11,245 INFO L380 BasicCegarLoop]: trace histogram [48, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:11,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:11,457 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1289296198, now seen corresponding path program 7 times [2019-10-13 21:33:11,458 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:11,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955497839] [2019-10-13 21:33:11,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:11,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:11,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1254 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:12,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955497839] [2019-10-13 21:33:12,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413746660] [2019-10-13 21:33:12,620 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:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:12,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-13 21:33:12,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1254 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:12,805 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1254 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:15,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [803478061] [2019-10-13 21:33:15,409 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:15,409 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:15,410 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:15,410 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:15,410 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:15,430 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:15,536 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:15,542 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:15,544 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:15,545 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:15,545 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:15,545 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) (<= __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:15,545 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:15,545 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-13 21:33:15,546 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-13 21:33:15,546 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:15,546 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) (<= __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:15,546 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:15,547 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:15,547 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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:15,547 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:15,547 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:15,547 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) [2019-10-13 21:33:15,547 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:16,100 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:16,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 12] total 112 [2019-10-13 21:33:16,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442133882] [2019-10-13 21:33:16,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-10-13 21:33:16,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:16,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-10-13 21:33:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=7348, Unknown=0, NotChecked=0, Total=12432 [2019-10-13 21:33:16,107 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 112 states. [2019-10-13 21:33:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:23,423 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2019-10-13 21:33:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-13 21:33:23,423 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 73 [2019-10-13 21:33:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:23,425 INFO L225 Difference]: With dead ends: 159 [2019-10-13 21:33:23,425 INFO L226 Difference]: Without dead ends: 136 [2019-10-13 21:33:23,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9512 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15047, Invalid=32259, Unknown=0, NotChecked=0, Total=47306 [2019-10-13 21:33:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-13 21:33:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 127. [2019-10-13 21:33:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-13 21:33:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2019-10-13 21:33:23,447 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 73 [2019-10-13 21:33:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:23,447 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2019-10-13 21:33:23,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-10-13 21:33:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2019-10-13 21:33:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 21:33:23,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:23,450 INFO L380 BasicCegarLoop]: trace histogram [98, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:23,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:23,657 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:23,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1394502662, now seen corresponding path program 8 times [2019-10-13 21:33:23,657 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:23,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655184168] [2019-10-13 21:33:23,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:23,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:23,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4929 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:27,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655184168] [2019-10-13 21:33:27,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902434758] [2019-10-13 21:33:27,317 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:27,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-13 21:33:27,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:27,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:33:27,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4929 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-13 21:33:28,138 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4929 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-13 21:33:28,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [271293521] [2019-10-13 21:33:28,814 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:28,814 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:28,815 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:28,815 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:28,815 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:28,839 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:28,968 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:28,974 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:28,982 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:28,982 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:28,982 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:28,983 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))))) (<= __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:28,983 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:28,983 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-13 21:33:28,983 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-13 21:33:28,983 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem7|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:28,983 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))))) (<= __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:28,984 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:28,984 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:28,984 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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:28,984 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:28,984 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:28,984 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))))) [2019-10-13 21:33:28,985 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:29,896 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:29,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 15, 15, 12] total 138 [2019-10-13 21:33:29,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265148628] [2019-10-13 21:33:29,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-10-13 21:33:29,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:29,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-10-13 21:33:29,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5461, Invalid=13445, Unknown=0, NotChecked=0, Total=18906 [2019-10-13 21:33:29,901 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 138 states.