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_copy6_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:30,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:30,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:30,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:30,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:30,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:30,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:30,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:30,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:30,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:30,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:30,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:30,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:30,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:30,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:30,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:30,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:30,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:30,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:30,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:30,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:30,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:30,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:30,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:30,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:30,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:30,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:30,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:30,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:30,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:30,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:30,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:30,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:30,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:30,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:30,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:30,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:30,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:30,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:30,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:30,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:30,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:33:30,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:30,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:30,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:30,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:30,584 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:30,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:30,585 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:30,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:30,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:30,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:30,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:30,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:30,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:30,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:30,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:30,587 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:30,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:30,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:30,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:30,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:30,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:30,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:30,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:30,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:30,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:30,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:30,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:30,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:30,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:33:30,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:30,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:30,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:30,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:30,876 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:30,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy6_ground-1.i [2019-10-13 21:33:30,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7384a6d1/a0322b5487ce4207b2032a99ff6de543/FLAGd4212296b [2019-10-13 21:33:31,403 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:31,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy6_ground-1.i [2019-10-13 21:33:31,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7384a6d1/a0322b5487ce4207b2032a99ff6de543/FLAGd4212296b [2019-10-13 21:33:31,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7384a6d1/a0322b5487ce4207b2032a99ff6de543 [2019-10-13 21:33:31,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:31,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:31,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:31,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:31,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:31,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8f9260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31, skipping insertion in model container [2019-10-13 21:33:31,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,811 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:31,832 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:32,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:32,023 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:32,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:32,149 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:32,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32 WrapperNode [2019-10-13 21:33:32,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:32,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:32,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:32,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:32,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32" (1/1) ... [2019-10-13 21:33:32,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32" (1/1) ... [2019-10-13 21:33:32,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32" (1/1) ... [2019-10-13 21:33:32,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32" (1/1) ... [2019-10-13 21:33:32,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32" (1/1) ... [2019-10-13 21:33:32,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32" (1/1) ... [2019-10-13 21:33:32,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32" (1/1) ... [2019-10-13 21:33:32,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:32,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:32,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:32,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:32,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:32,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:32,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:32,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:32,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:32,833 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:32,834 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-13 21:33:32,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:32 BoogieIcfgContainer [2019-10-13 21:33:32,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:32,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:32,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:32,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:32,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:31" (1/3) ... [2019-10-13 21:33:32,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef45f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:32, skipping insertion in model container [2019-10-13 21:33:32,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:32" (2/3) ... [2019-10-13 21:33:32,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef45f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:32, skipping insertion in model container [2019-10-13 21:33:32,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:32" (3/3) ... [2019-10-13 21:33:32,844 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy6_ground-1.i [2019-10-13 21:33:32,855 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:32,863 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:32,875 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:32,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:32,903 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:32,903 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:32,903 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:32,903 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:32,904 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:32,904 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:32,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-13 21:33:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:33:32,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,934 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1527048639, now seen corresponding path program 1 times [2019-10-13 21:33:32,952 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664333527] [2019-10-13 21:33:32,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:33:33,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664333527] [2019-10-13 21:33:33,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:33,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:33,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505468643] [2019-10-13 21:33:33,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:33,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:33,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:33,161 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-10-13 21:33:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:33,206 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2019-10-13 21:33:33,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:33,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:33:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:33,219 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:33:33,219 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:33:33,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:33:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:33:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:33:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-10-13 21:33:33,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 17 [2019-10-13 21:33:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:33,280 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-10-13 21:33:33,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2019-10-13 21:33:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:33:33,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:33,283 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:33,283 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1172389655, now seen corresponding path program 1 times [2019-10-13 21:33:33,285 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:33,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048986458] [2019-10-13 21:33:33,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:33,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:33,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:33,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048986458] [2019-10-13 21:33:33,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:33,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:33,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706791155] [2019-10-13 21:33:33,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:33,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:33,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:33,387 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 3 states. [2019-10-13 21:33:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:33,436 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2019-10-13 21:33:33,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:33,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:33:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:33,438 INFO L225 Difference]: With dead ends: 42 [2019-10-13 21:33:33,438 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 21:33:33,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 21:33:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-13 21:33:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:33:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-10-13 21:33:33,447 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 18 [2019-10-13 21:33:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:33,447 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-13 21:33:33,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-10-13 21:33:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:33:33,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:33,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:33,449 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:33,450 INFO L82 PathProgramCache]: Analyzing trace with hash -634654363, now seen corresponding path program 1 times [2019-10-13 21:33:33,450 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:33,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114624835] [2019-10-13 21:33:33,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:33,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:33,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:33:33,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114624835] [2019-10-13 21:33:33,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078139398] [2019-10-13 21:33:33,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:33,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:33,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:33:33,699 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:33:33,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [703480572] [2019-10-13 21:33:33,763 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:33,764 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:33,771 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:33,780 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:33,781 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:34,016 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:34,530 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:34,814 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:35,173 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:35,968 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:36,007 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:36,017 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:36,017 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:36,018 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:36,018 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__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:36,018 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:36,018 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:36,019 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,019 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__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:36,019 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,020 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,020 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,020 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,021 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:36,022 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,023 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:36,023 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,023 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:33:36,024 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,024 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-13 21:33:36,024 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,434 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:36,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:36,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252182206] [2019-10-13 21:33:36,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:36,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:36,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:36,442 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 18 states. [2019-10-13 21:33:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:37,198 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-10-13 21:33:37,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:37,200 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-13 21:33:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:37,202 INFO L225 Difference]: With dead ends: 67 [2019-10-13 21:33:37,202 INFO L226 Difference]: Without dead ends: 46 [2019-10-13 21:33:37,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:37,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-13 21:33:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-10-13 21:33:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:33:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-13 21:33:37,221 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 24 [2019-10-13 21:33:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:37,221 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-13 21:33:37,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-13 21:33:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 21:33:37,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:37,224 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:37,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:37,429 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash 66945921, now seen corresponding path program 2 times [2019-10-13 21:33:37,430 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:37,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816284708] [2019-10-13 21:33:37,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:37,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:37,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:33:37,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816284708] [2019-10-13 21:33:37,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983996685] [2019-10-13 21:33:37,593 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:37,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:37,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:37,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:37,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:33:37,692 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:33:37,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2098010187] [2019-10-13 21:33:37,724 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:37,724 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:37,724 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:37,725 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:37,725 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:37,763 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:38,379 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:39,272 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:39,279 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:39,282 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:39,282 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:39,283 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:39,283 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_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:39,283 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:39,283 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:39,283 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,284 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_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:39,284 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,284 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:39,284 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:39,285 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,285 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:39,285 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:39,285 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:39,285 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,286 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))))) [2019-10-13 21:33:39,286 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,286 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-13 21:33:39,286 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,536 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:39,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-13 21:33:39,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55892079] [2019-10-13 21:33:39,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:33:39,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:39,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:33:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:33:39,539 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 19 states. [2019-10-13 21:33:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:40,536 INFO L93 Difference]: Finished difference Result 94 states and 130 transitions. [2019-10-13 21:33:40,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:40,536 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2019-10-13 21:33:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:40,538 INFO L225 Difference]: With dead ends: 94 [2019-10-13 21:33:40,538 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 21:33:40,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:33:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 21:33:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-10-13 21:33:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 21:33:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2019-10-13 21:33:40,551 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 33 [2019-10-13 21:33:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:40,551 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2019-10-13 21:33:40,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:33:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2019-10-13 21:33:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:33:40,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:40,553 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:40,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:40,759 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1652751615, now seen corresponding path program 3 times [2019-10-13 21:33:40,760 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:40,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214657757] [2019-10-13 21:33:40,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:40,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214657757] [2019-10-13 21:33:40,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168574446] [2019-10-13 21:33:40,922 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:41,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:41,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:41,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:41,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:41,055 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:41,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1058310772] [2019-10-13 21:33:41,111 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:41,112 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:41,113 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:41,113 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:41,113 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:41,142 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:42,451 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:42,456 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:42,459 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:42,460 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:42,460 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:42,460 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:42,460 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:42,460 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:42,461 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:42,461 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:42,461 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:42,461 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:42,461 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:42,462 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:42,462 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:42,462 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:42,462 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:42,462 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:42,463 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) [2019-10-13 21:33:42,463 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:42,463 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-13 21:33:42,463 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:42,769 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:42,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-13 21:33:42,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559740470] [2019-10-13 21:33:42,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:42,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:42,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:42,772 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 23 states. [2019-10-13 21:33:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:43,489 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2019-10-13 21:33:43,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:33:43,490 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2019-10-13 21:33:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:43,491 INFO L225 Difference]: With dead ends: 127 [2019-10-13 21:33:43,491 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 21:33:43,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:33:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 21:33:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2019-10-13 21:33:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 21:33:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-10-13 21:33:43,504 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 57 [2019-10-13 21:33:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:43,504 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-10-13 21:33:43,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-10-13 21:33:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 21:33:43,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:43,506 INFO L380 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:43,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:43,715 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:43,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1875901631, now seen corresponding path program 4 times [2019-10-13 21:33:43,716 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:43,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407587889] [2019-10-13 21:33:43,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:43,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:43,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-13 21:33:43,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407587889] [2019-10-13 21:33:43,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229148983] [2019-10-13 21:33:43,908 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:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:44,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:44,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:44,193 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:44,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1536491333] [2019-10-13 21:33:44,433 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:44,433 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:44,434 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:44,434 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:44,434 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:44,458 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:45,676 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:45,681 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:45,683 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:45,683 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:45,683 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:45,683 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:45,683 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:45,683 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:45,684 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:45,684 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:45,684 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:45,684 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:45,684 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:45,685 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:45,685 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:45,685 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:45,685 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:45,686 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:45,686 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) [2019-10-13 21:33:45,686 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:45,686 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-13 21:33:45,686 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,016 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:46,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13, 11] total 41 [2019-10-13 21:33:46,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211741133] [2019-10-13 21:33:46,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-13 21:33:46,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:46,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-13 21:33:46,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1300, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:33:46,020 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 41 states. [2019-10-13 21:33:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:47,741 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2019-10-13 21:33:47,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-13 21:33:47,742 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 63 [2019-10-13 21:33:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:47,743 INFO L225 Difference]: With dead ends: 145 [2019-10-13 21:33:47,743 INFO L226 Difference]: Without dead ends: 94 [2019-10-13 21:33:47,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1028, Invalid=4824, Unknown=0, NotChecked=0, Total=5852 [2019-10-13 21:33:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-13 21:33:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-10-13 21:33:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-13 21:33:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-10-13 21:33:47,760 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 63 [2019-10-13 21:33:47,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:47,760 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-10-13 21:33:47,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-13 21:33:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-10-13 21:33:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-13 21:33:47,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:47,762 INFO L380 BasicCegarLoop]: trace histogram [22, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:47,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:47,975 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:47,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:47,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1359064847, now seen corresponding path program 5 times [2019-10-13 21:33:47,975 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:47,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82138436] [2019-10-13 21:33:47,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:47,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:47,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-13 21:33:48,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82138436] [2019-10-13 21:33:48,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141476885] [2019-10-13 21:33:48,175 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:55,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:55,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:55,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:33:55,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-13 21:33:55,676 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-13 21:33:55,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933541480] [2019-10-13 21:33:55,789 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:55,789 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:55,789 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:55,789 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:55,790 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:55,810 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:56,137 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:56,384 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:57,165 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:57,171 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:57,183 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:57,183 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:57,184 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-13 21:33:57,184 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-13 21:33:57,184 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:57,184 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:57,185 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:57,185 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-13 21:33:57,185 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:57,185 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:57,185 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:57,185 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:57,186 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:57,186 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:57,186 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:57,186 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:57,186 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:33:57,186 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:57,187 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-13 21:33:57,187 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:57,478 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:57,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 11] total 29 [2019-10-13 21:33:57,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486745736] [2019-10-13 21:33:57,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:33:57,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:57,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:33:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:33:57,481 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 29 states. [2019-10-13 21:33:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:58,986 INFO L93 Difference]: Finished difference Result 197 states and 263 transitions. [2019-10-13 21:33:58,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:33:58,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2019-10-13 21:33:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:58,989 INFO L225 Difference]: With dead ends: 197 [2019-10-13 21:33:58,989 INFO L226 Difference]: Without dead ends: 148 [2019-10-13 21:33:58,990 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=591, Invalid=2061, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 21:33:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-13 21:33:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2019-10-13 21:33:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-13 21:33:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2019-10-13 21:33:59,008 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 81 [2019-10-13 21:33:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:59,008 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2019-10-13 21:33:59,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:33:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2019-10-13 21:33:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:33:59,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:59,011 INFO L380 BasicCegarLoop]: trace histogram [22, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:59,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:59,212 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1413846399, now seen corresponding path program 6 times [2019-10-13 21:33:59,213 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:59,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399313738] [2019-10-13 21:33:59,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:59,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:59,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2019-10-13 21:34:00,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399313738] [2019-10-13 21:34:00,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889236657] [2019-10-13 21:34:00,007 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:34:00,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:00,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:00,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:34:00,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2019-10-13 21:34:00,697 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2019-10-13 21:34:01,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [297291028] [2019-10-13 21:34:01,841 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:34:01,841 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:01,842 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:01,843 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:01,843 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:01,863 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:03,134 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:03,145 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:03,148 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:03,148 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:03,148 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:03,148 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 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:34:03,148 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:03,149 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:03,149 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,149 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 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:34:03,149 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,149 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:34:03,150 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,150 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:34:03,150 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:03,150 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:34:03,150 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:03,151 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,151 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:34:03,151 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,151 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-13 21:34:03,151 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,588 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:03,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 25, 11] total 75 [2019-10-13 21:34:03,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605772430] [2019-10-13 21:34:03,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-13 21:34:03,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-13 21:34:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=4223, Unknown=0, NotChecked=0, Total=5550 [2019-10-13 21:34:03,594 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 75 states. [2019-10-13 21:34:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:07,722 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2019-10-13 21:34:07,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-13 21:34:07,723 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 135 [2019-10-13 21:34:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:07,725 INFO L225 Difference]: With dead ends: 289 [2019-10-13 21:34:07,725 INFO L226 Difference]: Without dead ends: 178 [2019-10-13 21:34:07,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4998 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4009, Invalid=16871, Unknown=0, NotChecked=0, Total=20880 [2019-10-13 21:34:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-13 21:34:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2019-10-13 21:34:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-13 21:34:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 176 transitions. [2019-10-13 21:34:07,752 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 176 transitions. Word has length 135 [2019-10-13 21:34:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:07,752 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 176 transitions. [2019-10-13 21:34:07,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-13 21:34:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2019-10-13 21:34:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 21:34:07,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:07,755 INFO L380 BasicCegarLoop]: trace histogram [46, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:07,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:07,967 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1171288655, now seen corresponding path program 7 times [2019-10-13 21:34:07,968 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:07,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620582404] [2019-10-13 21:34:07,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:07,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:07,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 1846 trivial. 0 not checked. [2019-10-13 21:34:09,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620582404] [2019-10-13 21:34:09,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893780085] [2019-10-13 21:34:09,213 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:34:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:09,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-13 21:34:09,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2019-10-13 21:34:10,661 INFO L321 TraceCheckSpWp]: Computing backward predicates...