/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:56:31,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:56:31,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:56:31,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:56:31,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:56:31,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:56:31,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:56:31,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:56:31,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:56:31,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:56:31,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:56:31,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:56:31,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:56:31,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:56:31,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:56:31,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:56:31,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:56:31,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:56:31,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:56:31,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:56:31,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:56:31,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:56:31,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:56:31,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:56:31,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:56:31,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:56:31,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:56:31,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:56:31,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:56:31,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:56:31,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:56:31,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:56:31,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:56:31,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:56:31,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:56:31,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:56:31,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:56:31,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:56:31,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:56:31,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:56:31,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:56:31,307 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-23 20:56:31,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:56:31,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:56:31,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:56:31,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:56:31,322 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:56:31,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:56:31,322 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:56:31,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:56:31,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:56:31,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:56:31,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:56:31,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:56:31,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:56:31,323 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:56:31,323 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:56:31,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:56:31,324 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:56:31,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:56:31,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:56:31,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:56:31,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:56:31,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:56:31,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:56:31,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:56:31,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:56:31,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:56:31,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:56:31,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:56:31,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:56:31,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:56:31,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:56:31,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:56:31,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:56:31,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:56:31,613 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:56:31,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label39.c [2019-11-23 20:56:31,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c517b0c3/d72b1076dac54ef19a714c86b5cb180e/FLAG09955052c [2019-11-23 20:56:32,355 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:56:32,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label39.c [2019-11-23 20:56:32,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c517b0c3/d72b1076dac54ef19a714c86b5cb180e/FLAG09955052c [2019-11-23 20:56:32,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c517b0c3/d72b1076dac54ef19a714c86b5cb180e [2019-11-23 20:56:32,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:56:32,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:56:32,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:56:32,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:56:32,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:56:32,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:32" (1/1) ... [2019-11-23 20:56:32,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182f03c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:32, skipping insertion in model container [2019-11-23 20:56:32,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:32" (1/1) ... [2019-11-23 20:56:32,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:56:32,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:56:33,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:56:33,439 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:56:33,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:56:33,777 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:56:33,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33 WrapperNode [2019-11-23 20:56:33,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:56:33,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:56:33,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:56:33,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:56:33,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:56:33,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:56:33,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:56:33,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:56:33,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:34,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:34,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:34,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:56:34,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:56:34,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:56:34,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:56:34,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (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-23 20:56:34,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:56:34,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:56:36,001 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:56:36,002 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:56:36,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:36 BoogieIcfgContainer [2019-11-23 20:56:36,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:56:36,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:56:36,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:56:36,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:56:36,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:56:32" (1/3) ... [2019-11-23 20:56:36,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d2441b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:36, skipping insertion in model container [2019-11-23 20:56:36,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (2/3) ... [2019-11-23 20:56:36,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d2441b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:36, skipping insertion in model container [2019-11-23 20:56:36,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:36" (3/3) ... [2019-11-23 20:56:36,011 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label39.c [2019-11-23 20:56:36,021 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:56:36,029 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:56:36,044 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:56:36,091 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:56:36,091 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:56:36,091 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:56:36,091 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:56:36,091 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:56:36,092 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:56:36,092 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:56:36,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:56:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:56:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 20:56:36,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:36,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:36,167 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:36,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1090968285, now seen corresponding path program 1 times [2019-11-23 20:56:36,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:36,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518198121] [2019-11-23 20:56:36,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:36,879 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-23 20:56:36,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518198121] [2019-11-23 20:56:36,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:36,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:36,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616101357] [2019-11-23 20:56:36,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:36,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:36,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:36,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:36,909 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:56:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:39,069 INFO L93 Difference]: Finished difference Result 1085 states and 1950 transitions. [2019-11-23 20:56:39,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:39,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-23 20:56:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:39,099 INFO L225 Difference]: With dead ends: 1085 [2019-11-23 20:56:39,100 INFO L226 Difference]: Without dead ends: 686 [2019-11-23 20:56:39,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-23 20:56:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 453. [2019-11-23 20:56:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-11-23 20:56:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 735 transitions. [2019-11-23 20:56:39,190 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 735 transitions. Word has length 147 [2019-11-23 20:56:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:39,191 INFO L462 AbstractCegarLoop]: Abstraction has 453 states and 735 transitions. [2019-11-23 20:56:39,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 735 transitions. [2019-11-23 20:56:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 20:56:39,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:39,201 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:39,201 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1670722989, now seen corresponding path program 1 times [2019-11-23 20:56:39,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:39,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142044902] [2019-11-23 20:56:39,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:39,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142044902] [2019-11-23 20:56:39,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:39,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:39,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394839096] [2019-11-23 20:56:39,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:39,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:39,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:39,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:39,344 INFO L87 Difference]: Start difference. First operand 453 states and 735 transitions. Second operand 4 states. [2019-11-23 20:56:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:41,254 INFO L93 Difference]: Finished difference Result 1746 states and 2862 transitions. [2019-11-23 20:56:41,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:41,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 20:56:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:41,263 INFO L225 Difference]: With dead ends: 1746 [2019-11-23 20:56:41,263 INFO L226 Difference]: Without dead ends: 1295 [2019-11-23 20:56:41,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-11-23 20:56:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 863. [2019-11-23 20:56:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-11-23 20:56:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1324 transitions. [2019-11-23 20:56:41,310 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1324 transitions. Word has length 152 [2019-11-23 20:56:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:41,310 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1324 transitions. [2019-11-23 20:56:41,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1324 transitions. [2019-11-23 20:56:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 20:56:41,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:41,317 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:41,317 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash -481274588, now seen corresponding path program 1 times [2019-11-23 20:56:41,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:41,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071944151] [2019-11-23 20:56:41,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:41,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071944151] [2019-11-23 20:56:41,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:41,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:41,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833361908] [2019-11-23 20:56:41,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:41,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:41,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:41,467 INFO L87 Difference]: Start difference. First operand 863 states and 1324 transitions. Second operand 3 states. [2019-11-23 20:56:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:42,542 INFO L93 Difference]: Finished difference Result 2552 states and 3934 transitions. [2019-11-23 20:56:42,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:42,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 20:56:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:42,551 INFO L225 Difference]: With dead ends: 2552 [2019-11-23 20:56:42,551 INFO L226 Difference]: Without dead ends: 1691 [2019-11-23 20:56:42,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 20:56:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-11-23 20:56:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1676. [2019-11-23 20:56:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2019-11-23 20:56:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2540 transitions. [2019-11-23 20:56:42,591 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2540 transitions. Word has length 155 [2019-11-23 20:56:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:42,591 INFO L462 AbstractCegarLoop]: Abstraction has 1676 states and 2540 transitions. [2019-11-23 20:56:42,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2540 transitions. [2019-11-23 20:56:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 20:56:42,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:42,596 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:42,596 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash 382954205, now seen corresponding path program 1 times [2019-11-23 20:56:42,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:42,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097965275] [2019-11-23 20:56:42,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:42,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097965275] [2019-11-23 20:56:42,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:42,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:42,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590447284] [2019-11-23 20:56:42,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:42,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:42,697 INFO L87 Difference]: Start difference. First operand 1676 states and 2540 transitions. Second operand 4 states. [2019-11-23 20:56:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:44,536 INFO L93 Difference]: Finished difference Result 6620 states and 10053 transitions. [2019-11-23 20:56:44,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:44,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-23 20:56:44,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:44,559 INFO L225 Difference]: With dead ends: 6620 [2019-11-23 20:56:44,560 INFO L226 Difference]: Without dead ends: 4946 [2019-11-23 20:56:44,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2019-11-23 20:56:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 3307. [2019-11-23 20:56:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3307 states. [2019-11-23 20:56:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 4729 transitions. [2019-11-23 20:56:44,649 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 4729 transitions. Word has length 156 [2019-11-23 20:56:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:44,649 INFO L462 AbstractCegarLoop]: Abstraction has 3307 states and 4729 transitions. [2019-11-23 20:56:44,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4729 transitions. [2019-11-23 20:56:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 20:56:44,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:44,656 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:44,656 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:44,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1937089801, now seen corresponding path program 1 times [2019-11-23 20:56:44,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:44,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108602192] [2019-11-23 20:56:44,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:44,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108602192] [2019-11-23 20:56:44,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:44,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:44,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751888203] [2019-11-23 20:56:44,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:44,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:44,739 INFO L87 Difference]: Start difference. First operand 3307 states and 4729 transitions. Second operand 3 states. [2019-11-23 20:56:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:45,862 INFO L93 Difference]: Finished difference Result 8046 states and 11489 transitions. [2019-11-23 20:56:45,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:45,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 20:56:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:45,887 INFO L225 Difference]: With dead ends: 8046 [2019-11-23 20:56:45,889 INFO L226 Difference]: Without dead ends: 4741 [2019-11-23 20:56:45,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 20:56:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2019-11-23 20:56:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 4740. [2019-11-23 20:56:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4740 states. [2019-11-23 20:56:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 6652 transitions. [2019-11-23 20:56:45,975 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 6652 transitions. Word has length 157 [2019-11-23 20:56:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:45,976 INFO L462 AbstractCegarLoop]: Abstraction has 4740 states and 6652 transitions. [2019-11-23 20:56:45,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 6652 transitions. [2019-11-23 20:56:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 20:56:45,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:45,984 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:45,985 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:45,985 INFO L82 PathProgramCache]: Analyzing trace with hash -517919847, now seen corresponding path program 1 times [2019-11-23 20:56:45,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:45,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591922326] [2019-11-23 20:56:45,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:46,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591922326] [2019-11-23 20:56:46,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:46,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:46,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498130770] [2019-11-23 20:56:46,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:46,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:46,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:46,215 INFO L87 Difference]: Start difference. First operand 4740 states and 6652 transitions. Second operand 3 states. [2019-11-23 20:56:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:47,319 INFO L93 Difference]: Finished difference Result 9480 states and 13306 transitions. [2019-11-23 20:56:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:47,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-23 20:56:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:47,340 INFO L225 Difference]: With dead ends: 9480 [2019-11-23 20:56:47,340 INFO L226 Difference]: Without dead ends: 4742 [2019-11-23 20:56:47,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2019-11-23 20:56:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 3724. [2019-11-23 20:56:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2019-11-23 20:56:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 4926 transitions. [2019-11-23 20:56:47,419 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 4926 transitions. Word has length 162 [2019-11-23 20:56:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:47,420 INFO L462 AbstractCegarLoop]: Abstraction has 3724 states and 4926 transitions. [2019-11-23 20:56:47,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4926 transitions. [2019-11-23 20:56:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 20:56:47,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:47,428 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:47,428 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:47,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:47,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1080734270, now seen corresponding path program 1 times [2019-11-23 20:56:47,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:47,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232942803] [2019-11-23 20:56:47,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:47,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232942803] [2019-11-23 20:56:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962463915] [2019-11-23 20:56:47,632 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-23 20:56:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:47,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:47,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:47,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:47,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:56:47,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302470328] [2019-11-23 20:56:47,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:47,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:47,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:47,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:47,865 INFO L87 Difference]: Start difference. First operand 3724 states and 4926 transitions. Second operand 3 states. [2019-11-23 20:56:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:49,061 INFO L93 Difference]: Finished difference Result 10918 states and 14452 transitions. [2019-11-23 20:56:49,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:49,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 20:56:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:49,118 INFO L225 Difference]: With dead ends: 10918 [2019-11-23 20:56:49,118 INFO L226 Difference]: Without dead ends: 7196 [2019-11-23 20:56:49,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2019-11-23 20:56:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7195. [2019-11-23 20:56:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-11-23 20:56:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 9235 transitions. [2019-11-23 20:56:49,335 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 9235 transitions. Word has length 164 [2019-11-23 20:56:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:49,336 INFO L462 AbstractCegarLoop]: Abstraction has 7195 states and 9235 transitions. [2019-11-23 20:56:49,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 9235 transitions. [2019-11-23 20:56:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-23 20:56:49,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:49,348 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:49,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:49,552 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash -134534967, now seen corresponding path program 1 times [2019-11-23 20:56:49,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:49,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131316535] [2019-11-23 20:56:49,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:56:49,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131316535] [2019-11-23 20:56:49,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573427712] [2019-11-23 20:56:49,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-23 20:56:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:49,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:49,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:56:49,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:49,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 20:56:49,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607197113] [2019-11-23 20:56:49,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:49,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:49,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:49,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:49,804 INFO L87 Difference]: Start difference. First operand 7195 states and 9235 transitions. Second operand 3 states. [2019-11-23 20:56:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:50,159 INFO L93 Difference]: Finished difference Result 21577 states and 27697 transitions. [2019-11-23 20:56:50,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:50,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-23 20:56:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:50,201 INFO L225 Difference]: With dead ends: 21577 [2019-11-23 20:56:50,202 INFO L226 Difference]: Without dead ends: 14384 [2019-11-23 20:56:50,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14384 states. [2019-11-23 20:56:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14384 to 14382. [2019-11-23 20:56:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14382 states. [2019-11-23 20:56:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14382 states to 14382 states and 18430 transitions. [2019-11-23 20:56:50,513 INFO L78 Accepts]: Start accepts. Automaton has 14382 states and 18430 transitions. Word has length 176 [2019-11-23 20:56:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:50,514 INFO L462 AbstractCegarLoop]: Abstraction has 14382 states and 18430 transitions. [2019-11-23 20:56:50,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 14382 states and 18430 transitions. [2019-11-23 20:56:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-23 20:56:50,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:50,548 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:50,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:50,755 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1325781234, now seen corresponding path program 1 times [2019-11-23 20:56:50,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:50,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92913001] [2019-11-23 20:56:50,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 20:56:50,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92913001] [2019-11-23 20:56:50,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:50,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:50,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520720065] [2019-11-23 20:56:50,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:50,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:50,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:50,987 INFO L87 Difference]: Start difference. First operand 14382 states and 18430 transitions. Second operand 3 states. [2019-11-23 20:56:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:52,279 INFO L93 Difference]: Finished difference Result 40542 states and 51892 transitions. [2019-11-23 20:56:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:52,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-23 20:56:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:52,326 INFO L225 Difference]: With dead ends: 40542 [2019-11-23 20:56:52,326 INFO L226 Difference]: Without dead ends: 26162 [2019-11-23 20:56:52,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26162 states. [2019-11-23 20:56:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26162 to 22502. [2019-11-23 20:56:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22502 states. [2019-11-23 20:56:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22502 states to 22502 states and 26984 transitions. [2019-11-23 20:56:52,840 INFO L78 Accepts]: Start accepts. Automaton has 22502 states and 26984 transitions. Word has length 195 [2019-11-23 20:56:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:52,841 INFO L462 AbstractCegarLoop]: Abstraction has 22502 states and 26984 transitions. [2019-11-23 20:56:52,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 22502 states and 26984 transitions. [2019-11-23 20:56:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-23 20:56:52,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:52,872 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:52,872 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1919749251, now seen corresponding path program 1 times [2019-11-23 20:56:52,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:52,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657225880] [2019-11-23 20:56:52,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:56:52,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657225880] [2019-11-23 20:56:52,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:52,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:52,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517775439] [2019-11-23 20:56:52,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:52,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:52,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:52,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:52,977 INFO L87 Difference]: Start difference. First operand 22502 states and 26984 transitions. Second operand 3 states. [2019-11-23 20:56:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:53,597 INFO L93 Difference]: Finished difference Result 44534 states and 53354 transitions. [2019-11-23 20:56:53,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:53,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-23 20:56:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:53,630 INFO L225 Difference]: With dead ends: 44534 [2019-11-23 20:56:53,631 INFO L226 Difference]: Without dead ends: 22034 [2019-11-23 20:56:53,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 20:56:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22034 states. [2019-11-23 20:56:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22034 to 22034. [2019-11-23 20:56:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22034 states. [2019-11-23 20:56:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22034 states to 22034 states and 26058 transitions. [2019-11-23 20:56:53,921 INFO L78 Accepts]: Start accepts. Automaton has 22034 states and 26058 transitions. Word has length 205 [2019-11-23 20:56:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:53,922 INFO L462 AbstractCegarLoop]: Abstraction has 22034 states and 26058 transitions. [2019-11-23 20:56:53,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 22034 states and 26058 transitions. [2019-11-23 20:56:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-23 20:56:53,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:53,952 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:53,952 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:53,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:53,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1204976399, now seen corresponding path program 1 times [2019-11-23 20:56:53,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:53,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094939502] [2019-11-23 20:56:53,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 20:56:54,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094939502] [2019-11-23 20:56:54,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463226404] [2019-11-23 20:56:54,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-23 20:56:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:55,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:56:55,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 20:56:55,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:55,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-23 20:56:55,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189096871] [2019-11-23 20:56:55,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:55,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:55,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:55,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:55,230 INFO L87 Difference]: Start difference. First operand 22034 states and 26058 transitions. Second operand 3 states. [2019-11-23 20:56:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:55,818 INFO L93 Difference]: Finished difference Result 64010 states and 75558 transitions. [2019-11-23 20:56:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:55,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-23 20:56:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:55,855 INFO L225 Difference]: With dead ends: 64010 [2019-11-23 20:56:55,856 INFO L226 Difference]: Without dead ends: 41978 [2019-11-23 20:56:55,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41978 states. [2019-11-23 20:56:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41978 to 41976. [2019-11-23 20:56:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41976 states. [2019-11-23 20:56:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41976 states to 41976 states and 49480 transitions. [2019-11-23 20:56:56,409 INFO L78 Accepts]: Start accepts. Automaton has 41976 states and 49480 transitions. Word has length 209 [2019-11-23 20:56:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:56,410 INFO L462 AbstractCegarLoop]: Abstraction has 41976 states and 49480 transitions. [2019-11-23 20:56:56,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 41976 states and 49480 transitions. [2019-11-23 20:56:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-23 20:56:56,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:56,438 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:56,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:56,643 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:56,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:56,644 INFO L82 PathProgramCache]: Analyzing trace with hash -70696637, now seen corresponding path program 1 times [2019-11-23 20:56:56,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:56,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964317080] [2019-11-23 20:56:56,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 88 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-23 20:56:56,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964317080] [2019-11-23 20:56:56,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878858695] [2019-11-23 20:56:56,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:57,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:57,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:57,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:57,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:56:57,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781325200] [2019-11-23 20:56:57,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:57,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:57,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:57,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:57,093 INFO L87 Difference]: Start difference. First operand 41976 states and 49480 transitions. Second operand 3 states. [2019-11-23 20:56:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:58,377 INFO L93 Difference]: Finished difference Result 97155 states and 115174 transitions. [2019-11-23 20:56:58,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:58,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-23 20:56:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:58,425 INFO L225 Difference]: With dead ends: 97155 [2019-11-23 20:56:58,425 INFO L226 Difference]: Without dead ends: 55181 [2019-11-23 20:56:58,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55181 states. [2019-11-23 20:56:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55181 to 55169. [2019-11-23 20:56:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55169 states. [2019-11-23 20:56:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55169 states to 55169 states and 62952 transitions. [2019-11-23 20:56:58,947 INFO L78 Accepts]: Start accepts. Automaton has 55169 states and 62952 transitions. Word has length 227 [2019-11-23 20:56:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:58,947 INFO L462 AbstractCegarLoop]: Abstraction has 55169 states and 62952 transitions. [2019-11-23 20:56:58,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 55169 states and 62952 transitions. [2019-11-23 20:56:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-23 20:56:59,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:59,205 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:59,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:59,410 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1588045261, now seen corresponding path program 1 times [2019-11-23 20:56:59,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:59,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790062283] [2019-11-23 20:56:59,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:59,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790062283] [2019-11-23 20:56:59,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:59,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:56:59,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922453773] [2019-11-23 20:56:59,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:59,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:59,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:59,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:59,667 INFO L87 Difference]: Start difference. First operand 55169 states and 62952 transitions. Second operand 4 states. [2019-11-23 20:57:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:01,383 INFO L93 Difference]: Finished difference Result 109536 states and 125018 transitions. [2019-11-23 20:57:01,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:01,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 277 [2019-11-23 20:57:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:01,436 INFO L225 Difference]: With dead ends: 109536 [2019-11-23 20:57:01,436 INFO L226 Difference]: Without dead ends: 54369 [2019-11-23 20:57:01,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54369 states. [2019-11-23 20:57:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54369 to 50297. [2019-11-23 20:57:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50297 states. [2019-11-23 20:57:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50297 states to 50297 states and 56658 transitions. [2019-11-23 20:57:03,072 INFO L78 Accepts]: Start accepts. Automaton has 50297 states and 56658 transitions. Word has length 277 [2019-11-23 20:57:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:03,073 INFO L462 AbstractCegarLoop]: Abstraction has 50297 states and 56658 transitions. [2019-11-23 20:57:03,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 50297 states and 56658 transitions. [2019-11-23 20:57:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-23 20:57:03,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:03,106 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:03,106 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:03,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash -148697325, now seen corresponding path program 1 times [2019-11-23 20:57:03,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:03,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475527024] [2019-11-23 20:57:03,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:57:03,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475527024] [2019-11-23 20:57:03,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:03,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:03,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758765931] [2019-11-23 20:57:03,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:03,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:03,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:03,388 INFO L87 Difference]: Start difference. First operand 50297 states and 56658 transitions. Second operand 3 states. [2019-11-23 20:57:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:04,261 INFO L93 Difference]: Finished difference Result 134163 states and 150891 transitions. [2019-11-23 20:57:04,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:04,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-23 20:57:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:04,622 INFO L225 Difference]: With dead ends: 134163 [2019-11-23 20:57:04,622 INFO L226 Difference]: Without dead ends: 83868 [2019-11-23 20:57:04,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 20:57:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83868 states. [2019-11-23 20:57:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83868 to 83865. [2019-11-23 20:57:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83865 states. [2019-11-23 20:57:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83865 states to 83865 states and 94215 transitions. [2019-11-23 20:57:05,307 INFO L78 Accepts]: Start accepts. Automaton has 83865 states and 94215 transitions. Word has length 298 [2019-11-23 20:57:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:05,307 INFO L462 AbstractCegarLoop]: Abstraction has 83865 states and 94215 transitions. [2019-11-23 20:57:05,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 83865 states and 94215 transitions. [2019-11-23 20:57:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-11-23 20:57:05,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:05,372 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:05,372 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:05,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:05,372 INFO L82 PathProgramCache]: Analyzing trace with hash 12666728, now seen corresponding path program 1 times [2019-11-23 20:57:05,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:05,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089606452] [2019-11-23 20:57:05,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-11-23 20:57:05,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089606452] [2019-11-23 20:57:05,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:05,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:05,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247694216] [2019-11-23 20:57:05,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:05,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:05,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:05,874 INFO L87 Difference]: Start difference. First operand 83865 states and 94215 transitions. Second operand 3 states. [2019-11-23 20:57:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:06,649 INFO L93 Difference]: Finished difference Result 238955 states and 268194 transitions. [2019-11-23 20:57:06,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:06,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-11-23 20:57:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:06,796 INFO L225 Difference]: With dead ends: 238955 [2019-11-23 20:57:06,796 INFO L226 Difference]: Without dead ends: 155092 [2019-11-23 20:57:06,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155092 states. [2019-11-23 20:57:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155092 to 154274. [2019-11-23 20:57:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154274 states. [2019-11-23 20:57:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154274 states to 154274 states and 171428 transitions. [2019-11-23 20:57:10,272 INFO L78 Accepts]: Start accepts. Automaton has 154274 states and 171428 transitions. Word has length 396 [2019-11-23 20:57:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:10,273 INFO L462 AbstractCegarLoop]: Abstraction has 154274 states and 171428 transitions. [2019-11-23 20:57:10,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 154274 states and 171428 transitions. [2019-11-23 20:57:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-11-23 20:57:10,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:10,363 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:10,363 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:10,364 INFO L82 PathProgramCache]: Analyzing trace with hash -602296308, now seen corresponding path program 1 times [2019-11-23 20:57:10,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:10,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971364487] [2019-11-23 20:57:10,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-23 20:57:11,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971364487] [2019-11-23 20:57:11,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:11,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:11,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757101508] [2019-11-23 20:57:11,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:11,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:11,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:11,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:11,111 INFO L87 Difference]: Start difference. First operand 154274 states and 171428 transitions. Second operand 3 states. [2019-11-23 20:57:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:12,589 INFO L93 Difference]: Finished difference Result 284034 states and 315080 transitions. [2019-11-23 20:57:12,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:12,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-11-23 20:57:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:12,701 INFO L225 Difference]: With dead ends: 284034 [2019-11-23 20:57:12,701 INFO L226 Difference]: Without dead ends: 129762 [2019-11-23 20:57:12,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129762 states. [2019-11-23 20:57:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129762 to 125698. [2019-11-23 20:57:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125698 states. [2019-11-23 20:57:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125698 states to 125698 states and 136899 transitions. [2019-11-23 20:57:14,527 INFO L78 Accepts]: Start accepts. Automaton has 125698 states and 136899 transitions. Word has length 402 [2019-11-23 20:57:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:14,527 INFO L462 AbstractCegarLoop]: Abstraction has 125698 states and 136899 transitions. [2019-11-23 20:57:14,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 125698 states and 136899 transitions. [2019-11-23 20:57:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-23 20:57:14,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:14,588 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:14,588 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:14,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1547960926, now seen corresponding path program 1 times [2019-11-23 20:57:14,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:14,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932890947] [2019-11-23 20:57:14,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 325 proven. 6 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-11-23 20:57:14,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932890947] [2019-11-23 20:57:14,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489946289] [2019-11-23 20:57:14,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-23 20:57:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:15,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:57:15,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-23 20:57:15,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:15,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-23 20:57:15,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508473401] [2019-11-23 20:57:15,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:15,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:57:15,936 INFO L87 Difference]: Start difference. First operand 125698 states and 136899 transitions. Second operand 3 states. [2019-11-23 20:57:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:16,947 INFO L93 Difference]: Finished difference Result 326988 states and 355771 transitions. [2019-11-23 20:57:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:16,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-11-23 20:57:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:17,153 INFO L225 Difference]: With dead ends: 326988 [2019-11-23 20:57:17,154 INFO L226 Difference]: Without dead ends: 201292 [2019-11-23 20:57:17,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:57:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201292 states. [2019-11-23 20:57:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201292 to 201284. [2019-11-23 20:57:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201284 states. [2019-11-23 20:57:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201284 states to 201284 states and 217354 transitions. [2019-11-23 20:57:22,518 INFO L78 Accepts]: Start accepts. Automaton has 201284 states and 217354 transitions. Word has length 409 [2019-11-23 20:57:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:22,518 INFO L462 AbstractCegarLoop]: Abstraction has 201284 states and 217354 transitions. [2019-11-23 20:57:22,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 201284 states and 217354 transitions. [2019-11-23 20:57:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-11-23 20:57:22,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:22,612 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:22,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:22,813 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash -58249670, now seen corresponding path program 1 times [2019-11-23 20:57:22,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:22,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488542410] [2019-11-23 20:57:22,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 254 proven. 14 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-23 20:57:23,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488542410] [2019-11-23 20:57:23,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645833035] [2019-11-23 20:57:23,028 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-23 20:57:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:23,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:57:23,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-23 20:57:23,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:23,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:57:23,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564519982] [2019-11-23 20:57:23,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:23,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:23,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:23,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:23,362 INFO L87 Difference]: Start difference. First operand 201284 states and 217354 transitions. Second operand 3 states. [2019-11-23 20:57:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:27,474 INFO L93 Difference]: Finished difference Result 544001 states and 587036 transitions. [2019-11-23 20:57:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:27,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 411 [2019-11-23 20:57:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:27,875 INFO L225 Difference]: With dead ends: 544001 [2019-11-23 20:57:27,875 INFO L226 Difference]: Without dead ends: 342719 [2019-11-23 20:57:27,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342719 states. [2019-11-23 20:57:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342719 to 342711. [2019-11-23 20:57:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342711 states. [2019-11-23 20:57:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342711 states to 342711 states and 367093 transitions. [2019-11-23 20:57:36,497 INFO L78 Accepts]: Start accepts. Automaton has 342711 states and 367093 transitions. Word has length 411 [2019-11-23 20:57:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:36,497 INFO L462 AbstractCegarLoop]: Abstraction has 342711 states and 367093 transitions. [2019-11-23 20:57:36,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 342711 states and 367093 transitions. [2019-11-23 20:57:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-11-23 20:57:36,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:36,630 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:36,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:36,832 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1040260784, now seen corresponding path program 1 times [2019-11-23 20:57:36,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:36,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546322126] [2019-11-23 20:57:36,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-23 20:57:37,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546322126] [2019-11-23 20:57:37,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:37,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:37,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336420288] [2019-11-23 20:57:37,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:37,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:37,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:37,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:37,081 INFO L87 Difference]: Start difference. First operand 342711 states and 367093 transitions. Second operand 4 states. [2019-11-23 20:57:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:41,249 INFO L93 Difference]: Finished difference Result 887494 states and 950129 transitions. [2019-11-23 20:57:41,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:41,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 424 [2019-11-23 20:57:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:41,770 INFO L225 Difference]: With dead ends: 887494 [2019-11-23 20:57:41,771 INFO L226 Difference]: Without dead ends: 544785 [2019-11-23 20:57:41,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544785 states.