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_copy8_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:43:03,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:43:03,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:43:03,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:43:03,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:43:03,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:43:03,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:43:03,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:43:03,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:43:03,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:43:03,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:43:03,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:43:03,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:43:03,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:43:03,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:43:03,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:43:03,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:43:03,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:43:03,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:43:03,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:43:03,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:43:03,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:43:03,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:43:03,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:43:03,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:43:03,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:43:03,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:43:03,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:43:03,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:43:03,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:43:03,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:43:03,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:43:03,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:43:03,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:43:03,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:43:03,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:43:03,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:43:03,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:43:03,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:43:03,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:43:03,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:43:03,456 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:43:03,470 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:43:03,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:43:03,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:43:03,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:43:03,472 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:43:03,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:43:03,472 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:43:03,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:43:03,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:43:03,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:43:03,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:43:03,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:43:03,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:43:03,474 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:43:03,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:43:03,474 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:43:03,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:43:03,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:43:03,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:43:03,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:43:03,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:43:03,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:43:03,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:43:03,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:43:03,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:43:03,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:43:03,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:43:03,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:43:03,477 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:43:03,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:43:03,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:43:03,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:43:03,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:43:03,781 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:43:03,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy8_ground-1.i [2019-10-06 23:43:03,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3902cd96c/29be773a3e4f41a6905f8569a63c1942/FLAGc782d8beb [2019-10-06 23:43:04,279 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:43:04,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy8_ground-1.i [2019-10-06 23:43:04,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3902cd96c/29be773a3e4f41a6905f8569a63c1942/FLAGc782d8beb [2019-10-06 23:43:04,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3902cd96c/29be773a3e4f41a6905f8569a63c1942 [2019-10-06 23:43:04,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:43:04,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:43:04,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:43:04,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:43:04,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:43:04,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:43:04" (1/1) ... [2019-10-06 23:43:04,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a023e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:04, skipping insertion in model container [2019-10-06 23:43:04,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:43:04" (1/1) ... [2019-10-06 23:43:04,725 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:43:04,744 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:43:04,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:43:04,954 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:43:04,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:43:05,091 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:43:05,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05 WrapperNode [2019-10-06 23:43:05,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:43:05,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:43:05,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:43:05,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:43:05,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05" (1/1) ... [2019-10-06 23:43:05,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05" (1/1) ... [2019-10-06 23:43:05,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05" (1/1) ... [2019-10-06 23:43:05,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05" (1/1) ... [2019-10-06 23:43:05,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05" (1/1) ... [2019-10-06 23:43:05,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05" (1/1) ... [2019-10-06 23:43:05,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05" (1/1) ... [2019-10-06 23:43:05,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:43:05,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:43:05,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:43:05,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:43:05,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05" (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:43:05,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:43:05,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:43:05,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:43:05,210 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:43:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:43:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:43:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:43:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:43:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:43:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:43:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:43:05,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:43:05,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:43:05,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:43:05,821 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:43:05,821 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-06 23:43:05,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:43:05 BoogieIcfgContainer [2019-10-06 23:43:05,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:43:05,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:43:05,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:43:05,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:43:05,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:43:04" (1/3) ... [2019-10-06 23:43:05,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d8d5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:43:05, skipping insertion in model container [2019-10-06 23:43:05,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:05" (2/3) ... [2019-10-06 23:43:05,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d8d5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:43:05, skipping insertion in model container [2019-10-06 23:43:05,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:43:05" (3/3) ... [2019-10-06 23:43:05,832 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy8_ground-1.i [2019-10-06 23:43:05,842 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:43:05,851 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:43:05,863 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:43:05,890 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:43:05,890 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:43:05,890 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:43:05,890 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:43:05,891 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:43:05,891 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:43:05,891 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:43:05,891 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:43:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-06 23:43:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-06 23:43:05,918 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:05,919 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:05,921 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:05,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:05,927 INFO L82 PathProgramCache]: Analyzing trace with hash 585848073, now seen corresponding path program 1 times [2019-10-06 23:43:05,937 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:05,937 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:05,938 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:05,938 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:06,128 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:43:06,129 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:06,130 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:43:06,130 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:43:06,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:43:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:43:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:43:06,152 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2019-10-06 23:43:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:06,188 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-10-06 23:43:06,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:43:06,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-06 23:43:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:06,198 INFO L225 Difference]: With dead ends: 47 [2019-10-06 23:43:06,199 INFO L226 Difference]: Without dead ends: 24 [2019-10-06 23:43:06,202 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:43:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-06 23:43:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-06 23:43:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-06 23:43:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-06 23:43:06,242 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 19 [2019-10-06 23:43:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:06,242 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-06 23:43:06,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:43:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-10-06 23:43:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:43:06,244 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:06,244 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:06,245 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:06,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1643282624, now seen corresponding path program 1 times [2019-10-06 23:43:06,246 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:06,246 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:06,246 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:06,246 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:06,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:06,310 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:43:06,311 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:06,311 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:43:06,312 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:43:06,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:43:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:43:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:43:06,314 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 3 states. [2019-10-06 23:43:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:06,376 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2019-10-06 23:43:06,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:43:06,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-06 23:43:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:06,378 INFO L225 Difference]: With dead ends: 48 [2019-10-06 23:43:06,378 INFO L226 Difference]: Without dead ends: 32 [2019-10-06 23:43:06,379 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:43:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-06 23:43:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-06 23:43:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-06 23:43:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-10-06 23:43:06,387 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 20 [2019-10-06 23:43:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:06,388 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-10-06 23:43:06,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:43:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2019-10-06 23:43:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-06 23:43:06,389 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:06,390 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:06,390 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash 96487886, now seen corresponding path program 1 times [2019-10-06 23:43:06,391 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:06,391 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:06,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:06,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:43:06,519 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:06,520 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:06,520 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:43:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:06,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:43:06,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:43:06,680 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:43:06,731 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:06,787 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:06,787 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:06,804 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:06,812 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:06,814 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:06,966 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:08,542 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:43:09,356 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:09,381 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:09,388 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:09,388 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:09,389 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:09,389 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:09,389 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:09,390 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:43:09,390 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:09,390 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:09,391 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:43:09,391 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:09,391 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:09,391 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:09,392 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:43:09,394 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:43:09,396 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:43:09,396 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:09,397 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:09,399 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:09,399 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) [2019-10-06 23:43:09,400 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:09,400 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:43:09,400 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:09,697 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:09,698 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:43:09,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:43:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:43:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:43:09,704 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 17 states. [2019-10-06 23:43:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:10,376 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2019-10-06 23:43:10,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:43:10,377 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-10-06 23:43:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:10,378 INFO L225 Difference]: With dead ends: 69 [2019-10-06 23:43:10,378 INFO L226 Difference]: Without dead ends: 44 [2019-10-06 23:43:10,379 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:43:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-06 23:43:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2019-10-06 23:43:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-06 23:43:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2019-10-06 23:43:10,387 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 28 [2019-10-06 23:43:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:10,388 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-10-06 23:43:10,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:43:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2019-10-06 23:43:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-06 23:43:10,389 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:10,389 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:10,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:10,594 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:10,595 INFO L82 PathProgramCache]: Analyzing trace with hash 775928535, now seen corresponding path program 2 times [2019-10-06 23:43:10,595 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:10,596 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:10,596 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:10,596 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:43:10,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:10,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:10,714 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:43:10,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:43:10,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:43:10,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:43:10,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-06 23:43:10,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-06 23:43:10,842 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:10,846 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:10,846 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:10,847 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:10,847 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:10,848 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:10,877 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:12,621 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:12,628 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:12,631 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:12,631 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:12,631 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:12,632 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:12,632 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:12,632 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:43:12,632 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:12,632 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:12,633 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:43:12,633 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:12,633 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:12,633 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:12,633 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:43:12,634 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:43:12,634 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:43:12,634 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:12,634 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:12,634 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:12,635 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) [2019-10-06 23:43:12,635 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:12,635 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:43:12,635 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:12,940 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:12,940 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-06 23:43:12,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-06 23:43:12,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-06 23:43:12,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-06 23:43:12,943 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand 21 states. [2019-10-06 23:43:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:14,057 INFO L93 Difference]: Finished difference Result 94 states and 136 transitions. [2019-10-06 23:43:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:43:14,064 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-10-06 23:43:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:14,065 INFO L225 Difference]: With dead ends: 94 [2019-10-06 23:43:14,065 INFO L226 Difference]: Without dead ends: 69 [2019-10-06 23:43:14,066 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:43:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-06 23:43:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-10-06 23:43:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-06 23:43:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-10-06 23:43:14,078 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 31 [2019-10-06 23:43:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:14,078 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-10-06 23:43:14,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-06 23:43:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-10-06 23:43:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-06 23:43:14,080 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:14,080 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:14,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:14,293 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:14,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1900554752, now seen corresponding path program 3 times [2019-10-06 23:43:14,295 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:14,295 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:14,295 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:14,295 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:43:14,422 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:14,422 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:14,422 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:43:14,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:43:14,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:43:14,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:43:14,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:43:14,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:43:14,645 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:14,647 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:14,647 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:14,648 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:14,648 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:14,648 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:14,665 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:16,399 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:16,409 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:16,411 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:16,412 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:16,412 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| 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_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:16,412 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:16,412 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| 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_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 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:43:16,413 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:43:16,413 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:16,413 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:16,413 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:43:16,413 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:16,415 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:16,415 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:16,415 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:43:16,415 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:43:16,415 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:43:16,416 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:16,416 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:16,416 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:16,416 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| 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_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) [2019-10-06 23:43:16,416 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| 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_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 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:43:16,417 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:43:16,417 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:16,752 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:16,753 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-06 23:43:16,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:43:16,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:43:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:43:16,756 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 25 states. [2019-10-06 23:43:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:17,708 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2019-10-06 23:43:17,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:43:17,709 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2019-10-06 23:43:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:17,710 INFO L225 Difference]: With dead ends: 125 [2019-10-06 23:43:17,710 INFO L226 Difference]: Without dead ends: 76 [2019-10-06 23:43:17,713 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-06 23:43:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-06 23:43:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2019-10-06 23:43:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-06 23:43:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-10-06 23:43:17,726 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 56 [2019-10-06 23:43:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:17,726 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-10-06 23:43:17,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:43:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-10-06 23:43:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-06 23:43:17,729 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:17,729 INFO L385 BasicCegarLoop]: trace histogram [12, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:17,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:17,942 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1715267255, now seen corresponding path program 4 times [2019-10-06 23:43:17,943 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:17,943 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:17,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:17,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:43:18,147 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:18,147 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:18,147 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:43:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:18,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:43:18,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:43:18,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:43:18,541 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:18,543 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:18,543 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:18,543 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:18,544 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:18,544 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:18,569 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:19,061 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:43:19,881 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:43:20,287 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:20,293 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:20,296 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:20,296 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:20,296 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:20,296 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:20,296 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (<= 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:43:20,296 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:43:20,297 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:20,297 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:20,297 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:43:20,297 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:20,297 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:20,297 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:20,298 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:43:20,298 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:43:20,298 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:43:20,298 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:20,298 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:20,298 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:20,298 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:43:20,298 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (<= 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:43:20,299 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:43:20,299 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:20,612 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:20,612 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-06 23:43:20,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-06 23:43:20,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-06 23:43:20,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:43:20,614 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 39 states. [2019-10-06 23:43:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:22,001 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2019-10-06 23:43:22,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:43:22,002 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 63 [2019-10-06 23:43:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:22,004 INFO L225 Difference]: With dead ends: 139 [2019-10-06 23:43:22,004 INFO L226 Difference]: Without dead ends: 90 [2019-10-06 23:43:22,007 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-06 23:43:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-06 23:43:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-10-06 23:43:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-06 23:43:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-06 23:43:22,020 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 63 [2019-10-06 23:43:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:22,020 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-06 23:43:22,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-06 23:43:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-06 23:43:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-06 23:43:22,022 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:22,022 INFO L385 BasicCegarLoop]: trace histogram [26, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:22,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:22,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash -287239831, now seen corresponding path program 5 times [2019-10-06 23:43:22,228 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:22,228 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:22,228 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:22,228 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:43:22,708 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:22,708 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:22,708 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:43:22,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:43:22,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:43:22,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:43:22,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-06 23:43:23,074 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-06 23:43:23,235 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:23,236 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:23,237 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:23,237 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:23,237 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:23,238 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:23,254 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:23,878 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:43:24,338 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:24,990 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:25,020 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:25,023 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:25,023 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:25,023 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:25,023 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:25,023 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:25,024 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:43:25,024 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:25,024 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:25,024 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:43:25,024 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:25,024 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:25,024 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:25,025 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:43:25,025 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:43:25,025 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:43:25,025 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:25,025 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:25,025 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:25,026 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) [2019-10-06 23:43:25,026 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:25,026 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:43:25,026 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:25,554 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:25,554 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 7, 7, 11] total 49 [2019-10-06 23:43:25,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-06 23:43:25,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-06 23:43:25,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1852, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:43:25,558 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 49 states. [2019-10-06 23:43:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:28,407 INFO L93 Difference]: Finished difference Result 188 states and 254 transitions. [2019-10-06 23:43:28,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-06 23:43:28,408 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 77 [2019-10-06 23:43:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:28,410 INFO L225 Difference]: With dead ends: 188 [2019-10-06 23:43:28,410 INFO L226 Difference]: Without dead ends: 139 [2019-10-06 23:43:28,413 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1514, Invalid=7042, Unknown=0, NotChecked=0, Total=8556 [2019-10-06 23:43:28,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-06 23:43:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2019-10-06 23:43:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-06 23:43:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2019-10-06 23:43:28,431 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 77 [2019-10-06 23:43:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:28,432 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2019-10-06 23:43:28,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-06 23:43:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2019-10-06 23:43:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-06 23:43:28,434 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:28,434 INFO L385 BasicCegarLoop]: trace histogram [27, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:28,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:28,637 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:28,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:28,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1922841824, now seen corresponding path program 6 times [2019-10-06 23:43:28,638 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:28,638 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:28,638 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:28,639 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-06 23:43:29,365 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:29,365 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:29,365 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:43:29,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:43:29,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:43:29,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:43:29,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-06 23:43:29,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-06 23:43:30,556 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:30,561 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:30,562 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:30,562 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:30,563 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:30,563 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:30,586 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:32,237 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:32,244 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:32,246 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:32,247 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:32,247 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| 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| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:32,247 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,247 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| 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| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:32,247 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:43:32,248 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:32,248 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,248 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:43:32,248 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,248 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,249 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,249 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:43:32,249 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:43:32,249 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:43:32,249 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:32,249 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,250 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,250 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| 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| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) [2019-10-06 23:43:32,250 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| 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| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:32,250 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:43:32,251 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,642 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:32,642 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-06 23:43:32,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-06 23:43:32,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-06 23:43:32,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:43:32,647 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 69 states. [2019-10-06 23:43:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:35,991 INFO L93 Difference]: Finished difference Result 265 states and 311 transitions. [2019-10-06 23:43:35,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-06 23:43:35,992 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 126 [2019-10-06 23:43:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:35,994 INFO L225 Difference]: With dead ends: 265 [2019-10-06 23:43:35,994 INFO L226 Difference]: Without dead ends: 168 [2019-10-06 23:43:36,000 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-06 23:43:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-06 23:43:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-10-06 23:43:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-06 23:43:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2019-10-06 23:43:36,019 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 126 [2019-10-06 23:43:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:36,020 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2019-10-06 23:43:36,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-06 23:43:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2019-10-06 23:43:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-06 23:43:36,022 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:36,023 INFO L385 BasicCegarLoop]: trace histogram [56, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:36,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:36,228 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:36,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1620511479, now seen corresponding path program 7 times [2019-10-06 23:43:36,229 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:36,229 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:36,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:36,230 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:36,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-06 23:43:37,626 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:37,626 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:37,626 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:43:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:37,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:43:37,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-06 23:43:37,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-06 23:43:41,520 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:41,521 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:41,521 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:41,522 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:41,522 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:41,522 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:41,537 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:43,236 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:43,241 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:43,244 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:43,244 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:43,244 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:43,245 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:43,245 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (<= __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:43:43,245 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:43:43,245 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:43,245 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:43,246 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:43:43,246 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:43,246 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:43,246 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:43,246 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:43,246 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:43,247 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:43:43,247 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:43,247 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:43,247 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:43,247 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) [2019-10-06 23:43:43,248 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (<= __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:43:43,248 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:43:43,248 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:43,927 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:43,928 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-06 23:43:43,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-06 23:43:43,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-06 23:43:43,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-06 23:43:43,936 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand 127 states. [2019-10-06 23:43:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:54,023 INFO L93 Difference]: Finished difference Result 323 states and 398 transitions. [2019-10-06 23:43:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:43:54,024 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 155 [2019-10-06 23:43:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:54,026 INFO L225 Difference]: With dead ends: 323 [2019-10-06 23:43:54,027 INFO L226 Difference]: Without dead ends: 226 [2019-10-06 23:43:54,032 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:43:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-06 23:43:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2019-10-06 23:43:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-06 23:43:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 226 transitions. [2019-10-06 23:43:54,056 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 226 transitions. Word has length 155 [2019-10-06 23:43:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:54,056 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 226 transitions. [2019-10-06 23:43:54,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-06 23:43:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 226 transitions. [2019-10-06 23:43:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-06 23:43:54,060 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:54,060 INFO L385 BasicCegarLoop]: trace histogram [114, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:54,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:54,270 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:54,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1691141015, now seen corresponding path program 8 times [2019-10-06 23:43:54,271 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:54,271 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:54,271 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:54,271 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:54,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-06 23:43:59,329 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:59,329 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:59,330 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:45:21,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-06 23:45:21,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:45:21,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-06 23:45:21,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:45:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 124 proven. 55 refuted. 0 times theorem prover too weak. 6816 trivial. 0 not checked. [2019-10-06 23:45:22,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:45:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6940 trivial. 0 not checked. [2019-10-06 23:45:23,112 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:45:23,113 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:45:23,113 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:45:23,114 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:45:23,114 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:45:23,114 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:45:23,150 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:45:23,897 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:45:24,125 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:45:24,978 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:45:24,985 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:45:24,990 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:45:24,991 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:45:24,991 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(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_~#a9~0.base_BEFORE_CALL_8| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_8|) |v_main_~#a9~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:45:24,991 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:45:24,991 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (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_~#a9~0.base_BEFORE_CALL_8| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_8|) |v_main_~#a9~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) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:45:24,992 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:45:24,992 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:45:24,992 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:45:24,992 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:45:24,992 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:45:24,992 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:45:24,993 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:45:24,993 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:45:24,993 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:45:24,993 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:45:24,993 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:45:24,993 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:45:24,994 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(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_~#a9~0.base_BEFORE_CALL_8| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_8|) |v_main_~#a9~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:45:24,994 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:45:24,994 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (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_~#a9~0.base_BEFORE_CALL_8| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_8|) |v_main_~#a9~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) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:45:24,994 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:45:24,994 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:45:25,906 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:45:25,907 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 15, 13, 11] total 151 [2019-10-06 23:45:25,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-10-06 23:45:25,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-10-06 23:45:25,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7231, Invalid=15419, Unknown=0, NotChecked=0, Total=22650 [2019-10-06 23:45:25,911 INFO L87 Difference]: Start difference. First operand 217 states and 226 transitions. Second operand 151 states. [2019-10-06 23:45:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:45:42,578 INFO L93 Difference]: Finished difference Result 420 states and 534 transitions. [2019-10-06 23:45:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-10-06 23:45:42,579 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 213 [2019-10-06 23:45:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:45:42,583 INFO L225 Difference]: With dead ends: 420 [2019-10-06 23:45:42,583 INFO L226 Difference]: Without dead ends: 323 [2019-10-06 23:45:42,586 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17908 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=21758, Invalid=65562, Unknown=0, NotChecked=0, Total=87320 [2019-10-06 23:45:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-06 23:45:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 314. [2019-10-06 23:45:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-06 23:45:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 323 transitions. [2019-10-06 23:45:42,617 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 323 transitions. Word has length 213 [2019-10-06 23:45:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:45:42,617 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 323 transitions. [2019-10-06 23:45:42,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-10-06 23:45:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 323 transitions. [2019-10-06 23:45:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-06 23:45:42,623 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:45:42,624 INFO L385 BasicCegarLoop]: trace histogram [115, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:45:42,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:45:42,838 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:45:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:45:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1190263968, now seen corresponding path program 9 times [2019-10-06 23:45:42,839 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:45:42,839 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:45:42,840 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:45:42,840 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:45:42,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:45:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:45:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8694 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-10-06 23:45:48,446 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:45:48,446 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:45:48,446 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:45:48,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:45:48,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:45:48,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:45:48,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:45:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8694 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-10-06 23:45:49,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:46:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8694 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-10-06 23:46:04,219 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:46:04,222 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:46:04,222 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:46:04,223 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:46:04,223 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:46:04,223 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:46:04,242 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:46:04,889 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:46:05,333 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:46:05,907 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:46:05,914 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:46:05,917 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:46:05,917 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:46:05,917 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(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_~#a9~0.base_BEFORE_CALL_9| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_9|) |v_main_~#a9~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:05,917 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:05,918 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (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_~#a9~0.base_BEFORE_CALL_9| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_9|) |v_main_~#a9~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:05,918 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:46:05,918 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:46:05,918 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:05,918 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:46:05,918 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:05,919 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:05,919 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:05,919 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:46:05,919 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:46:05,919 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:46:05,919 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:46:05,920 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:05,920 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(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_~#a9~0.base_BEFORE_CALL_9| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_9|) |v_main_~#a9~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|)))))) [2019-10-06 23:46:05,920 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:05,920 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (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_~#a9~0.base_BEFORE_CALL_9| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_9|) |v_main_~#a9~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:05,920 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:46:05,921 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:06,767 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:46:06,768 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-06 23:46:06,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-06 23:46:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-06 23:46:06,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-06 23:46:06,775 INFO L87 Difference]: Start difference. First operand 314 states and 323 transitions. Second operand 245 states. [2019-10-06 23:46:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:46:42,111 INFO L93 Difference]: Finished difference Result 633 states and 767 transitions. [2019-10-06 23:46:42,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-06 23:46:42,112 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 310 [2019-10-06 23:46:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:46:42,118 INFO L225 Difference]: With dead ends: 633 [2019-10-06 23:46:42,118 INFO L226 Difference]: Without dead ends: 440 [2019-10-06 23:46:42,122 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1287 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-06 23:46:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-10-06 23:46:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 431. [2019-10-06 23:46:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-10-06 23:46:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 440 transitions. [2019-10-06 23:46:42,150 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 440 transitions. Word has length 310 [2019-10-06 23:46:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:46:42,150 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 440 transitions. [2019-10-06 23:46:42,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-06 23:46:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 440 transitions. [2019-10-06 23:46:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-10-06 23:46:42,159 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:46:42,159 INFO L385 BasicCegarLoop]: trace histogram [232, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:46:42,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:46:42,367 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:46:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:46:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1467081975, now seen corresponding path program 10 times [2019-10-06 23:46:42,368 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:46:42,369 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:46:42,369 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:46:42,369 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:46:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:46:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:47:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 29052 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-10-06 23:47:02,831 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:47:02,831 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:47:02,831 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:47:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:47:03,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 2221 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:47:03,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:47:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 29052 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-10-06 23:47:03,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 29052 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-10-06 23:48:04,329 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:04,331 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:48:04,331 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:04,331 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:04,332 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:04,332 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:04,365 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:05,380 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:48:06,008 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:48:06,012 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:06,015 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:06,015 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:06,016 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a9~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_10|) |v_main_~#a9~0.offset_BEFORE_CALL_10|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_38) v_prenex_37) (select (select |#memory_int| v_prenex_39) v_prenex_40)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:48:06,016 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:06,016 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a9~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_10|) |v_main_~#a9~0.offset_BEFORE_CALL_10|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_38) v_prenex_37) (select (select |#memory_int| v_prenex_39) v_prenex_40)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:48:06,016 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-06 23:48:06,016 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:06,017 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:06,017 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:48:06,017 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:06,017 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:06,017 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:06,017 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:48:06,018 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:48:06,018 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:48:06,018 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:06,018 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:06,018 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a9~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_10|) |v_main_~#a9~0.offset_BEFORE_CALL_10|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_38) v_prenex_37) (select (select |#memory_int| v_prenex_39) v_prenex_40)))))) [2019-10-06 23:48:06,018 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:06,018 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a9~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_10|) |v_main_~#a9~0.offset_BEFORE_CALL_10|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_38) v_prenex_37) (select (select |#memory_int| v_prenex_39) v_prenex_40)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:48:06,019 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:48:06,019 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:07,622 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:07,623 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-06 23:48:07,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-06 23:48:07,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-06 23:48:07,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-06 23:48:07,646 INFO L87 Difference]: Start difference. First operand 431 states and 440 transitions. Second operand 479 states. [2019-10-06 23:50:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:50:23,839 INFO L93 Difference]: Finished difference Result 867 states and 1118 transitions. [2019-10-06 23:50:23,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-06 23:50:23,840 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 427 [2019-10-06 23:50:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:50:23,844 INFO L225 Difference]: With dead ends: 867 [2019-10-06 23:50:23,845 INFO L226 Difference]: Without dead ends: 674 [2019-10-06 23:50:23,861 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1989 GetRequests, 1039 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 207.5s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-06 23:50:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-10-06 23:50:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 665. [2019-10-06 23:50:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-10-06 23:50:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 674 transitions. [2019-10-06 23:50:23,898 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 674 transitions. Word has length 427 [2019-10-06 23:50:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:50:23,899 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 674 transitions. [2019-10-06 23:50:23,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-06 23:50:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 674 transitions. [2019-10-06 23:50:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-10-06 23:50:23,905 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:50:23,906 INFO L385 BasicCegarLoop]: trace histogram [466, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:50:24,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:50:24,113 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:50:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:50:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1677188969, now seen corresponding path program 11 times [2019-10-06 23:50:24,114 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:50:24,114 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:50:24,114 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:50:24,114 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:50:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:50:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:51:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 110835 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-10-06 23:51:45,488 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:51:45,488 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:51:45,488 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