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_copy7_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:37,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:37,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:37,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:37,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:37,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:37,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:37,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:37,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:37,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:37,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:37,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:37,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:37,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:37,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:37,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:37,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:37,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:37,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:37,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:37,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:37,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:37,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:37,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:37,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:37,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:37,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:37,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:37,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:37,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:37,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:37,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:37,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:37,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:37,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:37,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:37,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:37,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:37,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:37,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:37,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:37,665 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:37,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:37,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:37,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:37,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:37,688 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:37,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:37,689 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:37,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:37,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:37,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:37,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:37,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:37,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:37,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:37,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:37,693 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:37,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:37,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:37,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:37,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:37,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:37,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:37,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:37,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:37,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:37,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:37,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:37,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:37,697 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:37,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:37,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:37,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:37,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:37,995 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:37,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy7_ground-1.i [2019-10-13 21:33:38,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8556bb89a/fa36cadc39ed4ab5bf6dad506bcc7553/FLAGac34f37c8 [2019-10-13 21:33:38,532 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:38,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy7_ground-1.i [2019-10-13 21:33:38,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8556bb89a/fa36cadc39ed4ab5bf6dad506bcc7553/FLAGac34f37c8 [2019-10-13 21:33:38,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8556bb89a/fa36cadc39ed4ab5bf6dad506bcc7553 [2019-10-13 21:33:38,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:38,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:38,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:38,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:38,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:38,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:38" (1/1) ... [2019-10-13 21:33:38,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472088b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:38, skipping insertion in model container [2019-10-13 21:33:38,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:38" (1/1) ... [2019-10-13 21:33:38,904 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:38,921 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:39,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:39,112 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:39,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:39,240 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:39,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39 WrapperNode [2019-10-13 21:33:39,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:39,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:39,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:39,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:39,253 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:39" (1/1) ... [2019-10-13 21:33:39,253 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:39" (1/1) ... [2019-10-13 21:33:39,261 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:39" (1/1) ... [2019-10-13 21:33:39,261 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:39" (1/1) ... [2019-10-13 21:33:39,272 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:39" (1/1) ... [2019-10-13 21:33:39,282 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:39" (1/1) ... [2019-10-13 21:33:39,284 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:39" (1/1) ... [2019-10-13 21:33:39,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:39,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:39,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:39,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:39,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (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:39,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:39,885 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:39,885 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-13 21:33:39,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:39 BoogieIcfgContainer [2019-10-13 21:33:39,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:39,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:39,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:39,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:39,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:38" (1/3) ... [2019-10-13 21:33:39,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9bc320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:39, skipping insertion in model container [2019-10-13 21:33:39,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:39" (2/3) ... [2019-10-13 21:33:39,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9bc320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:39, skipping insertion in model container [2019-10-13 21:33:39,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:39" (3/3) ... [2019-10-13 21:33:39,896 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy7_ground-1.i [2019-10-13 21:33:39,905 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:39,916 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:39,927 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:39,953 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:39,953 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:39,953 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:39,953 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:39,954 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:39,954 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:39,954 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:39,954 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-13 21:33:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:33:39,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:39,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:39,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:39,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1960828359, now seen corresponding path program 1 times [2019-10-13 21:33:39,987 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:39,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753373996] [2019-10-13 21:33:39,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:40,171 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:40,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753373996] [2019-10-13 21:33:40,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:40,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:40,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236575486] [2019-10-13 21:33:40,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:40,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:40,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:40,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:40,196 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-13 21:33:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:40,235 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-10-13 21:33:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:40,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:33:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:40,248 INFO L225 Difference]: With dead ends: 45 [2019-10-13 21:33:40,248 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 21:33:40,252 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:40,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 21:33:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-13 21:33:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 21:33:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-10-13 21:33:40,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2019-10-13 21:33:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:40,298 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-13 21:33:40,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-10-13 21:33:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:33:40,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:40,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:40,300 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:40,301 INFO L82 PathProgramCache]: Analyzing trace with hash 204960146, now seen corresponding path program 1 times [2019-10-13 21:33:40,301 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:40,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91304896] [2019-10-13 21:33:40,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:40,384 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:40,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91304896] [2019-10-13 21:33:40,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:40,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:40,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364345592] [2019-10-13 21:33:40,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:40,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:40,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:40,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:40,391 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-10-13 21:33:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:40,465 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-10-13 21:33:40,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:40,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:33:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:40,468 INFO L225 Difference]: With dead ends: 45 [2019-10-13 21:33:40,468 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 21:33:40,469 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:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 21:33:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-13 21:33:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:33:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-10-13 21:33:40,484 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 19 [2019-10-13 21:33:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:40,485 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-13 21:33:40,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-10-13 21:33:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:33:40,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:40,488 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, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:40,488 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1587201211, now seen corresponding path program 1 times [2019-10-13 21:33:40,489 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:40,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516564676] [2019-10-13 21:33:40,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:40,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:33:40,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516564676] [2019-10-13 21:33:40,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958355884] [2019-10-13 21:33:40,621 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:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:40,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:40,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:33:40,775 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:33:40,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [981191354] [2019-10-13 21:33:40,881 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:33:40,881 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:40,895 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:40,902 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:40,903 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:41,080 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:42,116 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:43,101 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:43,114 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:43,119 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:43,119 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:43,120 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-13 21:33:43,120 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:43,121 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,121 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:43,121 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:43,121 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,122 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,122 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,122 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,122 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,123 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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,123 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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,123 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:43,123 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:43,124 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,125 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a8~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_1|) |v_main_~#a8~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) [2019-10-13 21:33:43,125 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,126 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem19|) (<= 0 main_~x~0)) [2019-10-13 21:33:43,452 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:43,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:43,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470267313] [2019-10-13 21:33:43,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:43,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:43,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:43,456 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 18 states. [2019-10-13 21:33:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:44,188 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2019-10-13 21:33:44,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:44,188 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-10-13 21:33:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:44,190 INFO L225 Difference]: With dead ends: 72 [2019-10-13 21:33:44,190 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 21:33:44,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 21:33:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2019-10-13 21:33:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 21:33:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-13 21:33:44,200 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 26 [2019-10-13 21:33:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:44,201 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-13 21:33:44,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-13 21:33:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 21:33:44,202 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:44,202 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:44,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:44,408 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1965201305, now seen corresponding path program 2 times [2019-10-13 21:33:44,409 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:44,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687520553] [2019-10-13 21:33:44,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:44,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:44,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:44,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687520553] [2019-10-13 21:33:44,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881093993] [2019-10-13 21:33:44,580 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:44,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:44,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:44,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:44,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:44,711 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:44,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1756689431] [2019-10-13 21:33:44,749 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:33:44,749 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:44,750 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:44,750 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:44,750 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:44,786 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:45,190 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:45,434 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:46,375 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:46,381 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:46,384 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:46,384 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:46,384 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-13 21:33:46,385 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(and (exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:46,385 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,385 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:46,385 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:46,386 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,386 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,386 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,386 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:46,387 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:46,387 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:46,387 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:46,388 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:46,388 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,388 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:46,388 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,388 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(exists ((|v_main_~#a8~0.base_BEFORE_CALL_2| Int) (v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_2|) |v_main_~#a8~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_8) (select (select |#memory_int| v_prenex_6) v_prenex_7)))))) [2019-10-13 21:33:46,389 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,389 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem19|) (<= 0 main_~x~0)) [2019-10-13 21:33:46,658 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:46,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-13 21:33:46,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842773633] [2019-10-13 21:33:46,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:33:46,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:33:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:33:46,661 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 19 states. [2019-10-13 21:33:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:47,515 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2019-10-13 21:33:47,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:47,516 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-10-13 21:33:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:47,518 INFO L225 Difference]: With dead ends: 104 [2019-10-13 21:33:47,518 INFO L226 Difference]: Without dead ends: 77 [2019-10-13 21:33:47,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:33:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-13 21:33:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2019-10-13 21:33:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 21:33:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2019-10-13 21:33:47,532 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 36 [2019-10-13 21:33:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:47,533 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2019-10-13 21:33:47,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:33:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2019-10-13 21:33:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 21:33:47,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:47,535 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:47,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:47,747 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:47,748 INFO L82 PathProgramCache]: Analyzing trace with hash -412271143, now seen corresponding path program 3 times [2019-10-13 21:33:47,749 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:47,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817999427] [2019-10-13 21:33:47,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:47,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:47,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-13 21:33:48,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817999427] [2019-10-13 21:33:48,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032232922] [2019-10-13 21:33:48,066 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:48,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:48,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:48,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:48,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-13 21:33:48,253 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-13 21:33:48,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [75661418] [2019-10-13 21:33:48,332 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:33:48,333 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:48,333 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:48,333 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:48,334 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:48,349 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:49,775 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:49,782 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:49,785 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:49,785 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:49,785 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-13 21:33:49,785 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~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| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:49,786 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:49,786 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~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| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:49,786 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:49,786 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:49,786 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:49,786 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:49,787 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:49,787 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:49,787 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:49,787 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:49,787 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~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| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:49,788 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:49,788 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:49,788 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:49,788 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a8~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a8~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| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_3|) |v_main_~#a8~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) [2019-10-13 21:33:49,788 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:49,789 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem19|) (<= 0 main_~x~0)) [2019-10-13 21:33:50,097 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:50,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 29 [2019-10-13 21:33:50,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181043405] [2019-10-13 21:33:50,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:33:50,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:33:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:33:50,101 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 29 states. [2019-10-13 21:33:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:51,382 INFO L93 Difference]: Finished difference Result 148 states and 176 transitions. [2019-10-13 21:33:51,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 21:33:51,383 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2019-10-13 21:33:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:51,385 INFO L225 Difference]: With dead ends: 148 [2019-10-13 21:33:51,385 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 21:33:51,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=398, Invalid=2358, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 21:33:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 21:33:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-10-13 21:33:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 21:33:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-10-13 21:33:51,400 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 64 [2019-10-13 21:33:51,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:51,401 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-10-13 21:33:51,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:33:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-10-13 21:33:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:33:51,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:51,403 INFO L380 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:51,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:51,607 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1445740364, now seen corresponding path program 4 times [2019-10-13 21:33:51,608 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:51,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266996448] [2019-10-13 21:33:51,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:51,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:51,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-13 21:33:51,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266996448] [2019-10-13 21:33:51,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104251853] [2019-10-13 21:33:51,759 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:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:51,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:51,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-13 21:33:51,915 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-13 21:33:52,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [670994850] [2019-10-13 21:33:52,139 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:33:52,139 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:52,140 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:52,140 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:52,141 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:52,158 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:53,576 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:53,581 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:53,584 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:53,584 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:53,585 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-13 21:33:53,585 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(and (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:53,585 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,585 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:53,585 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:53,586 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,586 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,586 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,586 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:53,586 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:53,586 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:53,587 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:53,587 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:53,587 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:53,587 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,588 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,588 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a8~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a8~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a8~0.base_BEFORE_CALL_4|) |v_main_~#a8~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_15))))) [2019-10-13 21:33:53,588 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,588 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem19|) (<= 0 main_~x~0)) [2019-10-13 21:33:53,876 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:53,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-13 21:33:53,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118082256] [2019-10-13 21:33:53,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:33:53,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:53,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:33:53,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:33:53,879 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 35 states. [2019-10-13 21:33:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:55,098 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2019-10-13 21:33:55,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:33:55,099 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2019-10-13 21:33:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:55,101 INFO L225 Difference]: With dead ends: 167 [2019-10-13 21:33:55,101 INFO L226 Difference]: Without dead ends: 102 [2019-10-13 21:33:55,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:33:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-13 21:33:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2019-10-13 21:33:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-13 21:33:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2019-10-13 21:33:55,117 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 77 [2019-10-13 21:33:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:55,118 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2019-10-13 21:33:55,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:33:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2019-10-13 21:33:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:33:55,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:55,119 INFO L380 BasicCegarLoop]: trace histogram [22, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:55,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:55,323 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash 210288116, now seen corresponding path program 5 times [2019-10-13 21:33:55,325 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:55,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404639960] [2019-10-13 21:33:55,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:55,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:55,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-13 21:33:55,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404639960] [2019-10-13 21:33:55,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719828056] [2019-10-13 21:33:55,670 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:34:07,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:34:07,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:07,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:34:07,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-13 21:34:07,784 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-13 21:34:07,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [95642588] [2019-10-13 21:34:07,956 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:34:07,956 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:07,957 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:07,957 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:07,957 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:07,974 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:08,253 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [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,393 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:09,395 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:09,396 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:09,396 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-13 21:34:09,396 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~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) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (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_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:09,396 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,397 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~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) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (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_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:09,397 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:09,397 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,397 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,397 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,397 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,398 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:34:09,398 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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,398 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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,398 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~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) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (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_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:09,398 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a8~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) (|v_main_~#a8~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_18) v_prenex_19) (select (select |#memory_int| v_prenex_20) v_prenex_17)))) (and (= (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_~#a8~0.base_BEFORE_CALL_5|) |v_main_~#a8~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,399 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem19|) (<= 0 main_~x~0)) [2019-10-13 21:34:09,805 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:09,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10, 10, 11] total 51 [2019-10-13 21:34:09,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39786050] [2019-10-13 21:34:09,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-13 21:34:09,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-13 21:34:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=2069, Unknown=0, NotChecked=0, Total=2550 [2019-10-13 21:34:09,808 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 51 states. [2019-10-13 21:34:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:12,972 INFO L93 Difference]: Finished difference Result 231 states and 310 transitions. [2019-10-13 21:34:12,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-13 21:34:12,973 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 89 [2019-10-13 21:34:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:12,975 INFO L225 Difference]: With dead ends: 231 [2019-10-13 21:34:12,976 INFO L226 Difference]: Without dead ends: 166 [2019-10-13 21:34:12,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2221 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1469, Invalid=7843, Unknown=0, NotChecked=0, Total=9312 [2019-10-13 21:34:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-13 21:34:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-10-13 21:34:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-13 21:34:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2019-10-13 21:34:12,998 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 89 [2019-10-13 21:34:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:12,999 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2019-10-13 21:34:12,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-13 21:34:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2019-10-13 21:34:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:34:13,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:13,001 INFO L380 BasicCegarLoop]: trace histogram [23, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:13,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:13,202 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:13,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:13,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1540306482, now seen corresponding path program 6 times [2019-10-13 21:34:13,203 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:13,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355646540] [2019-10-13 21:34:13,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:13,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:13,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-13 21:34:13,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355646540] [2019-10-13 21:34:13,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673458208] [2019-10-13 21:34:13,817 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:34:14,125 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:14,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:14,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:34:14,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-13 21:34:14,179 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-13 21:34:14,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [73193663] [2019-10-13 21:34:14,865 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:34:14,865 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:14,866 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:14,866 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:14,866 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:14,883 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:15,910 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:34:16,294 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:16,298 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:16,305 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:16,305 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:16,305 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 72#true [2019-10-13 21:34:16,305 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 393#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (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_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:16,305 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,306 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 398#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (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_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:16,306 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 407#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:16,306 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,306 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,306 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,307 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:16,307 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:16,307 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 378#(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:16,307 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 403#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (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_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:16,307 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#(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:16,308 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:16,308 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,308 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,308 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 388#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a8~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a8~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_21) v_prenex_24))) (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_~#a8~0.base_BEFORE_CALL_6|) |v_main_~#a8~0.offset_BEFORE_CALL_6|)))))) [2019-10-13 21:34:16,308 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,308 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 383#(and (= |main_#t~mem18| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= (select (select |#memory_int| |main_~#a8~0.base|) (+ (* main_~x~0 4) |main_~#a8~0.offset|)) |main_#t~mem19|) (<= 0 main_~x~0)) [2019-10-13 21:34:16,667 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:16,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-13 21:34:16,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628132249] [2019-10-13 21:34:16,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 21:34:16,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:16,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 21:34:16,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:34:16,672 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 61 states. [2019-10-13 21:34:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:19,237 INFO L93 Difference]: Finished difference Result 319 states and 359 transitions. [2019-10-13 21:34:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-13 21:34:19,237 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 153 [2019-10-13 21:34:19,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:19,239 INFO L225 Difference]: With dead ends: 319 [2019-10-13 21:34:19,239 INFO L226 Difference]: Without dead ends: 191 [2019-10-13 21:34:19,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-13 21:34:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-13 21:34:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 182. [2019-10-13 21:34:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-13 21:34:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 190 transitions. [2019-10-13 21:34:19,273 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 190 transitions. Word has length 153 [2019-10-13 21:34:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:19,273 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 190 transitions. [2019-10-13 21:34:19,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 21:34:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 190 transitions. [2019-10-13 21:34:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-13 21:34:19,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:19,276 INFO L380 BasicCegarLoop]: trace histogram [48, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:19,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:19,481 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1436211655, now seen corresponding path program 7 times [2019-10-13 21:34:19,482 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:19,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746019322] [2019-10-13 21:34:19,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:19,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:19,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2128 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-13 21:34:20,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746019322] [2019-10-13 21:34:20,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111627211] [2019-10-13 21:34:20,613 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:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:20,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-13 21:34:20,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2128 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-13 21:34:20,962 INFO L321 TraceCheckSpWp]: Computing backward predicates...