java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_copy3_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:31:01,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:31:01,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:31:01,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:31:01,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:31:01,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:31:01,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:31:01,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:31:01,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:31:01,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:31:01,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:31:01,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:31:01,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:31:01,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:31:01,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:31:01,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:31:01,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:31:01,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:31:01,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:31:01,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:31:01,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:31:01,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:31:01,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:31:01,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:31:01,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:31:01,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:31:01,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:31:01,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:31:01,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:31:01,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:31:01,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:31:01,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:31:01,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:31:01,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:31:01,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:31:01,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:31:01,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:31:01,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:31:01,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:31:01,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:31:01,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:31:01,352 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-06 23:31:01,381 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:31:01,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:31:01,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:31:01,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:31:01,386 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:31:01,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:31:01,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:31:01,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:31:01,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:31:01,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:31:01,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:31:01,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:31:01,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:31:01,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:31:01,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:31:01,388 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:31:01,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:31:01,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:31:01,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:31:01,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:31:01,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:31:01,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:31:01,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:31:01,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:31:01,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:31:01,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:31:01,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:31:01,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:31:01,394 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-06 23:31:01,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:31:01,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:31:01,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:31:01,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:31:01,662 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:31:01,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_ground-2.i [2019-10-06 23:31:01,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068f4cd58/8e8ccde9e4394d12955e8aab71798351/FLAGcce68f677 [2019-10-06 23:31:02,194 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:31:02,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy3_ground-2.i [2019-10-06 23:31:02,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068f4cd58/8e8ccde9e4394d12955e8aab71798351/FLAGcce68f677 [2019-10-06 23:31:02,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068f4cd58/8e8ccde9e4394d12955e8aab71798351 [2019-10-06 23:31:02,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:31:02,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:31:02,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:31:02,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:31:02,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:31:02,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:31:02" (1/1) ... [2019-10-06 23:31:02,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfc3857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02, skipping insertion in model container [2019-10-06 23:31:02,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:31:02" (1/1) ... [2019-10-06 23:31:02,606 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:31:02,627 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:31:02,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:31:02,838 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:31:02,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:31:02,877 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:31:02,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02 WrapperNode [2019-10-06 23:31:02,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:31:02,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:31:02,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:31:02,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:31:02,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02" (1/1) ... [2019-10-06 23:31:02,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02" (1/1) ... [2019-10-06 23:31:02,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02" (1/1) ... [2019-10-06 23:31:02,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02" (1/1) ... [2019-10-06 23:31:02,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02" (1/1) ... [2019-10-06 23:31:02,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02" (1/1) ... [2019-10-06 23:31:02,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02" (1/1) ... [2019-10-06 23:31:03,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:31:03,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:31:03,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:31:03,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:31:03,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02" (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-06 23:31:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:31:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:31:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:31:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:31:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:31:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:31:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:31:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:31:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:31:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:31:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:31:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:31:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:31:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:31:03,496 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:31:03,496 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-06 23:31:03,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:31:03 BoogieIcfgContainer [2019-10-06 23:31:03,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:31:03,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:31:03,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:31:03,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:31:03,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:31:02" (1/3) ... [2019-10-06 23:31:03,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557e24e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:31:03, skipping insertion in model container [2019-10-06 23:31:03,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:02" (2/3) ... [2019-10-06 23:31:03,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557e24e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:31:03, skipping insertion in model container [2019-10-06 23:31:03,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:31:03" (3/3) ... [2019-10-06 23:31:03,504 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy3_ground-2.i [2019-10-06 23:31:03,514 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:31:03,522 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:31:03,534 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:31:03,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:31:03,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:31:03,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:31:03,557 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:31:03,557 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:31:03,557 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:31:03,557 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:31:03,557 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:31:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-06 23:31:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:31:03,577 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:03,578 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:03,580 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:03,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1715360832, now seen corresponding path program 1 times [2019-10-06 23:31:03,593 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:03,594 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:03,594 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:03,594 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:03,759 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-06 23:31:03,760 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:03,760 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:31:03,761 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:31:03,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:31:03,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:31:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:03,789 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-06 23:31:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:03,832 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-06 23:31:03,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:31:03,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:31:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:03,842 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:31:03,843 INFO L226 Difference]: Without dead ends: 19 [2019-10-06 23:31:03,846 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-06 23:31:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-06 23:31:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-06 23:31:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-06 23:31:03,885 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14 [2019-10-06 23:31:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:03,886 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-06 23:31:03,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:31:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-06 23:31:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:31:03,887 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:03,887 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:03,888 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1871332789, now seen corresponding path program 1 times [2019-10-06 23:31:03,889 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:03,889 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:03,889 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:03,889 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:03,941 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-06 23:31:03,942 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:03,942 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:31:03,942 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:31:03,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:31:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:31:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:03,945 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-10-06 23:31:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:03,974 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-10-06 23:31:03,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:31:03,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-06 23:31:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:03,976 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:31:03,976 INFO L226 Difference]: Without dead ends: 22 [2019-10-06 23:31:03,978 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-06 23:31:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-06 23:31:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:31:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-06 23:31:03,986 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2019-10-06 23:31:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:03,987 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-06 23:31:03,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:31:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-06 23:31:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:31:03,988 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:03,988 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:03,989 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:03,989 INFO L82 PathProgramCache]: Analyzing trace with hash -313466217, now seen corresponding path program 1 times [2019-10-06 23:31:03,990 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:03,991 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:03,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:03,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:31:04,110 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:04,110 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:04,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:04,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:31:04,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:31:04,252 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:31:04,305 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:04,352 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:31:04,356 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:04,366 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:04,375 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:04,376 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:04,545 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:05,006 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:31:05,605 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:31:05,687 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:05,700 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:05,707 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:05,707 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:05,708 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#a4~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_1|) |v_main_~#a4~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:05,708 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:05,708 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:05,709 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#a4~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_1|) |v_main_~#a4~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:05,709 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:05,709 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:05,710 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:05,710 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-06 23:31:05,710 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-06 23:31:05,711 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:05,711 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:05,711 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:31:05,712 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:05,712 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#a4~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_1|) |v_main_~#a4~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) [2019-10-06 23:31:05,712 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#a4~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_1|) |v_main_~#a4~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:06,042 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:06,043 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 10] total 17 [2019-10-06 23:31:06,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:31:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:31:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:31:06,050 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 17 states. [2019-10-06 23:31:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:06,676 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-10-06 23:31:06,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:31:06,677 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-10-06 23:31:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:06,678 INFO L225 Difference]: With dead ends: 43 [2019-10-06 23:31:06,679 INFO L226 Difference]: Without dead ends: 28 [2019-10-06 23:31:06,680 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:31:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-06 23:31:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-06 23:31:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-06 23:31:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-06 23:31:06,689 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-10-06 23:31:06,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:06,689 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-06 23:31:06,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:31:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-06 23:31:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-06 23:31:06,691 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:06,691 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:06,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:06,903 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1940789760, now seen corresponding path program 2 times [2019-10-06 23:31:06,903 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:06,904 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:06,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:06,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-06 23:31:07,042 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:07,042 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:07,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-06 23:31:07,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:31:07,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:07,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:31:07,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-06 23:31:07,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-06 23:31:07,150 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:07,152 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:31:07,152 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:07,154 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:07,154 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:07,155 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:07,205 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:08,053 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:08,062 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:08,068 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:08,068 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:08,069 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a4~0.base_BEFORE_CALL_2| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_2|) |v_main_~#a4~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:08,069 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:08,069 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a4~0.base_BEFORE_CALL_2| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_2|) |v_main_~#a4~0.offset_BEFORE_CALL_2|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:08,069 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:08,070 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:08,070 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:08,070 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:08,070 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-06 23:31:08,071 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-06 23:31:08,071 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:08,071 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:08,072 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:31:08,072 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:08,073 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a4~0.base_BEFORE_CALL_2| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_2|) |v_main_~#a4~0.offset_BEFORE_CALL_2|))))) [2019-10-06 23:31:08,073 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a4~0.base_BEFORE_CALL_2| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_2|) |v_main_~#a4~0.offset_BEFORE_CALL_2|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:08,368 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:08,369 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-06 23:31:08,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:31:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:31:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:31:08,371 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 19 states. [2019-10-06 23:31:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:09,050 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2019-10-06 23:31:09,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:31:09,051 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-10-06 23:31:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:09,052 INFO L225 Difference]: With dead ends: 64 [2019-10-06 23:31:09,052 INFO L226 Difference]: Without dead ends: 49 [2019-10-06 23:31:09,053 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:31:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-06 23:31:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2019-10-06 23:31:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-06 23:31:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-06 23:31:09,062 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 24 [2019-10-06 23:31:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:09,063 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-06 23:31:09,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:31:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-06 23:31:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-06 23:31:09,064 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:09,064 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:09,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:09,277 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:09,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2133601280, now seen corresponding path program 3 times [2019-10-06 23:31:09,278 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:09,279 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:09,280 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:09,280 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-06 23:31:09,454 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:09,454 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:09,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-06 23:31:09,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:09,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:09,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:31:09,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-06 23:31:09,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-06 23:31:09,666 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:09,668 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:31:09,668 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:09,669 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:09,669 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:09,669 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:09,704 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:10,377 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:10,389 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:10,392 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:10,393 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:10,393 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a4~0.base_BEFORE_CALL_3| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_3|) |v_main_~#a4~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:10,393 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:10,393 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a4~0.base_BEFORE_CALL_3| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_3|) |v_main_~#a4~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:10,394 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:10,394 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:10,394 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:10,394 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:10,394 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-06 23:31:10,395 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-06 23:31:10,395 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:10,396 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:10,396 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:31:10,396 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:10,397 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a4~0.base_BEFORE_CALL_3| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_3|) |v_main_~#a4~0.offset_BEFORE_CALL_3|))))) [2019-10-06 23:31:10,397 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a4~0.base_BEFORE_CALL_3| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_3|) |v_main_~#a4~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:10,738 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:10,738 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 29 [2019-10-06 23:31:10,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:31:10,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:31:10,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:31:10,740 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 29 states. [2019-10-06 23:31:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:11,889 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2019-10-06 23:31:11,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-06 23:31:11,891 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2019-10-06 23:31:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:11,893 INFO L225 Difference]: With dead ends: 88 [2019-10-06 23:31:11,893 INFO L226 Difference]: Without dead ends: 58 [2019-10-06 23:31:11,895 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=398, Invalid=2358, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:31:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-06 23:31:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-10-06 23:31:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-06 23:31:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-06 23:31:11,905 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 36 [2019-10-06 23:31:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:11,905 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-06 23:31:11,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:31:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-06 23:31:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-06 23:31:11,907 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:11,907 INFO L385 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:12,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:12,119 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1182805644, now seen corresponding path program 4 times [2019-10-06 23:31:12,120 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:12,120 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:12,121 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:12,121 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:12,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:31:12,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:12,319 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:12,319 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-06 23:31:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:12,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:31:12,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:31:12,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:31:12,644 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:12,645 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:31:12,645 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:12,646 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:12,646 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:12,646 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:12,674 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:13,358 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:13,367 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:13,370 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:13,371 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:13,371 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a4~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_4|) |v_main_~#a4~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))))) [2019-10-06 23:31:13,371 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:13,371 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a4~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_4|) |v_main_~#a4~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))))) [2019-10-06 23:31:13,372 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:13,372 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:13,372 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:13,372 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:13,372 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-06 23:31:13,373 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-06 23:31:13,373 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:13,373 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:13,377 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:31:13,377 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:13,378 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a4~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_4|) |v_main_~#a4~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:31:13,378 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a4~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_4|) |v_main_~#a4~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))))) [2019-10-06 23:31:13,703 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:13,703 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-06 23:31:13,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-06 23:31:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-06 23:31:13,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:31:13,706 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 35 states. [2019-10-06 23:31:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:14,910 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-10-06 23:31:14,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-06 23:31:14,911 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-10-06 23:31:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:14,912 INFO L225 Difference]: With dead ends: 103 [2019-10-06 23:31:14,912 INFO L226 Difference]: Without dead ends: 70 [2019-10-06 23:31:14,913 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-06 23:31:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-06 23:31:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-10-06 23:31:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-06 23:31:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-10-06 23:31:14,924 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 45 [2019-10-06 23:31:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:14,924 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-10-06 23:31:14,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-06 23:31:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-10-06 23:31:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-06 23:31:14,926 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:14,926 INFO L385 BasicCegarLoop]: trace histogram [22, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:15,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:15,130 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash 837686988, now seen corresponding path program 5 times [2019-10-06 23:31:15,131 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:15,131 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:15,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:15,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:31:15,446 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:15,446 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:15,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-06 23:31:17,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:31:17,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:17,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-06 23:31:17,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-10-06 23:31:17,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-10-06 23:31:17,676 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:17,678 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:31:17,678 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:17,679 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:17,679 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:17,679 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:17,695 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:18,329 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:18,336 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:18,339 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:18,339 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:18,340 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((v_prenex_18 Int) (|v_main_~#a4~0.base_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_5|) |v_main_~#a4~0.offset_BEFORE_CALL_5|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:18,340 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:18,340 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (exists ((v_prenex_18 Int) (|v_main_~#a4~0.base_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_5|) |v_main_~#a4~0.offset_BEFORE_CALL_5|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:18,340 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:18,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:18,340 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:18,341 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:18,341 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-06 23:31:18,341 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:31:18,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:18,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:18,341 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:31:18,342 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:18,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((v_prenex_18 Int) (|v_main_~#a4~0.base_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_5|) |v_main_~#a4~0.offset_BEFORE_CALL_5|))))) [2019-10-06 23:31:18,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (exists ((v_prenex_18 Int) (|v_main_~#a4~0.base_BEFORE_CALL_5| Int) (v_prenex_17 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_5|) |v_main_~#a4~0.offset_BEFORE_CALL_5|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:18,711 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:18,711 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 10, 11] total 53 [2019-10-06 23:31:18,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-06 23:31:18,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-06 23:31:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:31:18,714 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 53 states. [2019-10-06 23:31:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:21,692 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2019-10-06 23:31:21,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-06 23:31:21,693 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 57 [2019-10-06 23:31:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:21,695 INFO L225 Difference]: With dead ends: 131 [2019-10-06 23:31:21,695 INFO L226 Difference]: Without dead ends: 98 [2019-10-06 23:31:21,698 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2650 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1619, Invalid=8281, Unknown=0, NotChecked=0, Total=9900 [2019-10-06 23:31:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-06 23:31:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2019-10-06 23:31:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-06 23:31:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-06 23:31:21,711 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 57 [2019-10-06 23:31:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:21,711 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-06 23:31:21,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-06 23:31:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-06 23:31:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-06 23:31:21,714 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:21,714 INFO L385 BasicCegarLoop]: trace histogram [23, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:21,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:21,929 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash 411611861, now seen corresponding path program 6 times [2019-10-06 23:31:21,930 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:21,930 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:21,930 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:21,930 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-06 23:31:22,342 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:22,342 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:22,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-06 23:31:22,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:22,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:22,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-06 23:31:22,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-06 23:31:22,532 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-06 23:31:23,192 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:23,194 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:31:23,194 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:23,194 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:23,194 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:23,195 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:23,213 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:23,855 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:23,861 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:23,863 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:23,863 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:23,864 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((|v_main_~#a4~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_6|) |v_main_~#a4~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:23,864 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:23,864 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a4~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_6|) |v_main_~#a4~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:23,864 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:23,864 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:23,865 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:23,865 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:23,865 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-06 23:31:23,865 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-06 23:31:23,865 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:23,866 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:23,866 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:31:23,866 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:23,866 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((|v_main_~#a4~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_6|) |v_main_~#a4~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) [2019-10-06 23:31:23,866 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a4~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_6|) |v_main_~#a4~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:24,242 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:24,243 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-06 23:31:24,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-06 23:31:24,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-06 23:31:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-06 23:31:24,247 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 61 states. [2019-10-06 23:31:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:26,886 INFO L93 Difference]: Finished difference Result 183 states and 215 transitions. [2019-10-06 23:31:26,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-06 23:31:26,886 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 85 [2019-10-06 23:31:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:26,888 INFO L225 Difference]: With dead ends: 183 [2019-10-06 23:31:26,888 INFO L226 Difference]: Without dead ends: 123 [2019-10-06 23:31:26,892 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-06 23:31:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-06 23:31:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2019-10-06 23:31:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-06 23:31:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2019-10-06 23:31:26,908 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 85 [2019-10-06 23:31:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:26,908 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2019-10-06 23:31:26,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-06 23:31:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2019-10-06 23:31:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-06 23:31:26,910 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:26,910 INFO L385 BasicCegarLoop]: trace histogram [48, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:27,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:27,122 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1045443264, now seen corresponding path program 7 times [2019-10-06 23:31:27,122 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:27,122 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:27,122 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:27,122 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-06 23:31:28,337 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:28,337 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:28,338 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-06 23:31:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:28,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-06 23:31:28,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-06 23:31:28,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-06 23:31:31,218 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:31,219 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:31:31,220 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:31,220 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:31,220 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:31,220 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:31,257 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:31,897 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:31,904 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:31,906 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:31,906 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:31,907 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((|v_main_~#a4~0.base_BEFORE_CALL_7| Int) (v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_7|) |v_main_~#a4~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_26) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:31,907 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:31,907 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a4~0.base_BEFORE_CALL_7| Int) (v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_7|) |v_main_~#a4~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_26) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:31,907 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:31,907 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:31,907 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:31,907 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:31,908 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-06 23:31:31,908 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-06 23:31:31,908 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:31,908 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:31,908 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:31:31,908 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:31,908 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((|v_main_~#a4~0.base_BEFORE_CALL_7| Int) (v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_7|) |v_main_~#a4~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_26) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) [2019-10-06 23:31:31,909 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a4~0.base_BEFORE_CALL_7| Int) (v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_7|) |v_main_~#a4~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_26) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:32,404 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:32,405 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 111 [2019-10-06 23:31:32,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-06 23:31:32,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-06 23:31:32,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7131, Unknown=0, NotChecked=0, Total=12210 [2019-10-06 23:31:32,411 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 111 states. [2019-10-06 23:31:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:39,939 INFO L93 Difference]: Finished difference Result 233 states and 290 transitions. [2019-10-06 23:31:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-06 23:31:39,939 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2019-10-06 23:31:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:39,942 INFO L225 Difference]: With dead ends: 233 [2019-10-06 23:31:39,942 INFO L226 Difference]: Without dead ends: 173 [2019-10-06 23:31:39,947 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9104 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15032, Invalid=31408, Unknown=0, NotChecked=0, Total=46440 [2019-10-06 23:31:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-06 23:31:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2019-10-06 23:31:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-06 23:31:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2019-10-06 23:31:39,965 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 110 [2019-10-06 23:31:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:39,966 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2019-10-06 23:31:39,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-06 23:31:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2019-10-06 23:31:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-06 23:31:39,969 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:39,969 INFO L385 BasicCegarLoop]: trace histogram [98, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:40,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:40,173 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:40,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:40,174 INFO L82 PathProgramCache]: Analyzing trace with hash -475860896, now seen corresponding path program 8 times [2019-10-06 23:31:40,174 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:40,174 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:40,174 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:40,175 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5259 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-06 23:31:44,009 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:44,010 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:44,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:36:02,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-06 23:36:02,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:36:02,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-06 23:36:02,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:36:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5259 backedges. 114 proven. 136 refuted. 0 times theorem prover too weak. 5009 trivial. 0 not checked. [2019-10-06 23:36:03,109 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:36:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5259 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 5123 trivial. 0 not checked. [2019-10-06 23:36:04,154 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:36:04,155 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:36:04,155 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:36:04,156 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:36:04,156 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:36:04,156 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:36:04,192 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:36:04,856 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:36:04,862 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:36:04,864 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:36:04,865 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:36:04,865 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a4~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_32) v_prenex_30) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_8|) |v_main_~#a4~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:36:04,865 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:36:04,865 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a4~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_32) v_prenex_30) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_8|) |v_main_~#a4~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:36:04,866 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:04,866 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:36:04,866 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:04,866 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:36:04,866 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-06 23:36:04,866 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-06 23:36:04,866 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:36:04,867 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:36:04,867 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:36:04,867 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:04,867 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a4~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_32) v_prenex_30) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_8|) |v_main_~#a4~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) [2019-10-06 23:36:04,867 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a4~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_32) v_prenex_30) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_8|) |v_main_~#a4~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:36:05,673 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:36:05,674 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 21, 19, 11] total 147 [2019-10-06 23:36:05,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-10-06 23:36:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-10-06 23:36:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5845, Invalid=15617, Unknown=0, NotChecked=0, Total=21462 [2019-10-06 23:36:05,679 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand 147 states. [2019-10-06 23:36:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:36:19,934 INFO L93 Difference]: Finished difference Result 288 states and 350 transitions. [2019-10-06 23:36:19,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-10-06 23:36:19,935 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 160 [2019-10-06 23:36:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:36:19,938 INFO L225 Difference]: With dead ends: 288 [2019-10-06 23:36:19,938 INFO L226 Difference]: Without dead ends: 228 [2019-10-06 23:36:19,941 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19248 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=17682, Invalid=65550, Unknown=0, NotChecked=0, Total=83232 [2019-10-06 23:36:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-06 23:36:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2019-10-06 23:36:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-06 23:36:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2019-10-06 23:36:19,964 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 160 [2019-10-06 23:36:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:36:19,964 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2019-10-06 23:36:19,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-10-06 23:36:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2019-10-06 23:36:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-06 23:36:19,968 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:36:19,969 INFO L385 BasicCegarLoop]: trace histogram [99, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:36:20,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:36:20,183 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:36:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:36:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2082052523, now seen corresponding path program 9 times [2019-10-06 23:36:20,184 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:36:20,184 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:36:20,184 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:36:20,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:36:20,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:36:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:36:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6735 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-10-06 23:36:24,273 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:36:24,273 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:36:24,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:36:24,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:36:24,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:36:24,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-06 23:36:24,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:36:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6735 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-10-06 23:36:24,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:36:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6735 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-10-06 23:36:35,839 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:36:35,841 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:36:35,841 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:36:35,841 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:36:35,841 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:36:35,841 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:36:35,856 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:36:36,489 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:36:36,495 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:36:36,497 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:36:36,497 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:36:36,497 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a4~0.base_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_34) (select (select |#memory_int| v_prenex_36) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_9|) |v_main_~#a4~0.offset_BEFORE_CALL_9|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:36:36,497 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:36:36,497 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a4~0.base_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_34) (select (select |#memory_int| v_prenex_36) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_9|) |v_main_~#a4~0.offset_BEFORE_CALL_9|))))) (<= __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-06 23:36:36,498 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:36,498 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:36:36,498 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:36,498 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:36:36,498 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-06 23:36:36,499 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-06 23:36:36,499 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:36:36,499 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:36:36,499 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:36:36,499 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:36,500 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a4~0.base_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_34) (select (select |#memory_int| v_prenex_36) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_9|) |v_main_~#a4~0.offset_BEFORE_CALL_9|))))) [2019-10-06 23:36:36,500 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a4~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a4~0.base_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_34) (select (select |#memory_int| v_prenex_36) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_9|) |v_main_~#a4~0.offset_BEFORE_CALL_9|))))) (<= __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-06 23:36:37,277 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:36:37,277 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102, 11] total 213 [2019-10-06 23:36:37,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 213 states [2019-10-06 23:36:37,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2019-10-06 23:36:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20532, Invalid=24624, Unknown=0, NotChecked=0, Total=45156 [2019-10-06 23:36:37,285 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 213 states. [2019-10-06 23:37:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:37:04,090 INFO L93 Difference]: Finished difference Result 443 states and 551 transitions. [2019-10-06 23:37:04,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-10-06 23:37:04,095 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 215 [2019-10-06 23:37:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:37:04,097 INFO L225 Difference]: With dead ends: 443 [2019-10-06 23:37:04,097 INFO L226 Difference]: Without dead ends: 329 [2019-10-06 23:37:04,105 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31289 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=61187, Invalid=114793, Unknown=0, NotChecked=0, Total=175980 [2019-10-06 23:37:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-10-06 23:37:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 320. [2019-10-06 23:37:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-06 23:37:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 324 transitions. [2019-10-06 23:37:04,143 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 324 transitions. Word has length 215 [2019-10-06 23:37:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:37:04,145 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 324 transitions. [2019-10-06 23:37:04,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 213 states. [2019-10-06 23:37:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 324 transitions. [2019-10-06 23:37:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-06 23:37:04,151 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:37:04,151 INFO L385 BasicCegarLoop]: trace histogram [200, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:37:04,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:04,356 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:37:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:37:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash 370371392, now seen corresponding path program 10 times [2019-10-06 23:37:04,357 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:37:04,358 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:04,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:04,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:37:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21885 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-10-06 23:37:19,657 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:19,657 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:37:19,657 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:20,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 202 conjunts are in the unsatisfiable core [2019-10-06 23:37:20,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:37:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21885 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-10-06 23:37:20,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:38:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21885 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-10-06 23:38:05,222 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:38:05,223 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:38:05,224 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:38:05,224 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:38:05,224 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:38:05,224 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:38:05,245 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:38:05,944 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:38:05,954 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:38:05,956 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:38:05,956 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:38:05,957 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 221#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a4~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_10|) |v_main_~#a4~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:05,957 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 206#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:05,957 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 226#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a4~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_10|) |v_main_~#a4~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:05,957 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:05,957 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 235#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:38:05,957 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:05,957 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 211#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a4~0.base|) (+ (* 4 main_~x~0) |main_~#a4~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:05,957 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-06 23:38:05,957 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-06 23:38:05,957 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 240#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:38:05,958 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:38:05,958 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 72#true [2019-10-06 23:38:05,958 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:05,958 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 216#(exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a4~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_10|) |v_main_~#a4~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) [2019-10-06 23:38:05,958 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 231#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a4~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a4~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a4~0.base_BEFORE_CALL_10|) |v_main_~#a4~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:07,281 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:38:07,281 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [203, 203, 203, 11] total 415 [2019-10-06 23:38:07,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 415 states [2019-10-06 23:38:07,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 415 interpolants. [2019-10-06 23:38:07,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81839, Invalid=89971, Unknown=0, NotChecked=0, Total=171810 [2019-10-06 23:38:07,293 INFO L87 Difference]: Start difference. First operand 320 states and 324 transitions. Second operand 415 states. [2019-10-06 23:39:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:39:46,611 INFO L93 Difference]: Finished difference Result 645 states and 854 transitions. [2019-10-06 23:39:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 414 states. [2019-10-06 23:39:46,611 INFO L78 Accepts]: Start accepts. Automaton has 415 states. Word has length 316 [2019-10-06 23:39:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:39:46,614 INFO L225 Difference]: With dead ends: 645 [2019-10-06 23:39:46,614 INFO L226 Difference]: Without dead ends: 531 [2019-10-06 23:39:46,627 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1560 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 822 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113604 ImplicationChecksByTransitivity, 153.5s TimeCoverageRelationStatistics Valid=244704, Invalid=433448, Unknown=0, NotChecked=0, Total=678152 [2019-10-06 23:39:46,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-06 23:39:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 522. [2019-10-06 23:39:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-10-06 23:39:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 526 transitions. [2019-10-06 23:39:46,654 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 526 transitions. Word has length 316 [2019-10-06 23:39:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:39:46,654 INFO L462 AbstractCegarLoop]: Abstraction has 522 states and 526 transitions. [2019-10-06 23:39:46,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 415 states. [2019-10-06 23:39:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 526 transitions. [2019-10-06 23:39:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2019-10-06 23:39:46,667 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:39:46,667 INFO L385 BasicCegarLoop]: trace histogram [402, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:39:46,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:39:46,877 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:39:46,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:39:46,877 INFO L82 PathProgramCache]: Analyzing trace with hash 73406560, now seen corresponding path program 11 times [2019-10-06 23:39:46,877 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:39:46,877 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:39:46,877 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:39:46,877 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:39:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:39:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 82788 backedges. 0 proven. 81003 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-10-06 23:40:47,135 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:47,135 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:47,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true