/usr/bin/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 -i ../../../trunk/examples/svcomp/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:24:19,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:24:19,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:24:19,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:24:19,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:24:19,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:24:19,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:24:19,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:24:19,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:24:19,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:24:19,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:24:19,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:24:19,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:24:19,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:24:19,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:24:19,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:24:19,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:24:19,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:24:19,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:24:19,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:24:19,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:24:19,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:24:19,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:24:19,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:24:19,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:24:19,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:24:19,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:24:19,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:24:19,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:24:19,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:24:19,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:24:19,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:24:19,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:24:19,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:24:19,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:24:19,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:24:19,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:24:19,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:24:19,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:24:19,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:24:19,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:24:19,916 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-11-06 21:24:19,938 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:24:19,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:24:19,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:24:19,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:24:19,941 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:24:19,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:24:19,942 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:24:19,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:24:19,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:24:19,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:24:19,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:24:19,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:24:19,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:24:19,944 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:24:19,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:24:19,945 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:24:19,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:24:19,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:24:19,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:24:19,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:24:19,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:24:19,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:24:19,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:24:19,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:24:19,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:24:19,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:24:19,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:24:19,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:24:19,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:24:20,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:24:20,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:24:20,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:24:20,245 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:24:20,245 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:24:20,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2019-11-06 21:24:20,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e24ddf8b/8fe2e977685042e28f76fcf9b36b367f/FLAG778d9fb18 [2019-11-06 21:24:20,733 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:24:20,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2019-11-06 21:24:20,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e24ddf8b/8fe2e977685042e28f76fcf9b36b367f/FLAG778d9fb18 [2019-11-06 21:24:21,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e24ddf8b/8fe2e977685042e28f76fcf9b36b367f [2019-11-06 21:24:21,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:24:21,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:24:21,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:24:21,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:24:21,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:24:21,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:24:21" (1/1) ... [2019-11-06 21:24:21,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630fa84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21, skipping insertion in model container [2019-11-06 21:24:21,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:24:21" (1/1) ... [2019-11-06 21:24:21,181 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:24:21,205 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:24:21,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:24:21,455 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:24:21,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:24:21,584 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:24:21,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21 WrapperNode [2019-11-06 21:24:21,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:24:21,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:24:21,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:24:21,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:24:21,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21" (1/1) ... [2019-11-06 21:24:21,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21" (1/1) ... [2019-11-06 21:24:21,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21" (1/1) ... [2019-11-06 21:24:21,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21" (1/1) ... [2019-11-06 21:24:21,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21" (1/1) ... [2019-11-06 21:24:21,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21" (1/1) ... [2019-11-06 21:24:21,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21" (1/1) ... [2019-11-06 21:24:21,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:24:21,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:24:21,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:24:21,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:24:21,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21" (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-11-06 21:24:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:24:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:24:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 21:24:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:24:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:24:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:24:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 21:24:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:24:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:24:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:24:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:24:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:24:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:24:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:24:21,940 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:24:21,940 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 21:24:21,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:24:21 BoogieIcfgContainer [2019-11-06 21:24:21,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:24:21,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:24:21,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:24:21,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:24:21,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:24:21" (1/3) ... [2019-11-06 21:24:21,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbfdf21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:24:21, skipping insertion in model container [2019-11-06 21:24:21,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:24:21" (2/3) ... [2019-11-06 21:24:21,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbfdf21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:24:21, skipping insertion in model container [2019-11-06 21:24:21,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:24:21" (3/3) ... [2019-11-06 21:24:21,951 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2019-11-06 21:24:21,976 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:24:21,991 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:24:22,016 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:24:22,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:24:22,042 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:24:22,042 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:24:22,042 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:24:22,042 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:24:22,042 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:24:22,042 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:24:22,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:24:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-06 21:24:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:24:22,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:22,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:22,063 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-11-06 21:24:22,075 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:22,075 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900510799] [2019-11-06 21:24:22,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:24:22,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900510799] [2019-11-06 21:24:22,257 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:24:22,258 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:24:22,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869647178] [2019-11-06 21:24:22,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:24:22,264 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:22,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:24:22,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:24:22,281 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-11-06 21:24:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:22,386 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-11-06 21:24:22,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:24:22,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-06 21:24:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:22,396 INFO L225 Difference]: With dead ends: 46 [2019-11-06 21:24:22,397 INFO L226 Difference]: Without dead ends: 22 [2019-11-06 21:24:22,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-06 21:24:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-06 21:24:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-06 21:24:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-06 21:24:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-06 21:24:22,440 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-11-06 21:24:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:22,440 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-06 21:24:22,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:24:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-06 21:24:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:24:22,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:22,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:22,442 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:22,443 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-11-06 21:24:22,443 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:22,444 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195827995] [2019-11-06 21:24:22,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:24:22,632 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195827995] [2019-11-06 21:24:22,633 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:24:22,633 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:24:22,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285521273] [2019-11-06 21:24:22,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:24:22,635 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:24:22,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:24:22,636 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-11-06 21:24:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:22,809 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-06 21:24:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:24:22,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-06 21:24:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:22,811 INFO L225 Difference]: With dead ends: 34 [2019-11-06 21:24:22,811 INFO L226 Difference]: Without dead ends: 23 [2019-11-06 21:24:22,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:24:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-06 21:24:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-06 21:24:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-06 21:24:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-11-06 21:24:22,819 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-11-06 21:24:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:22,819 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-06 21:24:22,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:24:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-11-06 21:24:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:24:22,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:22,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:22,820 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:22,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:22,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2019-11-06 21:24:22,821 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:22,821 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716620209] [2019-11-06 21:24:22,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:24:23,003 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716620209] [2019-11-06 21:24:23,004 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:24:23,004 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:24:23,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397672287] [2019-11-06 21:24:23,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:24:23,005 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:23,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:24:23,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:24:23,006 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 4 states. [2019-11-06 21:24:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:23,087 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-06 21:24:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:24:23,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-06 21:24:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:23,089 INFO L225 Difference]: With dead ends: 40 [2019-11-06 21:24:23,089 INFO L226 Difference]: Without dead ends: 25 [2019-11-06 21:24:23,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:24:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-06 21:24:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-06 21:24:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-06 21:24:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-06 21:24:23,097 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-11-06 21:24:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:23,098 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-06 21:24:23,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:24:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-06 21:24:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:24:23,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:23,099 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:23,100 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-11-06 21:24:23,100 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:23,101 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390838180] [2019-11-06 21:24:23,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:24:23,258 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390838180] [2019-11-06 21:24:23,258 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788022402] [2019-11-06 21:24:23,259 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-11-06 21:24:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:23,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-06 21:24:23,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:24:23,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 21:24:23,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:23,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:23,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:23,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-06 21:24:23,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2019-11-06 21:24:23,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:23,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:23,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-06 21:24:23,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:23,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:23,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:24:23,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2019-11-06 21:24:23,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:24:23,650 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:24:23,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:23,688 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.8 percent of original size [2019-11-06 21:24:23,706 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:24:23,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2019-11-06 21:24:23,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:23,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:23,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:23,735 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:41 [2019-11-06 21:24:23,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:24:23,996 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:24:23,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-11-06 21:24:24,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:24,027 INFO L567 ElimStorePlain]: treesize reduction 7, result has 72.0 percent of original size [2019-11-06 21:24:24,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:24,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:7 [2019-11-06 21:24:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:24:24,086 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:24:24,086 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2019-11-06 21:24:24,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717960993] [2019-11-06 21:24:24,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:24:24,087 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:24,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:24:24,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:24:24,088 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 15 states. [2019-11-06 21:24:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:24,842 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-11-06 21:24:24,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:24:24,843 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-11-06 21:24:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:24,846 INFO L225 Difference]: With dead ends: 57 [2019-11-06 21:24:24,846 INFO L226 Difference]: Without dead ends: 42 [2019-11-06 21:24:24,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-11-06 21:24:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-06 21:24:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-11-06 21:24:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 21:24:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-06 21:24:24,860 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 19 [2019-11-06 21:24:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:24,860 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-06 21:24:24,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:24:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-06 21:24:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:24:24,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:24,862 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:25,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:24:25,067 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2019-11-06 21:24:25,069 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:25,069 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529246166] [2019-11-06 21:24:25,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:24:25,291 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529246166] [2019-11-06 21:24:25,291 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303571682] [2019-11-06 21:24:25,291 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-11-06 21:24:25,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:24:25,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:24:25,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 21:24:25,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:24:25,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 21:24:25,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:25,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:25,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:25,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-06 21:24:25,518 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:24:25,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:25,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-11-06 21:24:25,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:25,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:25,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:25,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2019-11-06 21:24:25,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:24:25,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:24:25,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:25,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2019-11-06 21:24:25,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:24:25,800 INFO L567 ElimStorePlain]: treesize reduction 20, result has 52.4 percent of original size [2019-11-06 21:24:25,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:25,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2019-11-06 21:24:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:24:25,859 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:24:25,860 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2019-11-06 21:24:25,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283434837] [2019-11-06 21:24:25,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 21:24:25,861 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:25,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 21:24:25,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-11-06 21:24:25,862 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 19 states. [2019-11-06 21:24:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:26,654 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-06 21:24:26,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:24:26,655 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-11-06 21:24:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:26,656 INFO L225 Difference]: With dead ends: 49 [2019-11-06 21:24:26,656 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 21:24:26,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-11-06 21:24:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 21:24:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-06 21:24:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 21:24:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-06 21:24:26,664 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2019-11-06 21:24:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:26,664 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-06 21:24:26,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 21:24:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-06 21:24:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:24:26,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:26,665 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:26,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:24:26,875 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash 832058620, now seen corresponding path program 3 times [2019-11-06 21:24:26,876 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:26,876 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912043661] [2019-11-06 21:24:26,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:24:27,121 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912043661] [2019-11-06 21:24:27,122 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226256310] [2019-11-06 21:24:27,122 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 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-11-06 21:24:27,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 21:24:27,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:24:27,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 21:24:27,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:24:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 21:24:27,228 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:24:27,228 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-06 21:24:27,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700897511] [2019-11-06 21:24:27,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:24:27,229 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:27,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:24:27,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:24:27,230 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2019-11-06 21:24:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:27,623 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-11-06 21:24:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 21:24:27,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-11-06 21:24:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:27,625 INFO L225 Difference]: With dead ends: 58 [2019-11-06 21:24:27,625 INFO L226 Difference]: Without dead ends: 39 [2019-11-06 21:24:27,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:24:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-06 21:24:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2019-11-06 21:24:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-06 21:24:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-11-06 21:24:27,633 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 25 [2019-11-06 21:24:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:27,633 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-11-06 21:24:27,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:24:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-11-06 21:24:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:24:27,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:27,634 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:27,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:24:27,836 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash -194529672, now seen corresponding path program 4 times [2019-11-06 21:24:27,837 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:27,837 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373821297] [2019-11-06 21:24:27,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 21:24:28,113 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373821297] [2019-11-06 21:24:28,113 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659855996] [2019-11-06 21:24:28,113 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 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-11-06 21:24:28,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 21:24:28,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:24:28,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-06 21:24:28,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:24:28,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 21:24:28,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:28,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:28,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:28,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-06 21:24:28,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-11-06 21:24:28,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:28,704 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:24:28,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:28,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:28,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:28,729 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2019-11-06 21:24:28,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:24:29,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:24:29,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:29,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2019-11-06 21:24:29,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:24:29,131 INFO L567 ElimStorePlain]: treesize reduction 20, result has 52.4 percent of original size [2019-11-06 21:24:29,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:29,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2019-11-06 21:24:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:24:29,208 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:24:29,208 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 27 [2019-11-06 21:24:29,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289494610] [2019-11-06 21:24:29,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-06 21:24:29,209 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:29,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-06 21:24:29,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2019-11-06 21:24:29,210 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 27 states. [2019-11-06 21:24:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:31,276 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-11-06 21:24:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:24:31,277 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2019-11-06 21:24:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:31,279 INFO L225 Difference]: With dead ends: 67 [2019-11-06 21:24:31,279 INFO L226 Difference]: Without dead ends: 56 [2019-11-06 21:24:31,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=246, Invalid=1646, Unknown=0, NotChecked=0, Total=1892 [2019-11-06 21:24:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-06 21:24:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2019-11-06 21:24:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-06 21:24:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-06 21:24:31,290 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2019-11-06 21:24:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:31,290 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-06 21:24:31,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-06 21:24:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-06 21:24:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:24:31,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:31,292 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:31,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:24:31,495 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:31,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2065498070, now seen corresponding path program 5 times [2019-11-06 21:24:31,496 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:31,496 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217721334] [2019-11-06 21:24:31,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-06 21:24:31,654 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217721334] [2019-11-06 21:24:31,654 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202999422] [2019-11-06 21:24:31,655 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-11-06 21:24:31,733 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-06 21:24:31,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:24:31,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-06 21:24:31,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:24:31,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 21:24:31,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:31,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:31,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:31,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-06 21:24:32,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2019-11-06 21:24:32,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:32,193 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:24:32,193 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:32,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:32,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:32,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:45 [2019-11-06 21:24:32,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:24:32,471 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:24:32,472 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:24:32,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 10 [2019-11-06 21:24:32,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:32,493 INFO L567 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2019-11-06 21:24:32,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:32,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:3 [2019-11-06 21:24:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 21:24:32,587 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:24:32,587 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 25 [2019-11-06 21:24:32,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005337140] [2019-11-06 21:24:32,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-06 21:24:32,588 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:32,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-06 21:24:32,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-11-06 21:24:32,589 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 25 states. [2019-11-06 21:24:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:33,971 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-11-06 21:24:33,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-06 21:24:33,971 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-11-06 21:24:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:33,973 INFO L225 Difference]: With dead ends: 77 [2019-11-06 21:24:33,973 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 21:24:33,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 21:24:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 21:24:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-11-06 21:24:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-06 21:24:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-06 21:24:33,983 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2019-11-06 21:24:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:33,984 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-06 21:24:33,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-06 21:24:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-06 21:24:33,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:24:33,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:33,985 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:34,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:24:34,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash -64658350, now seen corresponding path program 6 times [2019-11-06 21:24:34,189 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:34,189 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979163904] [2019-11-06 21:24:34,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 21:24:34,402 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979163904] [2019-11-06 21:24:34,402 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:24:34,402 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 21:24:34,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645315018] [2019-11-06 21:24:34,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:24:34,403 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:24:34,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:24:34,404 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 10 states. [2019-11-06 21:24:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:34,666 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2019-11-06 21:24:34,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:24:34,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-11-06 21:24:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:34,668 INFO L225 Difference]: With dead ends: 79 [2019-11-06 21:24:34,669 INFO L226 Difference]: Without dead ends: 66 [2019-11-06 21:24:34,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:24:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-06 21:24:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2019-11-06 21:24:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 21:24:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-06 21:24:34,685 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2019-11-06 21:24:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:34,685 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-06 21:24:34,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:24:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-06 21:24:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 21:24:34,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:34,690 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:34,690 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:34,691 INFO L82 PathProgramCache]: Analyzing trace with hash -90011861, now seen corresponding path program 1 times [2019-11-06 21:24:34,691 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:34,691 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059216521] [2019-11-06 21:24:34,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-06 21:24:34,895 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059216521] [2019-11-06 21:24:34,895 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425837540] [2019-11-06 21:24:34,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-11-06 21:24:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:34,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-06 21:24:34,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:24:34,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 21:24:34,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:34,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:34,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:34,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-06 21:24:35,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2019-11-06 21:24:35,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:35,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2019-11-06 21:24:35,344 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:35,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:35,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:24:35,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:91 [2019-11-06 21:24:35,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:24:35,537 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:24:35,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:35,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:35,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:24:35,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:24:35,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2019-11-06 21:24:35,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:35,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:35,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:35,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:61 [2019-11-06 21:24:35,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:24:37,907 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (main_~max~0 Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (.cse0 (mod (+ main_~max~0 4294967295) 4294967296)) (.cse1 (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|))) (and (<= .cse0 4) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (= (select .cse1 4) (select .cse2 (+ .cse0 (- 4)))) (<= .cse0 2147483647) (<= 4 .cse0) (= (select .cse2 (+ .cse0 (- 3))) (select .cse1 3))))) is different from true [2019-11-06 21:24:39,954 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-06 21:24:42,007 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-06 21:24:42,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:24:42,252 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:24:42,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:24:42,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:24:42,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:24:42,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2019-11-06 21:24:42,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:42,276 INFO L567 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2019-11-06 21:24:42,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:42,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:3 [2019-11-06 21:24:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2019-11-06 21:24:44,388 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:24:44,388 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 27] total 34 [2019-11-06 21:24:44,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733929494] [2019-11-06 21:24:44,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-06 21:24:44,389 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:24:44,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-06 21:24:44,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=962, Unknown=2, NotChecked=62, Total=1122 [2019-11-06 21:24:44,390 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 34 states. [2019-11-06 21:24:49,902 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-06 21:24:53,983 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-11-06 21:24:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:24:57,059 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-11-06 21:24:57,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 21:24:57,060 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-11-06 21:24:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:24:57,061 INFO L225 Difference]: With dead ends: 90 [2019-11-06 21:24:57,061 INFO L226 Difference]: Without dead ends: 61 [2019-11-06 21:24:57,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=222, Invalid=2036, Unknown=2, NotChecked=92, Total=2352 [2019-11-06 21:24:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-06 21:24:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-11-06 21:24:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 21:24:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-11-06 21:24:57,074 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 41 [2019-11-06 21:24:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:24:57,074 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-11-06 21:24:57,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-06 21:24:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-11-06 21:24:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 21:24:57,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:24:57,076 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:24:57,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:24:57,279 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:24:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:24:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -480781312, now seen corresponding path program 2 times [2019-11-06 21:24:57,280 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:24:57,281 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072774045] [2019-11-06 21:24:57,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:24:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:57,977 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-06 21:24:58,141 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-11-06 21:24:58,319 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-06 21:24:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:24:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:24:59,063 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072774045] [2019-11-06 21:24:59,063 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100453485] [2019-11-06 21:24:59,063 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-11-06 21:24:59,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:24:59,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:24:59,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-06 21:24:59,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:24:59,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 21:24:59,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:59,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:59,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:24:59,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-06 21:24:59,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2019-11-06 21:24:59,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:59,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2019-11-06 21:24:59,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:24:59,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:24:59,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:24:59,673 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:116, output treesize:108 [2019-11-06 21:24:59,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:24:59,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:24:59,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:24:59,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 78 [2019-11-06 21:24:59,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:00,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:00,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:00,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:00,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 77 [2019-11-06 21:25:00,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:00,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:00,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:25:00,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:146, output treesize:138 [2019-11-06 21:25:00,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:25:00,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:00,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:00,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:00,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:00,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:00,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:00,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 103 [2019-11-06 21:25:00,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:00,341 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:25:00,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:00,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:00,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:25:00,364 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:184, output treesize:88 [2019-11-06 21:25:00,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:25:02,930 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_2| Int) (main_~max~0 Int) (v_main_~j~0_31 Int) (|v_main_~#str1~0.base_BEFORE_CALL_2| Int)) (let ((.cse5 (+ main_~max~0 4294967295))) (let ((.cse6 (div .cse5 4294967296))) (let ((.cse4 (+ main_~max~0 4294967291)) (.cse3 (* 4294967296 .cse6)) (.cse0 (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_2|)) (.cse1 (* .cse6 (- 4294967296))) (.cse2 (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_2|))) (and (= (select .cse0 (+ main_~max~0 .cse1 4294967293)) (select .cse2 2)) (<= 4 v_main_~j~0_31) (= (select .cse0 (+ main_~max~0 .cse1 4294967291)) (select .cse2 v_main_~j~0_31)) (<= .cse3 .cse4) (not (= |v_main_~#str2~0.base_BEFORE_CALL_2| |v_main_~#str1~0.base_BEFORE_CALL_2|)) (<= (mod .cse5 4294967296) 2147483647) (<= .cse4 .cse3) (= (select .cse0 (+ main_~max~0 .cse1 4294967292)) (select .cse2 3))))))) is different from true [2019-11-06 21:25:05,014 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 47