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_two_index_04.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:26:45,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:26:45,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:26:45,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:26:45,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:26:45,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:26:45,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:26:45,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:26:45,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:26:45,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:26:45,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:26:45,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:26:45,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:26:45,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:26:45,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:26:45,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:26:45,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:26:45,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:26:45,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:26:45,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:26:45,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:26:45,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:26:45,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:26:45,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:26:45,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:26:45,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:26:45,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:26:45,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:26:45,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:26:45,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:26:45,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:26:45,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:26:45,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:26:45,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:26:45,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:26:45,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:26:45,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:26:45,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:26:45,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:26:45,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:26:45,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:26:45,129 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:26:45,143 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:26:45,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:26:45,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:26:45,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:26:45,145 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:26:45,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:26:45,145 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:26:45,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:26:45,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:26:45,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:26:45,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:26:45,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:26:45,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:26:45,147 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:26:45,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:26:45,147 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:26:45,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:26:45,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:26:45,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:26:45,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:26:45,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:26:45,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:26:45,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:26:45,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:26:45,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:26:45,149 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:26:45,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:26:45,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:26:45,151 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:26:45,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:26:45,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:26:45,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:26:45,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:26:45,435 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:26:45,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_04.i [2019-10-07 00:26:45,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46cc62f16/8a8f3f14774c49f0a76c16c5ae76c2ce/FLAGed5262c33 [2019-10-07 00:26:45,950 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:26:45,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_04.i [2019-10-07 00:26:45,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46cc62f16/8a8f3f14774c49f0a76c16c5ae76c2ce/FLAGed5262c33 [2019-10-07 00:26:46,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46cc62f16/8a8f3f14774c49f0a76c16c5ae76c2ce [2019-10-07 00:26:46,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:26:46,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:26:46,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:26:46,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:26:46,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:26:46,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:26:46" (1/1) ... [2019-10-07 00:26:46,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac730e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46, skipping insertion in model container [2019-10-07 00:26:46,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:26:46" (1/1) ... [2019-10-07 00:26:46,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:26:46,398 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:26:46,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:26:46,589 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:26:46,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:26:46,629 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:26:46,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46 WrapperNode [2019-10-07 00:26:46,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:26:46,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:26:46,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:26:46,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:26:46,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46" (1/1) ... [2019-10-07 00:26:46,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46" (1/1) ... [2019-10-07 00:26:46,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46" (1/1) ... [2019-10-07 00:26:46,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46" (1/1) ... [2019-10-07 00:26:46,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46" (1/1) ... [2019-10-07 00:26:46,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46" (1/1) ... [2019-10-07 00:26:46,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46" (1/1) ... [2019-10-07 00:26:46,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:26:46,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:26:46,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:26:46,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:26:46,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46" (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:26:46,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:26:46,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:26:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:26:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:26:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:26:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:26:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:26:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:26:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:26:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:26:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:26:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:26:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:26:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:26:47,155 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:26:47,155 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:26:47,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:26:47 BoogieIcfgContainer [2019-10-07 00:26:47,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:26:47,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:26:47,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:26:47,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:26:47,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:26:46" (1/3) ... [2019-10-07 00:26:47,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fe3bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:26:47, skipping insertion in model container [2019-10-07 00:26:47,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:26:46" (2/3) ... [2019-10-07 00:26:47,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fe3bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:26:47, skipping insertion in model container [2019-10-07 00:26:47,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:26:47" (3/3) ... [2019-10-07 00:26:47,167 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_04.i [2019-10-07 00:26:47,176 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:26:47,183 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:26:47,195 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:26:47,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:26:47,223 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:26:47,223 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:26:47,223 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:26:47,223 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:26:47,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:26:47,224 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:26:47,224 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:26:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:26:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:26:47,246 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:26:47,247 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:26:47,249 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:26:47,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:26:47,254 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-07 00:26:47,261 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:26:47,261 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:47,261 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:47,261 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:47,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:26:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:26:47,453 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:26:47,454 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:47,455 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:26:47,455 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:26:47,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:26:47,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:26:47,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:26:47,484 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:26:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:26:47,560 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-07 00:26:47,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:26:47,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:26:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:26:47,574 INFO L225 Difference]: With dead ends: 33 [2019-10-07 00:26:47,575 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 00:26:47,583 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:26:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 00:26:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 00:26:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 00:26:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-07 00:26:47,629 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-07 00:26:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:26:47,631 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-07 00:26:47,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:26:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-07 00:26:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:26:47,633 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:26:47,633 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:26:47,634 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:26:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:26:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1896737256, now seen corresponding path program 1 times [2019-10-07 00:26:47,636 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:26:47,637 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:47,637 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:47,637 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:47,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:26:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:26:47,735 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:26:47,736 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:47,736 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:26:47,738 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:26:47,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:26:47,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:26:47,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:26:47,743 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-07 00:26:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:26:47,791 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 00:26:47,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:26:47,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:26:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:26:47,794 INFO L225 Difference]: With dead ends: 30 [2019-10-07 00:26:47,795 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:26:47,796 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:26:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:26:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-07 00:26:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:26:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:26:47,813 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-07 00:26:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:26:47,814 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:26:47,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:26:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:26:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:26:47,817 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:26:47,817 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:26:47,818 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:26:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:26:47,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-07 00:26:47,819 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:26:47,820 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:47,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:47,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:26:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:26:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:26:47,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:47,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:26:47,914 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:26:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:26:47,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:26:47,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:26:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:26:48,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:26:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:26:48,060 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:26:48,092 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:26:48,092 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:26:48,099 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:26:48,113 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:26:48,115 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:26:48,295 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:26:48,759 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-07 00:26:48,856 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:26:48,870 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:26:48,878 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:26:48,878 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:26:48,878 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:48,879 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:48,879 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:26:48,879 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:26:48,880 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:48,880 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:26:48,880 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:26:48,881 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:26:48,881 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 16 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:26:48,881 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:26:48,881 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:26:48,882 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:26:48,882 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) [2019-10-07 00:26:49,206 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:26:49,207 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-07 00:26:49,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 00:26:49,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 00:26:49,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-07 00:26:49,210 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-07 00:26:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:26:49,938 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-10-07 00:26:49,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 00:26:49,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-07 00:26:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:26:49,940 INFO L225 Difference]: With dead ends: 50 [2019-10-07 00:26:49,940 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 00:26:49,942 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 00:26:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 00:26:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-10-07 00:26:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:26:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-07 00:26:49,957 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-07 00:26:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:26:49,957 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-07 00:26:49,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 00:26:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-07 00:26:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 00:26:49,959 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:26:49,959 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:26:50,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:26:50,165 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:26:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:26:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1363999975, now seen corresponding path program 2 times [2019-10-07 00:26:50,165 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:26:50,166 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:50,166 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:50,166 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:26:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:26:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:26:50,242 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:50,242 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:26:50,242 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:26:50,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:26:50,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:26:50,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 00:26:50,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:26:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:26:50,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:26:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:26:50,351 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:26:50,352 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:26:50,352 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:26:50,353 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:26:50,353 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:26:50,353 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:26:50,399 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:26:50,771 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:26:50,790 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:26:50,796 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:26:50,796 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:26:50,797 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:50,797 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:50,797 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:26:50,797 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:26:50,798 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:50,799 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:26:50,799 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:26:50,799 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:26:50,800 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 16 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:26:50,800 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:26:50,800 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:26:50,800 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:26:50,801 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) [2019-10-07 00:26:51,089 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:26:51,089 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 21 [2019-10-07 00:26:51,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 00:26:51,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 00:26:51,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-07 00:26:51,092 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2019-10-07 00:26:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:26:52,079 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-07 00:26:52,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 00:26:52,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-10-07 00:26:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:26:52,082 INFO L225 Difference]: With dead ends: 73 [2019-10-07 00:26:52,083 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 00:26:52,084 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:26:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 00:26:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-10-07 00:26:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 00:26:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-07 00:26:52,104 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-07 00:26:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:26:52,105 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-07 00:26:52,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 00:26:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-07 00:26:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 00:26:52,106 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:26:52,106 INFO L385 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:26:52,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:26:52,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:26:52,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:26:52,313 INFO L82 PathProgramCache]: Analyzing trace with hash 311824988, now seen corresponding path program 3 times [2019-10-07 00:26:52,313 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:26:52,313 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:52,313 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:52,313 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:26:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:26:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:26:52,489 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:52,490 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:26:52,490 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:26:52,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:26:52,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:26:52,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 00:26:52,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:26:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:26:52,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:26:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:26:52,766 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:26:52,767 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:26:52,767 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:26:52,768 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:26:52,768 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:26:52,768 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:26:52,798 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:26:53,058 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:26:53,068 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:26:53,073 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:26:53,073 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:26:53,074 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:53,074 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:53,074 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:26:53,075 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:26:53,075 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:53,075 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:26:53,076 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:26:53,076 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:26:53,076 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 16 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:26:53,076 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:26:53,077 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:26:53,077 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:26:53,077 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) [2019-10-07 00:26:53,468 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:26:53,468 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 38 [2019-10-07 00:26:53,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-07 00:26:53,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-07 00:26:53,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=949, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 00:26:53,474 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 38 states. [2019-10-07 00:26:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:26:55,349 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2019-10-07 00:26:55,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-07 00:26:55,354 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 28 [2019-10-07 00:26:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:26:55,356 INFO L225 Difference]: With dead ends: 111 [2019-10-07 00:26:55,356 INFO L226 Difference]: Without dead ends: 93 [2019-10-07 00:26:55,360 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2019-10-07 00:26:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-07 00:26:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 53. [2019-10-07 00:26:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-07 00:26:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-07 00:26:55,386 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 28 [2019-10-07 00:26:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:26:55,386 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-07 00:26:55,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-07 00:26:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-07 00:26:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 00:26:55,390 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:26:55,390 INFO L385 BasicCegarLoop]: trace histogram [25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:26:55,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:26:55,594 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:26:55,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:26:55,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1515479896, now seen corresponding path program 4 times [2019-10-07 00:26:55,596 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:26:55,596 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:55,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:55,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:26:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:26:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-07 00:26:55,786 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:55,786 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:26:55,786 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:26:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:26:55,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-07 00:26:55,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:26:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-07 00:26:56,081 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:26:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-07 00:26:56,704 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:26:56,710 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:26:56,710 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:26:56,711 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:26:56,712 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:26:56,713 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:26:56,762 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:26:57,138 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:26:57,147 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:26:57,152 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:26:57,153 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:26:57,153 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:57,154 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __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:26:57,154 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:26:57,154 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:26:57,154 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __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:26:57,155 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:26:57,155 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:26:57,155 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:26:57,155 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 16 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:26:57,156 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:26:57,156 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:26:57,156 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:26:57,156 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-07 00:26:57,474 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:26:57,474 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28, 28, 11] total 71 [2019-10-07 00:26:57,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-07 00:26:57,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-07 00:26:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1975, Invalid=2995, Unknown=0, NotChecked=0, Total=4970 [2019-10-07 00:26:57,478 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 71 states. [2019-10-07 00:27:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:02,066 INFO L93 Difference]: Finished difference Result 182 states and 245 transitions. [2019-10-07 00:27:02,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-07 00:27:02,067 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 49 [2019-10-07 00:27:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:02,070 INFO L225 Difference]: With dead ends: 182 [2019-10-07 00:27:02,070 INFO L226 Difference]: Without dead ends: 160 [2019-10-07 00:27:02,076 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8564 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7337, Invalid=17155, Unknown=0, NotChecked=0, Total=24492 [2019-10-07 00:27:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-07 00:27:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 94. [2019-10-07 00:27:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-07 00:27:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-10-07 00:27:02,097 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 49 [2019-10-07 00:27:02,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:02,097 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-10-07 00:27:02,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-07 00:27:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-10-07 00:27:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-07 00:27:02,100 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:02,100 INFO L385 BasicCegarLoop]: trace histogram [58, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:02,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:02,312 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1495953052, now seen corresponding path program 5 times [2019-10-07 00:27:02,314 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:02,314 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:02,314 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:02,315 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:02,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-10-07 00:27:02,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:02,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:27:02,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:18,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-07 00:27:18,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:27:18,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-07 00:27:18,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:27:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-10-07 00:27:18,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:27:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-10-07 00:27:18,655 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:27:18,656 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:27:18,656 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:27:18,656 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:27:18,656 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:27:18,657 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:27:18,678 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:27:18,943 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:27:18,952 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:27:18,956 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:27:18,956 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:27:18,956 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:18,957 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:18,957 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:18,957 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:27:18,957 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:18,957 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:27:18,958 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:27:18,958 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:27:18,958 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 16 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:18,958 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:18,959 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:27:18,959 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:27:18,959 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-07 00:27:19,265 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:27:19,266 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 11] total 55 [2019-10-07 00:27:19,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-07 00:27:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-07 00:27:19,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1864, Unknown=0, NotChecked=0, Total=2970 [2019-10-07 00:27:19,270 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 55 states. [2019-10-07 00:27:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:24,555 INFO L93 Difference]: Finished difference Result 255 states and 319 transitions. [2019-10-07 00:27:24,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-10-07 00:27:24,556 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 90 [2019-10-07 00:27:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:24,558 INFO L225 Difference]: With dead ends: 255 [2019-10-07 00:27:24,558 INFO L226 Difference]: Without dead ends: 246 [2019-10-07 00:27:24,564 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5731 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6182, Invalid=14988, Unknown=0, NotChecked=0, Total=21170 [2019-10-07 00:27:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-07 00:27:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 116. [2019-10-07 00:27:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-07 00:27:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-10-07 00:27:24,595 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 90 [2019-10-07 00:27:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:24,596 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-10-07 00:27:24,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-07 00:27:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-10-07 00:27:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-07 00:27:24,598 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:24,598 INFO L385 BasicCegarLoop]: trace histogram [58, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:24,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:24,809 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash -763074820, now seen corresponding path program 6 times [2019-10-07 00:27:24,810 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:24,810 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:24,810 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:24,810 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:24,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2614 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-10-07 00:27:25,845 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:25,845 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:27:25,845 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:27:26,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:27:26,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:27:26,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-07 00:27:26,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:27:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2614 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-07 00:27:26,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:27:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2614 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-07 00:27:29,623 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:27:29,624 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:27:29,625 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:27:29,625 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:27:29,625 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:27:29,626 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:27:29,652 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:27:29,924 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:27:29,932 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:27:29,935 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:27:29,935 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:27:29,935 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:29,935 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __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:27:29,936 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:29,936 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:27:29,936 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __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:27:29,936 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:27:29,936 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:27:29,937 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:27:29,937 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 16 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:29,937 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:29,937 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:27:29,937 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:27:29,937 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) [2019-10-07 00:27:30,362 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:27:30,362 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 61, 61, 11] total 159 [2019-10-07 00:27:30,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-10-07 00:27:30,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-10-07 00:27:30,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11347, Invalid=13775, Unknown=0, NotChecked=0, Total=25122 [2019-10-07 00:27:30,368 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 159 states. [2019-10-07 00:27:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:49,360 INFO L93 Difference]: Finished difference Result 452 states and 616 transitions. [2019-10-07 00:27:49,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2019-10-07 00:27:49,361 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 112 [2019-10-07 00:27:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:49,365 INFO L225 Difference]: With dead ends: 452 [2019-10-07 00:27:49,365 INFO L226 Difference]: Without dead ends: 400 [2019-10-07 00:27:49,373 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46090 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=44420, Invalid=92850, Unknown=0, NotChecked=0, Total=137270 [2019-10-07 00:27:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-10-07 00:27:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 220. [2019-10-07 00:27:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-07 00:27:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-10-07 00:27:49,410 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 112 [2019-10-07 00:27:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:49,411 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-10-07 00:27:49,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-10-07 00:27:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-10-07 00:27:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-07 00:27:49,415 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:49,415 INFO L385 BasicCegarLoop]: trace histogram [146, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:49,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:49,622 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1425715708, now seen corresponding path program 7 times [2019-10-07 00:27:49,623 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:49,624 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:49,624 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:49,624 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12442 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 10731 trivial. 0 not checked. [2019-10-07 00:27:51,383 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:51,383 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:27:51,383 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:27:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:51,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 148 conjunts are in the unsatisfiable core [2019-10-07 00:27:51,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:27:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12442 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-10-07 00:27:53,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12442 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-10-07 00:28:07,681 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:07,682 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:07,682 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:07,683 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:07,683 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:07,683 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:07,701 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:07,954 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:28:07,964 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:07,967 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:07,967 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:07,967 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:07,967 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:07,968 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:07,968 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:07,968 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:07,968 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:28:07,969 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:28:07,969 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:28:07,969 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 16 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:07,969 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:07,969 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:07,969 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:07,970 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) [2019-10-07 00:28:08,441 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:08,441 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 149, 149, 11] total 329 [2019-10-07 00:28:08,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 329 states [2019-10-07 00:28:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 329 interpolants. [2019-10-07 00:28:08,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51382, Invalid=56530, Unknown=0, NotChecked=0, Total=107912 [2019-10-07 00:28:08,457 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 329 states. [2019-10-07 00:29:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:24,458 INFO L93 Difference]: Finished difference Result 790 states and 1096 transitions. [2019-10-07 00:29:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 425 states. [2019-10-07 00:29:24,458 INFO L78 Accepts]: Start accepts. Automaton has 329 states. Word has length 216 [2019-10-07 00:29:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:24,464 INFO L225 Difference]: With dead ends: 790 [2019-10-07 00:29:24,464 INFO L226 Difference]: Without dead ends: 722 [2019-10-07 00:29:24,482 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1129 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 747 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198795 ImplicationChecksByTransitivity, 70.0s TimeCoverageRelationStatistics Valid=189346, Invalid=370906, Unknown=0, NotChecked=0, Total=560252 [2019-10-07 00:29:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-10-07 00:29:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 428. [2019-10-07 00:29:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-07 00:29:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 430 transitions. [2019-10-07 00:29:24,534 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 430 transitions. Word has length 216 [2019-10-07 00:29:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:24,535 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 430 transitions. [2019-10-07 00:29:24,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 329 states. [2019-10-07 00:29:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 430 transitions. [2019-10-07 00:29:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-10-07 00:29:24,545 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:24,545 INFO L385 BasicCegarLoop]: trace histogram [316, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:24,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:24,752 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash -27915556, now seen corresponding path program 8 times [2019-10-07 00:29:24,753 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:24,753 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:24,753 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:24,753 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 54742 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 50086 trivial. 0 not checked. [2019-10-07 00:29:29,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:29,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:29,916 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