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_copy4_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:29,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:29,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:29,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:29,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:29,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:29,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:29,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:29,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:29,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:29,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:29,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:29,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:29,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:29,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:29,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:29,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:29,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:29,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:29,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:29,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:29,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:29,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:29,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:29,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:29,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:29,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:29,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:29,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:29,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:29,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:29,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:29,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:29,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:29,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:29,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:29,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:29,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:29,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:29,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:29,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:29,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:33:29,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:29,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:29,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:29,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:29,281 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:29,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:29,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:29,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:29,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:29,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:29,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:29,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:29,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:29,284 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:29,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:29,284 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:29,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:29,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:29,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:29,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:29,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:29,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:29,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:29,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:29,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:29,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:29,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:29,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:29,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:33:29,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:29,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:29,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:29,588 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:29,588 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:29,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_ground-2.i [2019-10-13 21:33:29,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10c8eece9/768a7a02904743e8a601cb6aa6b34c98/FLAG4457f267e [2019-10-13 21:33:30,061 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:30,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_ground-2.i [2019-10-13 21:33:30,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10c8eece9/768a7a02904743e8a601cb6aa6b34c98/FLAG4457f267e [2019-10-13 21:33:30,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10c8eece9/768a7a02904743e8a601cb6aa6b34c98 [2019-10-13 21:33:30,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:30,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:30,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:30,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:30,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:30,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:30" (1/1) ... [2019-10-13 21:33:30,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8f9260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30, skipping insertion in model container [2019-10-13 21:33:30,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:30" (1/1) ... [2019-10-13 21:33:30,512 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:30,536 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:30,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:30,791 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:30,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:30,845 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:30,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30 WrapperNode [2019-10-13 21:33:30,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:30,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:30,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:30,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:30,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30" (1/1) ... [2019-10-13 21:33:30,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30" (1/1) ... [2019-10-13 21:33:30,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30" (1/1) ... [2019-10-13 21:33:30,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30" (1/1) ... [2019-10-13 21:33:30,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30" (1/1) ... [2019-10-13 21:33:31,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30" (1/1) ... [2019-10-13 21:33:31,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30" (1/1) ... [2019-10-13 21:33:31,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:31,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:31,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:31,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:31,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:31,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:31,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:31,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:31,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:31,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:31,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:31,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:31,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:31,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:31,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:31,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:31,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:31,630 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:31,630 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 21:33:31,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:31 BoogieIcfgContainer [2019-10-13 21:33:31,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:31,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:31,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:31,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:31,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:30" (1/3) ... [2019-10-13 21:33:31,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a30c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:31, skipping insertion in model container [2019-10-13 21:33:31,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:30" (2/3) ... [2019-10-13 21:33:31,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a30c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:31, skipping insertion in model container [2019-10-13 21:33:31,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:31" (3/3) ... [2019-10-13 21:33:31,638 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy4_ground-2.i [2019-10-13 21:33:31,648 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:31,656 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:31,668 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:31,693 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:31,694 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:31,694 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:31,694 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:31,694 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:31,694 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:31,695 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:31,695 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-13 21:33:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:33:31,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:31,719 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:31,720 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1907873763, now seen corresponding path program 1 times [2019-10-13 21:33:31,733 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:31,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650538964] [2019-10-13 21:33:31,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:31,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:31,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:33:31,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650538964] [2019-10-13 21:33:31,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:31,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:31,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075415585] [2019-10-13 21:33:31,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:31,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:31,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:31,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:31,933 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-10-13 21:33:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:31,975 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2019-10-13 21:33:31,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:31,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 21:33:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:31,988 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:33:31,989 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:33:31,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:33:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:33:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:33:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-13 21:33:32,039 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2019-10-13 21:33:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:32,040 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-13 21:33:32,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-10-13 21:33:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:33:32,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,041 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,042 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,042 INFO L82 PathProgramCache]: Analyzing trace with hash 309375907, now seen corresponding path program 1 times [2019-10-13 21:33:32,043 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860037710] [2019-10-13 21:33:32,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:32,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860037710] [2019-10-13 21:33:32,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:32,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:32,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850275807] [2019-10-13 21:33:32,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:32,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:32,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:32,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:32,106 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 3 states. [2019-10-13 21:33:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:32,149 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2019-10-13 21:33:32,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:32,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:33:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:32,152 INFO L225 Difference]: With dead ends: 36 [2019-10-13 21:33:32,152 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 21:33:32,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 21:33:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-13 21:33:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:33:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-13 21:33:32,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2019-10-13 21:33:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:32,168 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-13 21:33:32,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-13 21:33:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:33:32,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,169 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,171 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1949160451, now seen corresponding path program 1 times [2019-10-13 21:33:32,172 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626847452] [2019-10-13 21:33:32,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:33:32,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626847452] [2019-10-13 21:33:32,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081780337] [2019-10-13 21:33:32,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:32,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:33:32,410 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:33:32,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1480438235] [2019-10-13 21:33:32,476 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:32,476 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:32,483 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:32,492 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:32,493 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:32,687 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:34,031 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:34,121 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:34,140 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:34,148 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:34,149 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:34,149 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,149 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,150 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,150 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:34,150 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,151 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:34,151 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,151 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,152 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:34,152 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:34,152 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:34,153 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:34,153 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-13 21:33:34,153 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,153 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) [2019-10-13 21:33:34,154 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:34,466 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:34,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:34,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345110727] [2019-10-13 21:33:34,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:34,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:34,470 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 18 states. [2019-10-13 21:33:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:35,244 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2019-10-13 21:33:35,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:35,245 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-10-13 21:33:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:35,246 INFO L225 Difference]: With dead ends: 57 [2019-10-13 21:33:35,246 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 21:33:35,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 21:33:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-10-13 21:33:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 21:33:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-13 21:33:35,256 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 20 [2019-10-13 21:33:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:35,256 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-13 21:33:35,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-13 21:33:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:33:35,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:35,257 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:35,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:35,463 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:35,463 INFO L82 PathProgramCache]: Analyzing trace with hash -519859613, now seen corresponding path program 2 times [2019-10-13 21:33:35,463 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:35,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616883017] [2019-10-13 21:33:35,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:35,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:35,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:33:35,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616883017] [2019-10-13 21:33:35,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717174217] [2019-10-13 21:33:35,596 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:35,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:35,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:35,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:35,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:33:35,704 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:33:35,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [805460824] [2019-10-13 21:33:35,737 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:35,738 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:35,738 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:35,738 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:35,739 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:35,769 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:36,155 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:36,822 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:36,833 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:36,836 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:36,837 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:36,838 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:36,838 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,838 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) (<= __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-13 21:33:36,838 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:36,838 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,839 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:36,840 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) (<= __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-13 21:33:36,840 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,840 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,840 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,841 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,844 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:36,844 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-13 21:33:36,845 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,845 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) [2019-10-13 21:33:36,845 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:37,180 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:37,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-13 21:33:37,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974745729] [2019-10-13 21:33:37,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:37,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:37,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:37,183 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 23 states. [2019-10-13 21:33:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:38,085 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-10-13 21:33:38,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:33:38,085 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-10-13 21:33:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:38,086 INFO L225 Difference]: With dead ends: 78 [2019-10-13 21:33:38,087 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 21:33:38,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:33:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 21:33:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-10-13 21:33:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 21:33:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-10-13 21:33:38,098 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 27 [2019-10-13 21:33:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:38,098 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-10-13 21:33:38,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-10-13 21:33:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 21:33:38,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:38,100 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:38,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:38,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:38,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:38,312 INFO L82 PathProgramCache]: Analyzing trace with hash -122686685, now seen corresponding path program 3 times [2019-10-13 21:33:38,312 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:38,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915484935] [2019-10-13 21:33:38,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:38,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915484935] [2019-10-13 21:33:38,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416134349] [2019-10-13 21:33:38,479 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:38,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:38,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:38,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:33:38,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 21:33:38,655 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 21:33:38,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1728353559] [2019-10-13 21:33:38,750 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:38,750 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:38,750 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:38,751 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:38,751 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:38,787 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:39,696 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:39,703 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:39,706 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:39,706 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:39,706 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:39,706 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,707 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_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-13 21:33:39,707 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:39,707 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,707 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:39,708 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_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-13 21:33:39,708 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,708 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:39,708 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:39,708 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:39,709 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:39,709 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-13 21:33:39,709 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:39,709 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) [2019-10-13 21:33:39,709 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:40,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:40,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 31 [2019-10-13 21:33:40,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903189149] [2019-10-13 21:33:40,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:33:40,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:40,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:33:40,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:40,033 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 31 states. [2019-10-13 21:33:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:41,285 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2019-10-13 21:33:41,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:33:41,285 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2019-10-13 21:33:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:41,287 INFO L225 Difference]: With dead ends: 105 [2019-10-13 21:33:41,287 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 21:33:41,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-10-13 21:33:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 21:33:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-10-13 21:33:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 21:33:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2019-10-13 21:33:41,301 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 44 [2019-10-13 21:33:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:41,301 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2019-10-13 21:33:41,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:33:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2019-10-13 21:33:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:33:41,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:41,303 INFO L380 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:41,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:41,513 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:41,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:41,514 INFO L82 PathProgramCache]: Analyzing trace with hash 444261821, now seen corresponding path program 4 times [2019-10-13 21:33:41,514 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:41,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466151393] [2019-10-13 21:33:41,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:41,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:41,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-13 21:33:41,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466151393] [2019-10-13 21:33:41,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648718481] [2019-10-13 21:33:41,700 INFO L92 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-13 21:33:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:41,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:33:41,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:33:41,988 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:33:42,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [714648804] [2019-10-13 21:33:42,316 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:42,317 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:42,317 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:42,317 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:42,318 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:42,353 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:43,200 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:43,208 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:43,211 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:43,213 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:43,213 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:43,214 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,214 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:43,214 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:43,214 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,214 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:43,215 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:43,215 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,215 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:43,215 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:43,216 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:43,216 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:43,216 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-13 21:33:43,216 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,216 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:33:43,217 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:43,574 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:43,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15, 11] total 46 [2019-10-13 21:33:43,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724299073] [2019-10-13 21:33:43,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-13 21:33:43,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:43,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-13 21:33:43,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1619, Unknown=0, NotChecked=0, Total=2070 [2019-10-13 21:33:43,579 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 46 states. [2019-10-13 21:33:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:45,547 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2019-10-13 21:33:45,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-13 21:33:45,548 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55 [2019-10-13 21:33:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:45,549 INFO L225 Difference]: With dead ends: 127 [2019-10-13 21:33:45,549 INFO L226 Difference]: Without dead ends: 86 [2019-10-13 21:33:45,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1363, Invalid=6119, Unknown=0, NotChecked=0, Total=7482 [2019-10-13 21:33:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-13 21:33:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2019-10-13 21:33:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-13 21:33:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-13 21:33:45,565 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 55 [2019-10-13 21:33:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:45,565 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-13 21:33:45,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-13 21:33:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-13 21:33:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 21:33:45,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:45,568 INFO L380 BasicCegarLoop]: trace histogram [26, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:45,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:45,778 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1175045661, now seen corresponding path program 5 times [2019-10-13 21:33:45,779 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:45,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796262187] [2019-10-13 21:33:45,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-13 21:33:46,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796262187] [2019-10-13 21:33:46,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484737785] [2019-10-13 21:33:46,045 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:49,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:49,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:49,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 21:33:49,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-13 21:33:49,810 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-10-13 21:33:49,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [476032832] [2019-10-13 21:33:49,967 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:49,967 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:49,967 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:49,967 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:49,967 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:49,986 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:50,887 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:50,894 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:50,897 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:50,897 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:50,897 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:50,898 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,898 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) (<= __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-13 21:33:50,898 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:50,898 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,899 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:50,899 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) (<= __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-13 21:33:50,899 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,900 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:50,900 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-13 21:33:50,900 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:50,900 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:50,901 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-13 21:33:50,901 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,901 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) [2019-10-13 21:33:50,902 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:51,208 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:51,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 31 [2019-10-13 21:33:51,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877809766] [2019-10-13 21:33:51,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:33:51,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:51,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:33:51,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:51,214 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 31 states. [2019-10-13 21:33:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:52,733 INFO L93 Difference]: Finished difference Result 162 states and 210 transitions. [2019-10-13 21:33:52,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:33:52,733 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 73 [2019-10-13 21:33:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:52,735 INFO L225 Difference]: With dead ends: 162 [2019-10-13 21:33:52,736 INFO L226 Difference]: Without dead ends: 126 [2019-10-13 21:33:52,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=736, Invalid=2456, Unknown=0, NotChecked=0, Total=3192 [2019-10-13 21:33:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-13 21:33:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-10-13 21:33:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-13 21:33:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2019-10-13 21:33:52,754 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 73 [2019-10-13 21:33:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:52,755 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2019-10-13 21:33:52,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:33:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2019-10-13 21:33:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:33:52,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:52,757 INFO L380 BasicCegarLoop]: trace histogram [26, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:52,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:52,965 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:52,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1972973981, now seen corresponding path program 6 times [2019-10-13 21:33:52,966 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:52,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59338822] [2019-10-13 21:33:52,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2019-10-13 21:33:53,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59338822] [2019-10-13 21:33:53,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665374498] [2019-10-13 21:33:53,602 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:53,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:53,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:53,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 21:33:53,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-13 21:33:54,478 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-13 21:33:55,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2059247235] [2019-10-13 21:33:55,530 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:55,531 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:55,531 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:55,531 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:55,532 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:55,552 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:56,484 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:56,492 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:56,495 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:56,495 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:56,495 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:56,495 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,495 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= __VERIFIER_assert_~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-13 21:33:56,495 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= __VERIFIER_assert_~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-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-13 21:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) [2019-10-13 21:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:56,977 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:56,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29, 29, 11] total 85 [2019-10-13 21:33:56,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305931450] [2019-10-13 21:33:56,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-13 21:33:56,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:56,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-13 21:33:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1778, Invalid=5362, Unknown=0, NotChecked=0, Total=7140 [2019-10-13 21:33:56,983 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 85 states. [2019-10-13 21:34:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:01,943 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2019-10-13 21:34:01,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-13 21:34:01,944 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 113 [2019-10-13 21:34:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:01,946 INFO L225 Difference]: With dead ends: 243 [2019-10-13 21:34:01,946 INFO L226 Difference]: Without dead ends: 158 [2019-10-13 21:34:01,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6399 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5366, Invalid=21694, Unknown=0, NotChecked=0, Total=27060 [2019-10-13 21:34:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-13 21:34:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2019-10-13 21:34:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-13 21:34:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 154 transitions. [2019-10-13 21:34:01,972 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 154 transitions. Word has length 113 [2019-10-13 21:34:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:01,973 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 154 transitions. [2019-10-13 21:34:01,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-13 21:34:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 154 transitions. [2019-10-13 21:34:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:34:01,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:01,976 INFO L380 BasicCegarLoop]: trace histogram [54, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:02,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:02,181 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash -95848259, now seen corresponding path program 7 times [2019-10-13 21:34:02,182 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:02,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857526054] [2019-10-13 21:34:02,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:02,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:02,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2055 trivial. 0 not checked. [2019-10-13 21:34:02,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857526054] [2019-10-13 21:34:02,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073832529] [2019-10-13 21:34:02,877 INFO L92 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-13 21:34:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:03,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-13 21:34:03,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-10-13 21:34:04,708 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-10-13 21:34:08,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1312316461] [2019-10-13 21:34:08,542 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:34:08,543 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:08,543 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:08,543 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:08,543 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:08,579 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:09,388 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:09,396 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:09,398 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:09,399 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27))))))) [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27))))))) [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,400 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:09,400 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27))))))) [2019-10-13 21:34:09,400 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,400 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:09,400 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:09,400 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:09,400 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:09,401 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-13 21:34:09,401 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,401 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) [2019-10-13 21:34:09,401 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:34:10,033 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:10,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 57, 57, 11] total 142 [2019-10-13 21:34:10,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274903642] [2019-10-13 21:34:10,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-10-13 21:34:10,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:10,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-10-13 21:34:10,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6475, Invalid=13547, Unknown=0, NotChecked=0, Total=20022 [2019-10-13 21:34:10,040 INFO L87 Difference]: Start difference. First operand 149 states and 154 transitions. Second operand 142 states.