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/sanfoundry_10_ground.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:37,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:37,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:37,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:37,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:37,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:37,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:37,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:37,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:37,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:37,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:37,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:37,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:37,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:37,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:37,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:37,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:37,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:37,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:37,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:37,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:37,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:37,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:37,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:37,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:37,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:37,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:37,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:37,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:37,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:37,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:37,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:37,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:37,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:37,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:37,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:37,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:37,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:37,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:37,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:37,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:37,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:32:37,176 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:37,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:37,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:37,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:37,179 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:37,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:37,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:37,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:37,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:37,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:37,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:37,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:37,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:37,181 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:37,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:37,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:37,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:37,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:37,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:37,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:37,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:37,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:37,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:37,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:37,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:37,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:37,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:37,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:37,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:32:37,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:37,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:37,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:37,520 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:37,521 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:37,522 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c [2019-10-13 21:32:37,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7226b111b/797289a1e92247c4bf015525d10ce0b1/FLAGbc3b2e793 [2019-10-13 21:32:38,011 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:38,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c [2019-10-13 21:32:38,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7226b111b/797289a1e92247c4bf015525d10ce0b1/FLAGbc3b2e793 [2019-10-13 21:32:38,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7226b111b/797289a1e92247c4bf015525d10ce0b1 [2019-10-13 21:32:38,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:38,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:38,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:38,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:38,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:38,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4e377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38, skipping insertion in model container [2019-10-13 21:32:38,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,460 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:38,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:38,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:38,697 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:38,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:38,755 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:38,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38 WrapperNode [2019-10-13 21:32:38,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:38,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:38,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:38,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:38,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:38,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:38,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:38,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:38,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:39,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:39,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:39,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:39,003 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:39,441 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:39,442 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 21:32:39,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:39 BoogieIcfgContainer [2019-10-13 21:32:39,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:39,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:39,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:39,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:39,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:38" (1/3) ... [2019-10-13 21:32:39,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39adccbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:39, skipping insertion in model container [2019-10-13 21:32:39,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (2/3) ... [2019-10-13 21:32:39,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39adccbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:39, skipping insertion in model container [2019-10-13 21:32:39,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:39" (3/3) ... [2019-10-13 21:32:39,455 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_10_ground.c [2019-10-13 21:32:39,462 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:39,470 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:39,481 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:39,507 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:39,507 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:39,507 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:39,508 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:39,508 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:39,508 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:39,508 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:39,508 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 21:32:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:39,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:39,531 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:39,532 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash -461873160, now seen corresponding path program 1 times [2019-10-13 21:32:39,545 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:39,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868732698] [2019-10-13 21:32:39,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:39,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868732698] [2019-10-13 21:32:39,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:39,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:39,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231704362] [2019-10-13 21:32:39,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:39,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:39,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:39,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:39,727 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 21:32:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:39,791 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-10-13 21:32:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:39,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:32:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:39,802 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:32:39,802 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:32:39,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:32:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:32:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:32:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-13 21:32:39,841 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-10-13 21:32:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:39,841 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-13 21:32:39,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-13 21:32:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:32:39,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:39,843 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:39,843 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1309090252, now seen corresponding path program 1 times [2019-10-13 21:32:39,844 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:39,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736759024] [2019-10-13 21:32:39,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:39,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736759024] [2019-10-13 21:32:39,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650144705] [2019-10-13 21:32:39,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:40,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:40,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:40,078 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:40,112 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:32:40,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-13 21:32:40,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579909802] [2019-10-13 21:32:40,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:32:40,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:40,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:32:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:32:40,116 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 4 states. [2019-10-13 21:32:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:40,174 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-10-13 21:32:40,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:32:40,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-13 21:32:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:40,178 INFO L225 Difference]: With dead ends: 41 [2019-10-13 21:32:40,178 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 21:32:40,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:32:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 21:32:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-10-13 21:32:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:32:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-13 21:32:40,201 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2019-10-13 21:32:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:40,203 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-13 21:32:40,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:32:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-13 21:32:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:32:40,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:40,206 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:40,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:40,418 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1740034220, now seen corresponding path program 1 times [2019-10-13 21:32:40,420 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:40,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892430751] [2019-10-13 21:32:40,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:40,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:40,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:32:40,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892430751] [2019-10-13 21:32:40,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357824857] [2019-10-13 21:32:40,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:40,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:32:40,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:40,709 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:40,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [146761236] [2019-10-13 21:32:40,802 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:32:40,802 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:40,809 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:40,820 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:40,821 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:41,020 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:41,298 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:41,331 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:41,338 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:41,338 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:41,339 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 121#(and (not (= 0 main_~found~0)) (<= 0 main_~i~0) (= main_~pos~0 main_~i~0) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (<= 0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* main_~x~0 4)))) (<= 0 main_~x~0)) [2019-10-13 21:32:41,339 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:41,339 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:41,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:41,340 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-13 21:32:41,340 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:41,341 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:41,341 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:41,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:41,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:41,342 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 116#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:41,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:41,342 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-13 21:32:41,343 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 106#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0)) [2019-10-13 21:32:41,343 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-13 21:32:41,343 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 111#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0) (not (< (+ main_~i~0 1) main_~n~0))) [2019-10-13 21:32:41,862 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:41,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 14] total 25 [2019-10-13 21:32:41,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837178188] [2019-10-13 21:32:41,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:32:41,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:41,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:32:41,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:32:41,868 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 25 states. [2019-10-13 21:32:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:43,791 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2019-10-13 21:32:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-13 21:32:43,792 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-10-13 21:32:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:43,794 INFO L225 Difference]: With dead ends: 68 [2019-10-13 21:32:43,795 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 21:32:43,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=553, Invalid=2869, Unknown=0, NotChecked=0, Total=3422 [2019-10-13 21:32:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 21:32:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2019-10-13 21:32:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:32:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-13 21:32:43,824 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2019-10-13 21:32:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:43,825 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-13 21:32:43,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:32:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-13 21:32:43,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:32:43,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,827 INFO L380 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:44,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:44,030 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:44,031 INFO L82 PathProgramCache]: Analyzing trace with hash 156923604, now seen corresponding path program 2 times [2019-10-13 21:32:44,032 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:44,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994544022] [2019-10-13 21:32:44,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:44,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:44,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:32:44,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994544022] [2019-10-13 21:32:44,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127160898] [2019-10-13 21:32:44,157 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:44,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:32:44,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:44,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:32:44,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:32:44,281 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:32:44,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1032014502] [2019-10-13 21:32:44,352 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:32:44,352 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:44,353 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:44,353 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:44,353 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:44,384 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:44,558 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:44,587 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:44,597 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:44,598 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:44,598 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 121#(and (not (= 0 main_~found~0)) (<= 0 main_~i~0) (= main_~pos~0 main_~i~0) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (<= 0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* main_~x~0 4)))) (<= 0 main_~x~0)) [2019-10-13 21:32:44,599 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:44,600 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:44,600 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:44,600 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-13 21:32:44,601 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:44,601 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,601 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,602 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,602 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:44,602 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 116#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:44,603 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:32:44,604 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-13 21:32:44,612 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 106#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0)) [2019-10-13 21:32:44,612 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-13 21:32:44,613 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 111#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0) (not (< (+ main_~i~0 1) main_~n~0))) [2019-10-13 21:32:45,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:45,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6, 14] total 30 [2019-10-13 21:32:45,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222616079] [2019-10-13 21:32:45,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-13 21:32:45,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:45,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-13 21:32:45,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:32:45,034 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 30 states. [2019-10-13 21:32:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:47,952 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2019-10-13 21:32:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-13 21:32:47,952 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-10-13 21:32:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:47,953 INFO L225 Difference]: With dead ends: 95 [2019-10-13 21:32:47,954 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 21:32:47,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1066, Invalid=4940, Unknown=0, NotChecked=0, Total=6006 [2019-10-13 21:32:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 21:32:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2019-10-13 21:32:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 21:32:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-10-13 21:32:47,971 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2019-10-13 21:32:47,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:47,971 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-10-13 21:32:47,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-13 21:32:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-10-13 21:32:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:32:47,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:47,975 INFO L380 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:48,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:48,179 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:48,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:48,179 INFO L82 PathProgramCache]: Analyzing trace with hash 604204572, now seen corresponding path program 1 times [2019-10-13 21:32:48,180 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:48,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136637478] [2019-10-13 21:32:48,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:32:48,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136637478] [2019-10-13 21:32:48,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55573398] [2019-10-13 21:32:48,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:48,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:32:48,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:32:48,594 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:32:48,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [212909523] [2019-10-13 21:32:48,811 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:32:48,811 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:48,813 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:48,813 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:48,813 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:48,846 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:49,079 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:49,103 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:49,115 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:49,115 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:49,116 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 152#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (<= 0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* main_~x~0 4)))) (<= 0 main_~x~0)) [2019-10-13 21:32:49,116 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 162#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:49,119 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 167#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:49,119 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 176#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:49,119 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-13 21:32:49,120 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 172#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:49,120 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,120 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,120 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 181#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,121 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:49,121 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 147#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:49,121 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 157#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:49,121 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-13 21:32:49,121 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 137#true [2019-10-13 21:32:49,122 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-13 21:32:49,122 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(not (< (+ main_~i~0 1) main_~n~0)) [2019-10-13 21:32:49,504 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:49,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 13] total 44 [2019-10-13 21:32:49,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111985063] [2019-10-13 21:32:49,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-13 21:32:49,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:49,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-13 21:32:49,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1397, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:32:49,507 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 44 states. [2019-10-13 21:32:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:50,977 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2019-10-13 21:32:50,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:32:50,978 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 28 [2019-10-13 21:32:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:50,979 INFO L225 Difference]: With dead ends: 104 [2019-10-13 21:32:50,979 INFO L226 Difference]: Without dead ends: 71 [2019-10-13 21:32:50,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2037 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1168, Invalid=4684, Unknown=0, NotChecked=0, Total=5852 [2019-10-13 21:32:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-13 21:32:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2019-10-13 21:32:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 21:32:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2019-10-13 21:32:51,001 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 28 [2019-10-13 21:32:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:51,002 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2019-10-13 21:32:51,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-13 21:32:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2019-10-13 21:32:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:32:51,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:51,003 INFO L380 BasicCegarLoop]: trace histogram [20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:51,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:51,204 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1318645069, now seen corresponding path program 2 times [2019-10-13 21:32:51,205 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:51,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948825060] [2019-10-13 21:32:51,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:32:51,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948825060] [2019-10-13 21:32:51,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557348124] [2019-10-13 21:32:51,648 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:51,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:32:51,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:51,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:32:51,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-13 21:32:51,896 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-13 21:32:52,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [201871150] [2019-10-13 21:32:52,109 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:32:52,109 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:52,110 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:52,110 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:52,111 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:52,156 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:52,418 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:52,437 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:52,443 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:52,443 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:52,444 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 152#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (<= 0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* main_~x~0 4)))) (<= 0 main_~x~0)) [2019-10-13 21:32:52,444 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 162#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:52,444 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 167#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:52,445 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 176#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:52,446 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-13 21:32:52,446 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 172#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:52,447 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,447 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,447 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 181#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,448 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:52,448 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 147#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:52,448 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 157#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:52,448 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-13 21:32:52,449 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 137#true [2019-10-13 21:32:52,452 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-13 21:32:52,452 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(not (< (+ main_~i~0 1) main_~n~0)) [2019-10-13 21:32:52,996 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:52,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 10, 13] total 50 [2019-10-13 21:32:52,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277240] [2019-10-13 21:32:52,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-13 21:32:52,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-13 21:32:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=1913, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 21:32:53,000 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 50 states. [2019-10-13 21:33:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:02,701 INFO L93 Difference]: Finished difference Result 179 states and 252 transitions. [2019-10-13 21:33:02,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-10-13 21:33:02,706 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 39 [2019-10-13 21:33:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:02,708 INFO L225 Difference]: With dead ends: 179 [2019-10-13 21:33:02,708 INFO L226 Difference]: Without dead ends: 145 [2019-10-13 21:33:02,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9331 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=5703, Invalid=23027, Unknown=0, NotChecked=0, Total=28730 [2019-10-13 21:33:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-13 21:33:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2019-10-13 21:33:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-13 21:33:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2019-10-13 21:33:02,740 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 39 [2019-10-13 21:33:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:02,741 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2019-10-13 21:33:02,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-13 21:33:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2019-10-13 21:33:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 21:33:02,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:02,742 INFO L380 BasicCegarLoop]: trace histogram [24, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:02,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:02,947 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:02,948 INFO L82 PathProgramCache]: Analyzing trace with hash 200395476, now seen corresponding path program 3 times [2019-10-13 21:33:02,948 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:02,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366832745] [2019-10-13 21:33:02,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:02,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:02,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:33:03,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366832745] [2019-10-13 21:33:03,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850482414] [2019-10-13 21:33:03,376 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:03,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:03,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:03,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 21:33:03,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:03,908 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-13 21:33:04,040 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-10-13 21:33:04,393 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-13 21:33:10,529 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 84