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_partition_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:14:33,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:14:33,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:14:33,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:14:33,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:14:33,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:14:33,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:14:33,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:14:33,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:14:33,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:14:33,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:14:33,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:14:33,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:14:33,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:14:33,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:14:33,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:14:33,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:14:33,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:14:33,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:14:33,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:14:33,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:14:33,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:14:33,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:14:33,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:14:33,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:14:33,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:14:33,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:14:33,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:14:33,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:14:33,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:14:33,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:14:33,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:14:33,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:14:33,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:14:33,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:14:33,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:14:33,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:14:33,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:14:33,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:14:33,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:14:33,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:14:33,263 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-07 00:14:33,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:14:33,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:14:33,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:14:33,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:14:33,280 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:14:33,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:14:33,280 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:14:33,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:14:33,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:14:33,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:14:33,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:14:33,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:14:33,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:14:33,282 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:14:33,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:14:33,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:14:33,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:14:33,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:14:33,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:14:33,283 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:14:33,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:14:33,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:14:33,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:14:33,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:14:33,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:14:33,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:14:33,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:14:33,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:14:33,285 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-07 00:14:33,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:14:33,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:14:33,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:14:33,603 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:14:33,603 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:14:33,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_ground-2.i [2019-10-07 00:14:33,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f409df63/3674775337fe4140ba2f1aabb8cedbcb/FLAG243018065 [2019-10-07 00:14:34,120 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:14:34,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_ground-2.i [2019-10-07 00:14:34,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f409df63/3674775337fe4140ba2f1aabb8cedbcb/FLAG243018065 [2019-10-07 00:14:34,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f409df63/3674775337fe4140ba2f1aabb8cedbcb [2019-10-07 00:14:34,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:14:34,524 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:14:34,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:14:34,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:14:34,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:14:34,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:14:34" (1/1) ... [2019-10-07 00:14:34,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bd23e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34, skipping insertion in model container [2019-10-07 00:14:34,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:14:34" (1/1) ... [2019-10-07 00:14:34,541 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:14:34,560 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:14:34,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:14:34,826 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:14:34,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:14:34,876 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:14:34,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34 WrapperNode [2019-10-07 00:14:34,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:14:34,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:14:34,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:14:34,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:14:34,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34" (1/1) ... [2019-10-07 00:14:34,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34" (1/1) ... [2019-10-07 00:14:34,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34" (1/1) ... [2019-10-07 00:14:34,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34" (1/1) ... [2019-10-07 00:14:34,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34" (1/1) ... [2019-10-07 00:14:34,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34" (1/1) ... [2019-10-07 00:14:34,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34" (1/1) ... [2019-10-07 00:14:35,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:14:35,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:14:35,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:14:35,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:14:35,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34" (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-07 00:14:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:14:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:14:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:14:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:14:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:14:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:14:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:14:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:14:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:14:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:14:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:14:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:14:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:14:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:14:35,538 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:14:35,538 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 00:14:35,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:14:35 BoogieIcfgContainer [2019-10-07 00:14:35,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:14:35,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:14:35,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:14:35,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:14:35,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:14:34" (1/3) ... [2019-10-07 00:14:35,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65518bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:14:35, skipping insertion in model container [2019-10-07 00:14:35,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:34" (2/3) ... [2019-10-07 00:14:35,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65518bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:14:35, skipping insertion in model container [2019-10-07 00:14:35,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:14:35" (3/3) ... [2019-10-07 00:14:35,548 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_partition_ground-2.i [2019-10-07 00:14:35,560 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:14:35,568 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:14:35,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:14:35,602 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:14:35,602 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:14:35,602 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:14:35,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:14:35,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:14:35,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:14:35,603 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:14:35,603 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:14:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-07 00:14:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:14:35,625 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:35,626 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:35,627 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:35,632 INFO L82 PathProgramCache]: Analyzing trace with hash 196542356, now seen corresponding path program 1 times [2019-10-07 00:14:35,639 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:35,640 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:35,640 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:35,640 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:35,800 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-07 00:14:35,801 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:35,802 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:14:35,802 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:14:35,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:14:35,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:14:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:14:35,825 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-07 00:14:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:35,860 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-07 00:14:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:14:35,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:14:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:35,876 INFO L225 Difference]: With dead ends: 35 [2019-10-07 00:14:35,877 INFO L226 Difference]: Without dead ends: 18 [2019-10-07 00:14:35,883 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-07 00:14:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-07 00:14:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-07 00:14:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:14:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-07 00:14:35,918 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-10-07 00:14:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:35,919 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-07 00:14:35,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:14:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-10-07 00:14:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:14:35,920 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:35,921 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:35,921 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:35,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2146985976, now seen corresponding path program 1 times [2019-10-07 00:14:35,922 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:35,922 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:35,923 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:35,923 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:36,020 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-07 00:14:36,020 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:36,021 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:14:36,021 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:14:36,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:14:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:14:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:14:36,026 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 3 states. [2019-10-07 00:14:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:36,059 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-07 00:14:36,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:14:36,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-07 00:14:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:36,062 INFO L225 Difference]: With dead ends: 30 [2019-10-07 00:14:36,062 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 00:14:36,064 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-07 00:14:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 00:14:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 00:14:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 00:14:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-07 00:14:36,069 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-10-07 00:14:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:36,070 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-07 00:14:36,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:14:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-07 00:14:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 00:14:36,071 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:36,071 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:36,072 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:36,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:36,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1135498834, now seen corresponding path program 1 times [2019-10-07 00:14:36,072 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:36,073 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:36,073 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:36,073 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:14:36,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:36,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:36,160 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-07 00:14:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:36,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:14:36,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:14:36,261 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:14:36,307 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:36,335 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:14:36,335 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:36,343 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:36,352 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:36,353 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:36,564 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:37,109 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:37,134 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:37,153 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:37,154 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:37,154 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_1) v_prenex_2))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:37,154 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_1) v_prenex_2))))) (<= 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-07 00:14:37,155 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:37,155 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:14:37,155 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:37,156 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_1) v_prenex_2))))) (<= 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-07 00:14:37,156 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:37,157 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-07 00:14:37,157 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-07 00:14:37,157 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:14:37,159 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:37,159 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_1) v_prenex_2))))) [2019-10-07 00:14:37,159 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:37,159 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:37,606 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:37,606 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 19 [2019-10-07 00:14:37,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-07 00:14:37,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-07 00:14:37,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-10-07 00:14:37,610 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 19 states. [2019-10-07 00:14:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:38,331 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-07 00:14:38,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 00:14:38,332 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2019-10-07 00:14:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:38,333 INFO L225 Difference]: With dead ends: 47 [2019-10-07 00:14:38,333 INFO L226 Difference]: Without dead ends: 34 [2019-10-07 00:14:38,334 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2019-10-07 00:14:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-07 00:14:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-07 00:14:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 00:14:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-07 00:14:38,341 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-10-07 00:14:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:38,342 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-07 00:14:38,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-07 00:14:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-07 00:14:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 00:14:38,343 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:38,343 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:38,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:38,554 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:38,555 INFO L82 PathProgramCache]: Analyzing trace with hash -11162668, now seen corresponding path program 2 times [2019-10-07 00:14:38,555 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:38,555 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:38,555 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:38,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:38,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 00:14:38,656 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:38,657 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:38,657 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-07 00:14:38,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:14:38,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:14:38,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:14:38,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-07 00:14:38,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-07 00:14:38,812 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:38,815 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:14:38,816 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:38,816 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:38,817 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:38,817 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:38,874 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:39,144 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:39,183 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:39,191 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:39,191 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:39,192 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_3) v_prenex_4))))))) [2019-10-07 00:14:39,192 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_3) v_prenex_4))))))) [2019-10-07 00:14:39,192 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:39,192 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:14:39,193 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:39,193 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_3) v_prenex_4))))))) [2019-10-07 00:14:39,193 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:39,193 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-07 00:14:39,194 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-07 00:14:39,194 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:14:39,194 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:39,195 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_3) v_prenex_4)))))) [2019-10-07 00:14:39,195 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:39,195 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:39,536 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:39,537 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 12] total 24 [2019-10-07 00:14:39,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 00:14:39,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 00:14:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-10-07 00:14:39,539 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 24 states. [2019-10-07 00:14:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:40,604 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-10-07 00:14:40,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 00:14:40,605 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-10-07 00:14:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:40,606 INFO L225 Difference]: With dead ends: 58 [2019-10-07 00:14:40,606 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 00:14:40,608 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=397, Invalid=2053, Unknown=0, NotChecked=0, Total=2450 [2019-10-07 00:14:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 00:14:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-10-07 00:14:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 00:14:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-07 00:14:40,616 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2019-10-07 00:14:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:40,616 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-07 00:14:40,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 00:14:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-07 00:14:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 00:14:40,618 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:40,618 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:40,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:40,831 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:40,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:40,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1498178232, now seen corresponding path program 3 times [2019-10-07 00:14:40,831 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:40,832 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:40,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:40,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:40,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:14:41,056 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:41,056 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:41,056 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-07 00:14:41,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:14:41,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:14:41,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:14:41,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-07 00:14:41,207 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-07 00:14:41,292 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:41,294 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:14:41,294 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:41,295 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:41,295 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:41,295 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:41,329 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:41,552 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:41,578 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:41,585 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:41,586 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:41,586 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((v_prenex_6 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_6) v_prenex_5)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:41,586 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_6) v_prenex_5)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:41,586 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:14:41,587 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:41,587 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:41,587 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_6) v_prenex_5)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:41,589 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:41,589 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-07 00:14:41,589 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-07 00:14:41,589 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:14:41,590 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:41,590 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((v_prenex_6 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_6) v_prenex_5)))))) [2019-10-07 00:14:41,590 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:41,592 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:42,032 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:42,032 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 12] total 32 [2019-10-07 00:14:42,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-07 00:14:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-07 00:14:42,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2019-10-07 00:14:42,035 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 32 states. [2019-10-07 00:14:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:43,229 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2019-10-07 00:14:43,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-07 00:14:43,230 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-10-07 00:14:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:43,232 INFO L225 Difference]: With dead ends: 75 [2019-10-07 00:14:43,232 INFO L226 Difference]: Without dead ends: 52 [2019-10-07 00:14:43,234 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=595, Invalid=2827, Unknown=0, NotChecked=0, Total=3422 [2019-10-07 00:14:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-07 00:14:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-10-07 00:14:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 00:14:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-07 00:14:43,243 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 30 [2019-10-07 00:14:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:43,244 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-07 00:14:43,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-07 00:14:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-07 00:14:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-07 00:14:43,245 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:43,245 INFO L385 BasicCegarLoop]: trace histogram [12, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:43,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:43,458 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2059227510, now seen corresponding path program 4 times [2019-10-07 00:14:43,459 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:43,459 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:43,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:43,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-07 00:14:43,620 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:43,621 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:43,621 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-07 00:14:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:43,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-07 00:14:43,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:14:43,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:14:44,250 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:44,251 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:14:44,251 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:44,252 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:44,252 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:44,252 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:44,278 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:44,437 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:44,448 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:44,452 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:44,453 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:44,453 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_8) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:44,453 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_8) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:44,453 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:14:44,453 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:44,454 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:44,454 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_8) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:44,454 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:44,455 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-07 00:14:44,455 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-07 00:14:44,455 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:14:44,455 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:44,456 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_8) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))))) [2019-10-07 00:14:44,456 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:44,456 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:44,845 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:44,845 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15, 12] total 47 [2019-10-07 00:14:44,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-07 00:14:44,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-07 00:14:44,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1706, Unknown=0, NotChecked=0, Total=2162 [2019-10-07 00:14:44,848 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 47 states. [2019-10-07 00:14:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:46,856 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2019-10-07 00:14:46,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-07 00:14:46,857 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 39 [2019-10-07 00:14:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:46,859 INFO L225 Difference]: With dead ends: 93 [2019-10-07 00:14:46,859 INFO L226 Difference]: Without dead ends: 68 [2019-10-07 00:14:46,862 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1625, Invalid=6207, Unknown=0, NotChecked=0, Total=7832 [2019-10-07 00:14:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-07 00:14:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-10-07 00:14:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-07 00:14:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-10-07 00:14:46,872 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 39 [2019-10-07 00:14:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:46,872 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-10-07 00:14:46,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-07 00:14:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-10-07 00:14:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 00:14:46,874 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:46,874 INFO L385 BasicCegarLoop]: trace histogram [26, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:47,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:47,079 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1901916396, now seen corresponding path program 5 times [2019-10-07 00:14:47,080 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:47,080 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:47,080 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:47,080 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:47,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 00:14:47,548 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:47,548 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:47,548 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-07 00:14:47,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-07 00:14:47,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:14:47,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 00:14:47,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-07 00:14:47,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-07 00:14:48,177 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:48,178 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:14:48,178 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:48,179 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:48,179 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:48,179 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:48,200 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:48,352 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:48,359 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:48,362 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:48,362 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:48,363 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_10) v_prenex_9)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:48,363 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_10) v_prenex_9)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:48,363 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:14:48,363 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:48,363 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:48,364 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_10) v_prenex_9)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:48,364 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:48,364 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-07 00:14:48,364 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-07 00:14:48,365 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:14:48,365 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:48,365 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_10) v_prenex_9)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) [2019-10-07 00:14:48,365 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:48,365 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:48,799 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:48,799 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11, 11, 12] total 58 [2019-10-07 00:14:48,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-07 00:14:48,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-07 00:14:48,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=2677, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 00:14:48,803 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 58 states. [2019-10-07 00:14:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:52,596 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2019-10-07 00:14:52,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-07 00:14:52,597 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 55 [2019-10-07 00:14:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:52,598 INFO L225 Difference]: With dead ends: 116 [2019-10-07 00:14:52,598 INFO L226 Difference]: Without dead ends: 89 [2019-10-07 00:14:52,603 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3983 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3074, Invalid=13696, Unknown=0, NotChecked=0, Total=16770 [2019-10-07 00:14:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-07 00:14:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-10-07 00:14:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-07 00:14:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-07 00:14:52,615 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 55 [2019-10-07 00:14:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:52,615 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-07 00:14:52,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-07 00:14:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-07 00:14:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 00:14:52,617 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:52,617 INFO L385 BasicCegarLoop]: trace histogram [27, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:52,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:52,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:52,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1270431560, now seen corresponding path program 6 times [2019-10-07 00:14:52,819 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:52,819 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:52,819 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:52,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-07 00:14:53,305 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:53,305 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:53,306 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-07 00:14:53,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:14:53,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:14:53,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-07 00:14:53,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-07 00:14:53,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-07 00:14:54,519 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:54,521 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:14:54,521 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:54,521 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:54,521 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:54,522 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:54,540 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:54,672 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:54,678 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:54,681 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:54,681 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:54,682 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:54,682 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:54,682 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:14:54,682 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:54,682 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:54,683 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:54,683 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:54,683 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-07 00:14:54,683 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-07 00:14:54,684 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:14:54,684 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:54,684 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11)))))) [2019-10-07 00:14:54,684 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:54,684 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:55,083 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:55,084 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 12] total 70 [2019-10-07 00:14:55,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-07 00:14:55,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-07 00:14:55,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1745, Invalid=3085, Unknown=0, NotChecked=0, Total=4830 [2019-10-07 00:14:55,088 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 70 states. [2019-10-07 00:14:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:58,352 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2019-10-07 00:14:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-07 00:14:58,352 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 76 [2019-10-07 00:14:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:58,354 INFO L225 Difference]: With dead ends: 165 [2019-10-07 00:14:58,355 INFO L226 Difference]: Without dead ends: 118 [2019-10-07 00:14:58,359 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3989 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5114, Invalid=12708, Unknown=0, NotChecked=0, Total=17822 [2019-10-07 00:14:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-07 00:14:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-10-07 00:14:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-07 00:14:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2019-10-07 00:14:58,373 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 76 [2019-10-07 00:14:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:58,373 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2019-10-07 00:14:58,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-07 00:14:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2019-10-07 00:14:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-07 00:14:58,375 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:58,376 INFO L385 BasicCegarLoop]: trace histogram [56, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:58,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:58,580 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1490670892, now seen corresponding path program 7 times [2019-10-07 00:14:58,581 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:58,581 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:58,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:58,582 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-07 00:15:00,006 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:00,006 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:00,006 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-07 00:15:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:00,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-07 00:15:00,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-07 00:15:00,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-07 00:15:03,919 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:03,920 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:15:03,920 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:03,920 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:03,921 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:03,921 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:03,940 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:04,073 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:15:04,080 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:04,082 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:04,083 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:04,083 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_14) v_prenex_13))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:04,083 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_14) v_prenex_13))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:04,083 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:15:04,083 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:04,084 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:15:04,084 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_14) v_prenex_13))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:04,084 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:15:04,084 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-07 00:15:04,084 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-07 00:15:04,085 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:15:04,085 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:04,085 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_14) v_prenex_13))))) [2019-10-07 00:15:04,085 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:15:04,085 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:15:04,641 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:04,642 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 12] total 128 [2019-10-07 00:15:04,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-10-07 00:15:04,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-10-07 00:15:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6820, Invalid=9436, Unknown=0, NotChecked=0, Total=16256 [2019-10-07 00:15:04,647 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand 128 states. [2019-10-07 00:15:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:14,455 INFO L93 Difference]: Finished difference Result 223 states and 286 transitions. [2019-10-07 00:15:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-10-07 00:15:14,456 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 105 [2019-10-07 00:15:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:14,458 INFO L225 Difference]: With dead ends: 223 [2019-10-07 00:15:14,459 INFO L226 Difference]: Without dead ends: 176 [2019-10-07 00:15:14,464 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12196 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20223, Invalid=42027, Unknown=0, NotChecked=0, Total=62250 [2019-10-07 00:15:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-07 00:15:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2019-10-07 00:15:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-07 00:15:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2019-10-07 00:15:14,483 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 105 [2019-10-07 00:15:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:14,484 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2019-10-07 00:15:14,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-10-07 00:15:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2019-10-07 00:15:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-07 00:15:14,487 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:14,487 INFO L385 BasicCegarLoop]: trace histogram [114, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:14,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:14,692 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash -278719148, now seen corresponding path program 8 times [2019-10-07 00:15:14,693 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:14,694 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:14,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:14,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6897 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-07 00:15:19,837 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:19,837 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:19,837 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-07 00:15:22,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-07 00:15:22,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:22,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-07 00:15:22,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6897 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 6726 trivial. 0 not checked. [2019-10-07 00:15:23,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6897 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 6726 trivial. 0 not checked. [2019-10-07 00:15:24,934 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:24,935 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:15:24,935 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:24,936 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:24,936 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:24,936 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:24,959 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:25,076 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:15:25,081 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:25,084 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:25,084 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:25,085 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_8| Int) (|v_main_~#bb~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_8|) |v_main_~#bb~0.offset_BEFORE_CALL_8|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_16) v_prenex_15)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:25,085 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_8| Int) (|v_main_~#bb~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_8|) |v_main_~#bb~0.offset_BEFORE_CALL_8|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_16) v_prenex_15)))))) (<= 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-07 00:15:25,085 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:15:25,085 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:25,085 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:15:25,085 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_8| Int) (|v_main_~#bb~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_8|) |v_main_~#bb~0.offset_BEFORE_CALL_8|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_16) v_prenex_15)))))) (<= 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-07 00:15:25,086 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:15:25,086 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-07 00:15:25,086 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-07 00:15:25,086 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:15:25,086 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:25,087 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_8| Int) (|v_main_~#bb~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_8|) |v_main_~#bb~0.offset_BEFORE_CALL_8|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_16) v_prenex_15)))))) [2019-10-07 00:15:25,087 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:15:25,087 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:15:26,041 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:26,041 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 21, 21, 12] total 166 [2019-10-07 00:15:26,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-10-07 00:15:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-10-07 00:15:26,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7599, Invalid=19791, Unknown=0, NotChecked=0, Total=27390 [2019-10-07 00:15:26,046 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 166 states. [2019-10-07 00:15:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:48,302 INFO L93 Difference]: Finished difference Result 264 states and 310 transitions. [2019-10-07 00:15:48,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2019-10-07 00:15:48,303 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 163 [2019-10-07 00:15:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:48,305 INFO L225 Difference]: With dead ends: 264 [2019-10-07 00:15:48,305 INFO L226 Difference]: Without dead ends: 217 [2019-10-07 00:15:48,309 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27379 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=29846, Invalid=103744, Unknown=0, NotChecked=0, Total=133590 [2019-10-07 00:15:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-07 00:15:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2019-10-07 00:15:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-07 00:15:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 211 transitions. [2019-10-07 00:15:48,329 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 211 transitions. Word has length 163 [2019-10-07 00:15:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:48,330 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 211 transitions. [2019-10-07 00:15:48,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-10-07 00:15:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 211 transitions. [2019-10-07 00:15:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-07 00:15:48,334 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:48,334 INFO L385 BasicCegarLoop]: trace histogram [115, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:48,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:48,547 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:48,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1717753656, now seen corresponding path program 9 times [2019-10-07 00:15:48,547 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:48,547 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:48,548 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:48,548 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8152 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-10-07 00:15:53,706 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:53,707 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:53,707 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-07 00:15:54,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:15:54,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:54,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-07 00:15:54,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8152 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-10-07 00:15:54,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:16:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8152 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-10-07 00:16:08,585 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:16:08,586 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:16:08,587 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:16:08,587 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:16:08,587 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:16:08,587 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:16:08,607 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:16:08,732 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:16:08,741 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:16:08,744 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:16:08,744 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:16:08,744 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.base_BEFORE_CALL_9| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_9|) |v_main_~#bb~0.offset_BEFORE_CALL_9|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:16:08,745 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (exists ((|v_main_~#bb~0.base_BEFORE_CALL_9| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_9|) |v_main_~#bb~0.offset_BEFORE_CALL_9|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:16:08,745 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:16:08,745 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:16:08,745 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:16:08,745 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (exists ((|v_main_~#bb~0.base_BEFORE_CALL_9| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_9|) |v_main_~#bb~0.offset_BEFORE_CALL_9|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:16:08,746 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:16:08,746 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-07 00:16:08,746 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-07 00:16:08,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:16:08,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:16:08,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.base_BEFORE_CALL_9| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_17) v_prenex_18)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_9|) |v_main_~#bb~0.offset_BEFORE_CALL_9|))))) [2019-10-07 00:16:08,746 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:16:08,747 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:16:09,697 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:16:09,698 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 12] total 246 [2019-10-07 00:16:09,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 246 states [2019-10-07 00:16:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 246 interpolants. [2019-10-07 00:16:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27529, Invalid=32741, Unknown=0, NotChecked=0, Total=60270 [2019-10-07 00:16:09,703 INFO L87 Difference]: Start difference. First operand 208 states and 211 transitions. Second operand 246 states. [2019-10-07 00:16:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:16:44,175 INFO L93 Difference]: Finished difference Result 421 states and 543 transitions. [2019-10-07 00:16:44,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2019-10-07 00:16:44,176 INFO L78 Accepts]: Start accepts. Automaton has 246 states. Word has length 204 [2019-10-07 00:16:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:16:44,180 INFO L225 Difference]: With dead ends: 421 [2019-10-07 00:16:44,180 INFO L226 Difference]: Without dead ends: 334 [2019-10-07 00:16:44,186 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41873 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=82114, Invalid=153596, Unknown=0, NotChecked=0, Total=235710 [2019-10-07 00:16:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-07 00:16:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 325. [2019-10-07 00:16:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-10-07 00:16:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 328 transitions. [2019-10-07 00:16:44,212 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 328 transitions. Word has length 204 [2019-10-07 00:16:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:16:44,213 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 328 transitions. [2019-10-07 00:16:44,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 246 states. [2019-10-07 00:16:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 328 transitions. [2019-10-07 00:16:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-07 00:16:44,219 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:16:44,219 INFO L385 BasicCegarLoop]: trace histogram [232, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:16:44,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:16:44,427 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:16:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:16:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash 873817940, now seen corresponding path program 10 times [2019-10-07 00:16:44,428 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:16:44,428 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:44,429 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:44,429 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:16:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:17:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 28510 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-10-07 00:17:04,453 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:17:04,453 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:17:04,454 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-07 00:17:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:17:04,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-07 00:17:04,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:17:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28510 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-10-07 00:17:05,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:18:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 28510 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-10-07 00:18:05,329 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:18:05,330 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:18:05,331 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:18:05,331 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:18:05,331 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:18:05,332 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:18:05,368 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:18:05,502 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:18:05,516 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:18:05,520 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:18:05,520 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:18:05,520 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 144#(and (exists ((|v_main_~#bb~0.base_BEFORE_CALL_10| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_10| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_10|) |v_main_~#bb~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:18:05,520 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 149#(and (exists ((|v_main_~#bb~0.base_BEFORE_CALL_10| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_10| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_10|) |v_main_~#bb~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= __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-07 00:18:05,520 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 124#(and (<= 100000 main_~i~0) (<= 0 main_~a~0)) [2019-10-07 00:18:05,521 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 158#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:18:05,521 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 134#(and (<= 100000 main_~a~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem7|) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:18:05,521 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 154#(and (exists ((|v_main_~#bb~0.base_BEFORE_CALL_10| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_10| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_10|) |v_main_~#bb~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= __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-07 00:18:05,521 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:18:05,521 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-07 00:18:05,521 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-07 00:18:05,521 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 163#(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-07 00:18:05,521 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:18:05,522 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 139#(exists ((|v_main_~#bb~0.base_BEFORE_CALL_10| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_10| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_10|) |v_main_~#bb~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_19) v_prenex_20))))) [2019-10-07 00:18:05,522 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 129#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:18:05,522 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:18:07,072 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:18:07,072 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 12] total 480 [2019-10-07 00:18:07,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 480 states [2019-10-07 00:18:07,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 480 interpolants. [2019-10-07 00:18:07,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109780, Invalid=120140, Unknown=0, NotChecked=0, Total=229920 [2019-10-07 00:18:07,088 INFO L87 Difference]: Start difference. First operand 325 states and 328 transitions. Second operand 480 states. [2019-10-07 00:20:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:20:20,130 INFO L93 Difference]: Finished difference Result 655 states and 894 transitions. [2019-10-07 00:20:20,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 479 states. [2019-10-07 00:20:20,131 INFO L78 Accepts]: Start accepts. Automaton has 480 states. Word has length 321 [2019-10-07 00:20:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:20:20,134 INFO L225 Difference]: With dead ends: 655 [2019-10-07 00:20:20,134 INFO L226 Difference]: Without dead ends: 568 [2019-10-07 00:20:20,150 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1672 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 952 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152204 ImplicationChecksByTransitivity, 204.3s TimeCoverageRelationStatistics Valid=328399, Invalid=580763, Unknown=0, NotChecked=0, Total=909162 [2019-10-07 00:20:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-07 00:20:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 559. [2019-10-07 00:20:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-07 00:20:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 562 transitions. [2019-10-07 00:20:20,179 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 562 transitions. Word has length 321 [2019-10-07 00:20:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:20:20,180 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 562 transitions. [2019-10-07 00:20:20,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 480 states. [2019-10-07 00:20:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 562 transitions. [2019-10-07 00:20:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-10-07 00:20:20,193 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:20:20,193 INFO L385 BasicCegarLoop]: trace histogram [466, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:20:20,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:20:20,403 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:20:20,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:20:20,403 INFO L82 PathProgramCache]: Analyzing trace with hash 413375956, now seen corresponding path program 11 times [2019-10-07 00:20:20,403 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:20:20,403 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:20:20,403 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:20:20,403 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:20:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:20:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 110293 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-10-07 00:21:40,667 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:40,668 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:21:40,668 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