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/sorting_bubblesort_2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:40,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:40,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:40,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:40,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:40,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:40,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:40,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:40,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:40,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:40,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:40,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:40,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:40,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:40,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:40,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:40,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:40,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:40,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:40,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:40,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:40,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:40,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:40,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:40,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:40,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:40,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:40,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:40,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:40,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:40,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:40,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:40,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:40,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:40,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:40,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:40,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:40,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:40,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:40,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:40,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:40,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:32:40,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:40,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:40,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:40,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:40,562 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:40,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:40,562 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:40,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:40,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:40,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:40,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:40,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:40,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:40,564 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:40,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:40,564 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:40,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:40,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:40,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:40,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:40,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:40,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:40,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:40,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:40,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:40,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:40,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:40,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:40,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:32:40,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:40,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:40,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:40,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:40,877 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:40,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_2_ground.i [2019-10-13 21:32:40,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cade0fb1/6a4d876573a442edbb4cf7b2856681b6/FLAGcea6f964c [2019-10-13 21:32:41,370 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:41,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_2_ground.i [2019-10-13 21:32:41,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cade0fb1/6a4d876573a442edbb4cf7b2856681b6/FLAGcea6f964c [2019-10-13 21:32:41,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cade0fb1/6a4d876573a442edbb4cf7b2856681b6 [2019-10-13 21:32:41,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:41,789 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:41,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:41,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:41,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:41,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:41" (1/1) ... [2019-10-13 21:32:41,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54268d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:41, skipping insertion in model container [2019-10-13 21:32:41,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:41" (1/1) ... [2019-10-13 21:32:41,807 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:41,825 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:42,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:42,022 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:42,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:42,168 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:42,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42 WrapperNode [2019-10-13 21:32:42,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:42,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:42,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:42,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:42,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:42,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:42,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:42,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:42,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:42,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:42,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:42,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:42,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:42,664 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:42,664 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 21:32:42,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:42 BoogieIcfgContainer [2019-10-13 21:32:42,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:42,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:42,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:42,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:42,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:41" (1/3) ... [2019-10-13 21:32:42,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1107e8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:42, skipping insertion in model container [2019-10-13 21:32:42,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (2/3) ... [2019-10-13 21:32:42,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1107e8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:42, skipping insertion in model container [2019-10-13 21:32:42,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:42" (3/3) ... [2019-10-13 21:32:42,674 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_2_ground.i [2019-10-13 21:32:42,691 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:42,708 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:42,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:42,749 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:42,750 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:42,750 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:42,750 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:42,750 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:42,750 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:42,750 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:42,751 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 21:32:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:42,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:42,775 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:42,776 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:42,780 INFO L82 PathProgramCache]: Analyzing trace with hash -573825775, now seen corresponding path program 1 times [2019-10-13 21:32:42,787 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:42,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032921871] [2019-10-13 21:32:42,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:42,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:42,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:42,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032921871] [2019-10-13 21:32:42,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:42,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:42,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139330164] [2019-10-13 21:32:42,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:42,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:43,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:43,006 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-13 21:32:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:43,049 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-13 21:32:43,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:43,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:32:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:43,058 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:32:43,058 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 21:32:43,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 21:32:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 21:32:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 21:32:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-13 21:32:43,099 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2019-10-13 21:32:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:43,100 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-13 21:32:43,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-13 21:32:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:43,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:43,102 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1140036509, now seen corresponding path program 1 times [2019-10-13 21:32:43,103 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:43,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604843068] [2019-10-13 21:32:43,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:43,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604843068] [2019-10-13 21:32:43,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:43,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:43,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443483825] [2019-10-13 21:32:43,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:43,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:43,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:43,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:43,152 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-10-13 21:32:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:43,184 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-13 21:32:43,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:43,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:32:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:43,189 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:32:43,189 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:32:43,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:32:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:32:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:32:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 21:32:43,203 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-13 21:32:43,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:43,204 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 21:32:43,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 21:32:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:32:43,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,207 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:43,208 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:43,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:43,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1123124524, now seen corresponding path program 1 times [2019-10-13 21:32:43,209 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:43,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579479933] [2019-10-13 21:32:43,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:43,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579479933] [2019-10-13 21:32:43,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:43,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:43,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638597896] [2019-10-13 21:32:43,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:43,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:43,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:43,297 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 21:32:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:43,317 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-10-13 21:32:43,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:43,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:32:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:43,320 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:32:43,320 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:32:43,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:32:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:32:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:32:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 21:32:43,330 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2019-10-13 21:32:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:43,330 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 21:32:43,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 21:32:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:32:43,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:43,333 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:43,333 INFO L82 PathProgramCache]: Analyzing trace with hash -685002894, now seen corresponding path program 1 times [2019-10-13 21:32:43,334 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:43,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46476775] [2019-10-13 21:32:43,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:43,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46476775] [2019-10-13 21:32:43,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923777583] [2019-10-13 21:32:43,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:43,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:43,511 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:43,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2010626665] [2019-10-13 21:32:43,570 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:43,571 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:43,577 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:43,586 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:43,587 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:43,761 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:44,245 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:44,271 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:44,283 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:44,283 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:44,283 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:44,284 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:44,285 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:44,286 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:44,287 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-13 21:32:44,287 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:32:44,288 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:44,288 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:44,289 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,289 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,290 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:44,290 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,291 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:44,292 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:32:44,292 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:44,832 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:44,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 13] total 19 [2019-10-13 21:32:44,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223518531] [2019-10-13 21:32:44,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:32:44,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:44,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:32:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:32:44,840 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 19 states. [2019-10-13 21:32:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:45,703 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-10-13 21:32:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:32:45,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2019-10-13 21:32:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:45,709 INFO L225 Difference]: With dead ends: 51 [2019-10-13 21:32:45,709 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 21:32:45,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 21:32:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 21:32:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-10-13 21:32:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 21:32:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-13 21:32:45,726 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2019-10-13 21:32:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:45,727 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-13 21:32:45,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:32:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-13 21:32:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:32:45,728 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:45,728 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:45,931 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:45,932 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash -143319426, now seen corresponding path program 2 times [2019-10-13 21:32:45,932 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:45,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600353808] [2019-10-13 21:32:45,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:45,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:45,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:46,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600353808] [2019-10-13 21:32:46,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516099517] [2019-10-13 21:32:46,016 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:32:46,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:32:46,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:46,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:32:46,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:46,089 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:46,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [934104050] [2019-10-13 21:32:46,157 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:46,158 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:46,158 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:46,158 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:46,159 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:46,205 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:46,480 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:46,489 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:46,494 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:46,494 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:46,494 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_3 Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:46,495 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_3 Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:46,495 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_3 Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:46,495 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:46,496 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-13 21:32:46,496 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:32:46,496 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:46,496 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:46,497 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:46,497 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:46,497 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:46,497 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:46,498 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:46,498 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_3 Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4))))))) [2019-10-13 21:32:46,498 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:46,946 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:46,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 13] total 25 [2019-10-13 21:32:46,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757235394] [2019-10-13 21:32:46,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:32:46,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:46,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:32:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:32:46,951 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 25 states. [2019-10-13 21:32:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:47,932 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2019-10-13 21:32:47,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:32:47,934 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2019-10-13 21:32:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:47,935 INFO L225 Difference]: With dead ends: 59 [2019-10-13 21:32:47,935 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 21:32:47,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 21:32:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 21:32:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-10-13 21:32:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:32:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-13 21:32:47,946 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2019-10-13 21:32:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:47,947 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-13 21:32:47,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:32:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-13 21:32:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:32:47,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:47,948 INFO L380 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:48,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:48,153 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:48,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:48,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1928611330, now seen corresponding path program 3 times [2019-10-13 21:32:48,154 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:48,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939729414] [2019-10-13 21:32:48,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:48,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939729414] [2019-10-13 21:32:48,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095301905] [2019-10-13 21:32:48,301 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:32:48,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:32:48,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:48,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:32:48,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:48,395 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:48,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1616851649] [2019-10-13 21:32:48,625 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:48,625 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:48,625 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:48,626 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:48,626 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:48,658 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:48,875 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:48,883 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:48,887 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:48,887 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:48,888 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:48,888 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:48,888 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:48,888 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:48,888 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-13 21:32:48,889 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:32:48,889 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:48,889 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:48,889 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:48,889 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:48,890 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:48,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:48,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:48,890 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4))))))) [2019-10-13 21:32:48,890 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:49,452 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:49,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13] total 37 [2019-10-13 21:32:49,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105849454] [2019-10-13 21:32:49,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-13 21:32:49,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:49,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-13 21:32:49,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 21:32:49,456 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 37 states. [2019-10-13 21:32:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:50,906 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2019-10-13 21:32:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-13 21:32:50,907 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 26 [2019-10-13 21:32:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:50,908 INFO L225 Difference]: With dead ends: 71 [2019-10-13 21:32:50,909 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 21:32:50,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=974, Invalid=3718, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:32:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 21:32:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2019-10-13 21:32:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 21:32:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-13 21:32:50,922 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 26 [2019-10-13 21:32:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:50,922 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-13 21:32:50,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-13 21:32:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-13 21:32:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 21:32:50,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:50,924 INFO L380 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:51,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:51,135 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:51,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1848185086, now seen corresponding path program 4 times [2019-10-13 21:32:51,136 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:51,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632923194] [2019-10-13 21:32:51,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:51,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632923194] [2019-10-13 21:32:51,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399250018] [2019-10-13 21:32:51,607 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:32:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:32:51,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:51,758 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:52,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [927402673] [2019-10-13 21:32:52,453 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:52,453 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:52,454 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:52,454 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:52,454 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:52,497 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:52,657 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:52,664 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:52,672 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:52,672 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:52,672 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_7) v_prenex_8) (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:52,673 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_7) v_prenex_8) (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:52,673 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_7) v_prenex_8) (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:52,673 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:52,673 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-13 21:32:52,673 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:32:52,674 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:52,674 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:52,674 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,674 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,675 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:52,675 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,675 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:52,676 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_7) v_prenex_8) (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4))))))) [2019-10-13 21:32:52,676 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:53,320 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:53,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 13] total 61 [2019-10-13 21:32:53,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148306079] [2019-10-13 21:32:53,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 21:32:53,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 21:32:53,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1215, Invalid=2445, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:32:53,325 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 61 states. [2019-10-13 21:32:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:56,302 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2019-10-13 21:32:56,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-13 21:32:56,302 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 38 [2019-10-13 21:32:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:56,303 INFO L225 Difference]: With dead ends: 95 [2019-10-13 21:32:56,303 INFO L226 Difference]: Without dead ends: 79 [2019-10-13 21:32:56,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3227 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3554, Invalid=10018, Unknown=0, NotChecked=0, Total=13572 [2019-10-13 21:32:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-13 21:32:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2019-10-13 21:32:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 21:32:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-13 21:32:56,319 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 38 [2019-10-13 21:32:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:56,320 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-13 21:32:56,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 21:32:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-13 21:32:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 21:32:56,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:56,321 INFO L380 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:56,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:56,528 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:56,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:56,529 INFO L82 PathProgramCache]: Analyzing trace with hash 390348542, now seen corresponding path program 5 times [2019-10-13 21:32:56,529 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:56,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292304507] [2019-10-13 21:32:56,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:56,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:56,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:57,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292304507] [2019-10-13 21:32:57,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769631718] [2019-10-13 21:32:57,565 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:57,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:32:57,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:57,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:57,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:32:57,732 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:32:57,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2062111800] [2019-10-13 21:32:57,791 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:57,791 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:57,791 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:57,791 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:57,791 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:57,813 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:57,950 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:57,957 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:57,962 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:57,962 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:57,962 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:57,963 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:57,963 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:57,963 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:57,964 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-13 21:32:57,964 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:32:57,964 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:57,964 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:57,965 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:57,965 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:57,965 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:32:57,965 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:57,965 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:57,966 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) [2019-10-13 21:32:57,966 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:58,747 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:58,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 4, 4, 13] total 65 [2019-10-13 21:32:58,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585871681] [2019-10-13 21:32:58,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-13 21:32:58,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-13 21:32:58,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=2931, Unknown=0, NotChecked=0, Total=4160 [2019-10-13 21:32:58,751 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 65 states. [2019-10-13 21:33:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:02,639 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-10-13 21:33:02,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-13 21:33:02,640 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 62 [2019-10-13 21:33:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:02,641 INFO L225 Difference]: With dead ends: 99 [2019-10-13 21:33:02,641 INFO L226 Difference]: Without dead ends: 83 [2019-10-13 21:33:02,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2962 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3699, Invalid=12051, Unknown=0, NotChecked=0, Total=15750 [2019-10-13 21:33:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-13 21:33:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2019-10-13 21:33:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 21:33:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-10-13 21:33:02,657 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 62 [2019-10-13 21:33:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:02,658 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-10-13 21:33:02,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-13 21:33:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-10-13 21:33:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:33:02,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:02,660 INFO L380 BasicCegarLoop]: trace histogram [47, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:02,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:02,863 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:02,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:02,864 INFO L82 PathProgramCache]: Analyzing trace with hash 973546540, now seen corresponding path program 6 times [2019-10-13 21:33:02,864 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:02,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528686212] [2019-10-13 21:33:02,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:02,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:02,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:03,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528686212] [2019-10-13 21:33:03,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27191411] [2019-10-13 21:33:03,861 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:03,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:03,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:03,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:33:04,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:04,025 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:06,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [22256468] [2019-10-13 21:33:06,654 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:06,654 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:06,655 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:06,655 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:06,655 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:06,679 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:06,814 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:33:06,819 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:06,826 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:06,826 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:06,826 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:06,826 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:06,827 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:06,827 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:06,827 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-13 21:33:06,827 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:33:06,827 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:06,828 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:06,828 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:06,828 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:33:06,828 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:06,828 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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:06,828 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:06,829 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) [2019-10-13 21:33:06,829 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:33:07,522 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:07,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50, 13] total 111 [2019-10-13 21:33:07,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237779765] [2019-10-13 21:33:07,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-13 21:33:07,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:07,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-13 21:33:07,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4890, Invalid=7320, Unknown=0, NotChecked=0, Total=12210 [2019-10-13 21:33:07,529 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 111 states. [2019-10-13 21:33:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:14,938 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2019-10-13 21:33:14,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-13 21:33:14,939 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 66 [2019-10-13 21:33:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:14,941 INFO L225 Difference]: With dead ends: 151 [2019-10-13 21:33:14,941 INFO L226 Difference]: Without dead ends: 132 [2019-10-13 21:33:14,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9652 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=14479, Invalid=32393, Unknown=0, NotChecked=0, Total=46872 [2019-10-13 21:33:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-13 21:33:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2019-10-13 21:33:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-13 21:33:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2019-10-13 21:33:14,963 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 66 [2019-10-13 21:33:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:14,964 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2019-10-13 21:33:14,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-13 21:33:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2019-10-13 21:33:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:33:14,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:14,966 INFO L380 BasicCegarLoop]: trace histogram [96, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:15,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:15,170 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash 734515488, now seen corresponding path program 7 times [2019-10-13 21:33:15,172 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:15,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348069754] [2019-10-13 21:33:15,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:15,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:15,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4667 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:18,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348069754] [2019-10-13 21:33:18,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005306198] [2019-10-13 21:33:18,793 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:33:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:18,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-13 21:33:19,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4667 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:19,056 INFO L321 TraceCheckSpWp]: Computing backward predicates...