/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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:32:35,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:32:35,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:32:35,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:32:35,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:32:35,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:32:35,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:32:35,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:32:35,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:32:35,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:32:35,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:32:35,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:32:35,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:32:35,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:32:35,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:32:35,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:32:35,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:32:35,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:32:35,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:32:35,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:32:35,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:32:35,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:32:35,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:32:35,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:32:35,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:32:35,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:32:35,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:32:35,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:32:35,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:32:35,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:32:35,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:32:35,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:32:35,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:32:35,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:32:35,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:32:35,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:32:35,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:32:35,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:32:35,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:32:35,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:32:35,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:32:35,599 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 22:32:35,621 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:32:35,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:32:35,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:32:35,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:32:35,623 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:32:35,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:32:35,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:32:35,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:32:35,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:32:35,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:32:35,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:32:35,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:32:35,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:32:35,626 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:32:35,626 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:32:35,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:32:35,626 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:32:35,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:32:35,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:32:35,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:32:35,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:32:35,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:32:35,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:32:35,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:32:35,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:32:35,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:32:35,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:32:35,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:32:35,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:32:35,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:32:35,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:32:35,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:32:35,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:32:35,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:32:35,912 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:32:35,913 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-23 22:32:35,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72b13789/a5a89171213c4a5e8c6c436814678ab8/FLAGc987ef00a [2019-11-23 22:32:36,661 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:32:36,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-23 22:32:36,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72b13789/a5a89171213c4a5e8c6c436814678ab8/FLAGc987ef00a [2019-11-23 22:32:36,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72b13789/a5a89171213c4a5e8c6c436814678ab8 [2019-11-23 22:32:36,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:32:36,828 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:32:36,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:36,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:32:36,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:32:36,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:36" (1/1) ... [2019-11-23 22:32:36,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed33e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:36, skipping insertion in model container [2019-11-23 22:32:36,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:36" (1/1) ... [2019-11-23 22:32:36,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:32:37,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:32:38,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:38,145 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:32:38,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:38,462 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:32:38,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38 WrapperNode [2019-11-23 22:32:38,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:38,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:38,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:32:38,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:32:38,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2019-11-23 22:32:38,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2019-11-23 22:32:38,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:38,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:32:38,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:32:38,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:32:38,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2019-11-23 22:32:38,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2019-11-23 22:32:38,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2019-11-23 22:32:38,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2019-11-23 22:32:38,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2019-11-23 22:32:38,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2019-11-23 22:32:38,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2019-11-23 22:32:38,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:32:38,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:32:38,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:32:38,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:32:38,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (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 22:32:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:32:38,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:32:42,401 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:32:42,401 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:32:42,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:42 BoogieIcfgContainer [2019-11-23 22:32:42,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:32:42,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:32:42,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:32:42,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:32:42,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:32:36" (1/3) ... [2019-11-23 22:32:42,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172e861b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:42, skipping insertion in model container [2019-11-23 22:32:42,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (2/3) ... [2019-11-23 22:32:42,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172e861b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:42, skipping insertion in model container [2019-11-23 22:32:42,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:42" (3/3) ... [2019-11-23 22:32:42,416 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-23 22:32:42,425 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:32:42,435 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-23 22:32:42,446 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-23 22:32:42,491 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:32:42,491 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:32:42,491 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:32:42,492 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:32:42,492 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:32:42,492 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:32:42,492 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:32:42,492 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:32:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states. [2019-11-23 22:32:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:32:42,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:42,565 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] [2019-11-23 22:32:42,566 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash 46255632, now seen corresponding path program 1 times [2019-11-23 22:32:42,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:42,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131462918] [2019-11-23 22:32:42,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:43,018 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 22:32:43,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131462918] [2019-11-23 22:32:43,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:43,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:43,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275845902] [2019-11-23 22:32:43,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:32:43,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:43,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:32:43,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:43,043 INFO L87 Difference]: Start difference. First operand 1190 states. Second operand 5 states. [2019-11-23 22:32:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:44,829 INFO L93 Difference]: Finished difference Result 2203 states and 3804 transitions. [2019-11-23 22:32:44,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:32:44,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-23 22:32:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:44,857 INFO L225 Difference]: With dead ends: 2203 [2019-11-23 22:32:44,857 INFO L226 Difference]: Without dead ends: 1434 [2019-11-23 22:32:44,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:32:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-11-23 22:32:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1420. [2019-11-23 22:32:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2019-11-23 22:32:44,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1838 transitions. [2019-11-23 22:32:44,990 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1838 transitions. Word has length 52 [2019-11-23 22:32:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:44,990 INFO L462 AbstractCegarLoop]: Abstraction has 1420 states and 1838 transitions. [2019-11-23 22:32:44,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:32:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1838 transitions. [2019-11-23 22:32:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:32:44,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:44,995 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] [2019-11-23 22:32:44,995 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:44,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash -625695834, now seen corresponding path program 1 times [2019-11-23 22:32:44,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:44,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130076313] [2019-11-23 22:32:44,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:45,105 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 22:32:45,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130076313] [2019-11-23 22:32:45,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:45,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:45,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732491788] [2019-11-23 22:32:45,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:32:45,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:32:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:45,109 INFO L87 Difference]: Start difference. First operand 1420 states and 1838 transitions. Second operand 5 states. [2019-11-23 22:32:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:46,195 INFO L93 Difference]: Finished difference Result 2665 states and 3516 transitions. [2019-11-23 22:32:46,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:32:46,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-23 22:32:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:46,205 INFO L225 Difference]: With dead ends: 2665 [2019-11-23 22:32:46,205 INFO L226 Difference]: Without dead ends: 1806 [2019-11-23 22:32:46,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:32:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-11-23 22:32:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1796. [2019-11-23 22:32:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2019-11-23 22:32:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2360 transitions. [2019-11-23 22:32:46,275 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2360 transitions. Word has length 52 [2019-11-23 22:32:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:46,276 INFO L462 AbstractCegarLoop]: Abstraction has 1796 states and 2360 transitions. [2019-11-23 22:32:46,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:32:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2360 transitions. [2019-11-23 22:32:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:32:46,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:46,280 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] [2019-11-23 22:32:46,280 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:46,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1958316630, now seen corresponding path program 1 times [2019-11-23 22:32:46,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:46,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917437149] [2019-11-23 22:32:46,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:46,391 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 22:32:46,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917437149] [2019-11-23 22:32:46,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:46,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:32:46,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646424988] [2019-11-23 22:32:46,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:32:46,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:46,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:32:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:32:46,394 INFO L87 Difference]: Start difference. First operand 1796 states and 2360 transitions. Second operand 6 states. [2019-11-23 22:32:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:47,778 INFO L93 Difference]: Finished difference Result 4466 states and 5979 transitions. [2019-11-23 22:32:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:32:47,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-23 22:32:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:47,797 INFO L225 Difference]: With dead ends: 4466 [2019-11-23 22:32:47,798 INFO L226 Difference]: Without dead ends: 3528 [2019-11-23 22:32:47,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:32:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2019-11-23 22:32:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2611. [2019-11-23 22:32:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2611 states. [2019-11-23 22:32:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3411 transitions. [2019-11-23 22:32:48,005 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3411 transitions. Word has length 52 [2019-11-23 22:32:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:48,006 INFO L462 AbstractCegarLoop]: Abstraction has 2611 states and 3411 transitions. [2019-11-23 22:32:48,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:32:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3411 transitions. [2019-11-23 22:32:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:48,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:48,021 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] [2019-11-23 22:32:48,021 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:48,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1639759782, now seen corresponding path program 1 times [2019-11-23 22:32:48,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:48,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637281105] [2019-11-23 22:32:48,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:48,343 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 22:32:48,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637281105] [2019-11-23 22:32:48,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:48,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:48,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206808430] [2019-11-23 22:32:48,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:48,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:48,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:48,348 INFO L87 Difference]: Start difference. First operand 2611 states and 3411 transitions. Second operand 9 states. [2019-11-23 22:32:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:51,036 INFO L93 Difference]: Finished difference Result 5667 states and 7976 transitions. [2019-11-23 22:32:51,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:32:51,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-23 22:32:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:51,059 INFO L225 Difference]: With dead ends: 5667 [2019-11-23 22:32:51,060 INFO L226 Difference]: Without dead ends: 5143 [2019-11-23 22:32:51,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:32:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5143 states. [2019-11-23 22:32:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5143 to 2611. [2019-11-23 22:32:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2611 states. [2019-11-23 22:32:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3410 transitions. [2019-11-23 22:32:51,205 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3410 transitions. Word has length 54 [2019-11-23 22:32:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:51,206 INFO L462 AbstractCegarLoop]: Abstraction has 2611 states and 3410 transitions. [2019-11-23 22:32:51,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3410 transitions. [2019-11-23 22:32:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:51,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:51,210 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] [2019-11-23 22:32:51,211 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:51,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1969154310, now seen corresponding path program 1 times [2019-11-23 22:32:51,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:51,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448366867] [2019-11-23 22:32:51,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:51,351 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 22:32:51,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448366867] [2019-11-23 22:32:51,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:51,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:51,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868903889] [2019-11-23 22:32:51,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:51,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:51,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:51,354 INFO L87 Difference]: Start difference. First operand 2611 states and 3410 transitions. Second operand 9 states. [2019-11-23 22:32:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:53,928 INFO L93 Difference]: Finished difference Result 4469 states and 6034 transitions. [2019-11-23 22:32:53,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:32:53,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-23 22:32:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:53,947 INFO L225 Difference]: With dead ends: 4469 [2019-11-23 22:32:53,948 INFO L226 Difference]: Without dead ends: 4463 [2019-11-23 22:32:53,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:32:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4463 states. [2019-11-23 22:32:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4463 to 2611. [2019-11-23 22:32:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2611 states. [2019-11-23 22:32:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3409 transitions. [2019-11-23 22:32:54,163 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3409 transitions. Word has length 54 [2019-11-23 22:32:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:54,164 INFO L462 AbstractCegarLoop]: Abstraction has 2611 states and 3409 transitions. [2019-11-23 22:32:54,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3409 transitions. [2019-11-23 22:32:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:54,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:54,171 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] [2019-11-23 22:32:54,171 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:54,172 INFO L82 PathProgramCache]: Analyzing trace with hash -91421350, now seen corresponding path program 1 times [2019-11-23 22:32:54,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:54,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698754542] [2019-11-23 22:32:54,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:54,487 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 22:32:54,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698754542] [2019-11-23 22:32:54,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:54,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:32:54,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346433505] [2019-11-23 22:32:54,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:32:54,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:32:54,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:32:54,490 INFO L87 Difference]: Start difference. First operand 2611 states and 3409 transitions. Second operand 8 states. [2019-11-23 22:32:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:56,469 INFO L93 Difference]: Finished difference Result 4651 states and 6340 transitions. [2019-11-23 22:32:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:32:56,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-11-23 22:32:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:56,491 INFO L225 Difference]: With dead ends: 4651 [2019-11-23 22:32:56,491 INFO L226 Difference]: Without dead ends: 3971 [2019-11-23 22:32:56,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:32:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2019-11-23 22:32:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 2611. [2019-11-23 22:32:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2611 states. [2019-11-23 22:32:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3408 transitions. [2019-11-23 22:32:56,762 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3408 transitions. Word has length 54 [2019-11-23 22:32:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:56,762 INFO L462 AbstractCegarLoop]: Abstraction has 2611 states and 3408 transitions. [2019-11-23 22:32:56,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:32:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3408 transitions. [2019-11-23 22:32:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:32:56,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:56,766 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] [2019-11-23 22:32:56,767 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:56,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash -217892301, now seen corresponding path program 1 times [2019-11-23 22:32:56,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:56,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936134693] [2019-11-23 22:32:56,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:56,817 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 22:32:56,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936134693] [2019-11-23 22:32:56,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:56,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:56,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012935671] [2019-11-23 22:32:56,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:56,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:56,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:56,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:56,819 INFO L87 Difference]: Start difference. First operand 2611 states and 3408 transitions. Second operand 3 states. [2019-11-23 22:32:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:57,106 INFO L93 Difference]: Finished difference Result 4310 states and 5811 transitions. [2019-11-23 22:32:57,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:57,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:32:57,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:57,120 INFO L225 Difference]: With dead ends: 4310 [2019-11-23 22:32:57,121 INFO L226 Difference]: Without dead ends: 2881 [2019-11-23 22:32:57,125 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 22:32:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2019-11-23 22:32:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2879. [2019-11-23 22:32:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2879 states. [2019-11-23 22:32:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 3738 transitions. [2019-11-23 22:32:57,317 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 3738 transitions. Word has length 55 [2019-11-23 22:32:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:57,319 INFO L462 AbstractCegarLoop]: Abstraction has 2879 states and 3738 transitions. [2019-11-23 22:32:57,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 3738 transitions. [2019-11-23 22:32:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:32:57,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:57,323 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] [2019-11-23 22:32:57,323 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1212692211, now seen corresponding path program 1 times [2019-11-23 22:32:57,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:57,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242767090] [2019-11-23 22:32:57,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:57,419 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 22:32:57,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242767090] [2019-11-23 22:32:57,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:57,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:57,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138173611] [2019-11-23 22:32:57,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:57,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:57,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:57,422 INFO L87 Difference]: Start difference. First operand 2879 states and 3738 transitions. Second operand 3 states. [2019-11-23 22:32:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:57,664 INFO L93 Difference]: Finished difference Result 4509 states and 6181 transitions. [2019-11-23 22:32:57,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:57,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:32:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:57,679 INFO L225 Difference]: With dead ends: 4509 [2019-11-23 22:32:57,679 INFO L226 Difference]: Without dead ends: 3346 [2019-11-23 22:32:57,682 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 22:32:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-11-23 22:32:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3344. [2019-11-23 22:32:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3344 states. [2019-11-23 22:32:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 3344 states and 4476 transitions. [2019-11-23 22:32:57,938 INFO L78 Accepts]: Start accepts. Automaton has 3344 states and 4476 transitions. Word has length 55 [2019-11-23 22:32:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:57,938 INFO L462 AbstractCegarLoop]: Abstraction has 3344 states and 4476 transitions. [2019-11-23 22:32:57,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 4476 transitions. [2019-11-23 22:32:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:32:57,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:57,942 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] [2019-11-23 22:32:57,942 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:57,942 INFO L82 PathProgramCache]: Analyzing trace with hash 508156110, now seen corresponding path program 1 times [2019-11-23 22:32:57,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:57,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703945855] [2019-11-23 22:32:57,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:57,991 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 22:32:57,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703945855] [2019-11-23 22:32:57,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:57,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:57,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632779952] [2019-11-23 22:32:57,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:57,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:57,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:57,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:57,994 INFO L87 Difference]: Start difference. First operand 3344 states and 4476 transitions. Second operand 3 states. [2019-11-23 22:32:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:58,288 INFO L93 Difference]: Finished difference Result 6238 states and 8743 transitions. [2019-11-23 22:32:58,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:58,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:32:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:58,302 INFO L225 Difference]: With dead ends: 6238 [2019-11-23 22:32:58,303 INFO L226 Difference]: Without dead ends: 4390 [2019-11-23 22:32:58,307 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 22:32:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-11-23 22:32:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 4388. [2019-11-23 22:32:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4388 states. [2019-11-23 22:32:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4388 states to 4388 states and 5988 transitions. [2019-11-23 22:32:58,570 INFO L78 Accepts]: Start accepts. Automaton has 4388 states and 5988 transitions. Word has length 55 [2019-11-23 22:32:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:58,570 INFO L462 AbstractCegarLoop]: Abstraction has 4388 states and 5988 transitions. [2019-11-23 22:32:58,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4388 states and 5988 transitions. [2019-11-23 22:32:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:32:58,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:58,574 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] [2019-11-23 22:32:58,574 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:58,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1409707165, now seen corresponding path program 1 times [2019-11-23 22:32:58,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:58,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382073863] [2019-11-23 22:32:58,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:58,639 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 22:32:58,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382073863] [2019-11-23 22:32:58,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:58,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:58,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158800987] [2019-11-23 22:32:58,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:58,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:58,641 INFO L87 Difference]: Start difference. First operand 4388 states and 5988 transitions. Second operand 3 states. [2019-11-23 22:32:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:59,226 INFO L93 Difference]: Finished difference Result 8395 states and 11658 transitions. [2019-11-23 22:32:59,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:59,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-23 22:32:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:59,238 INFO L225 Difference]: With dead ends: 8395 [2019-11-23 22:32:59,238 INFO L226 Difference]: Without dead ends: 4735 [2019-11-23 22:32:59,244 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 22:32:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2019-11-23 22:32:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 3774. [2019-11-23 22:32:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3774 states. [2019-11-23 22:32:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 5219 transitions. [2019-11-23 22:32:59,586 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 5219 transitions. Word has length 56 [2019-11-23 22:32:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:59,586 INFO L462 AbstractCegarLoop]: Abstraction has 3774 states and 5219 transitions. [2019-11-23 22:32:59,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 5219 transitions. [2019-11-23 22:32:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:32:59,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:59,589 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] [2019-11-23 22:32:59,589 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1142157029, now seen corresponding path program 1 times [2019-11-23 22:32:59,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:59,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986744348] [2019-11-23 22:32:59,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:59,948 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 22:32:59,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986744348] [2019-11-23 22:32:59,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:59,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:32:59,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329798988] [2019-11-23 22:32:59,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:32:59,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:59,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:32:59,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:32:59,951 INFO L87 Difference]: Start difference. First operand 3774 states and 5219 transitions. Second operand 11 states. [2019-11-23 22:33:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:02,280 INFO L93 Difference]: Finished difference Result 9208 states and 12902 transitions. [2019-11-23 22:33:02,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:02,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-11-23 22:33:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:02,298 INFO L225 Difference]: With dead ends: 9208 [2019-11-23 22:33:02,298 INFO L226 Difference]: Without dead ends: 9057 [2019-11-23 22:33:02,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:33:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9057 states. [2019-11-23 22:33:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9057 to 3722. [2019-11-23 22:33:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3722 states. [2019-11-23 22:33:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5156 transitions. [2019-11-23 22:33:02,778 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5156 transitions. Word has length 56 [2019-11-23 22:33:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:02,778 INFO L462 AbstractCegarLoop]: Abstraction has 3722 states and 5156 transitions. [2019-11-23 22:33:02,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:33:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5156 transitions. [2019-11-23 22:33:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:33:02,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:02,780 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] [2019-11-23 22:33:02,780 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1119831979, now seen corresponding path program 1 times [2019-11-23 22:33:02,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:02,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055434155] [2019-11-23 22:33:02,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:02,819 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 22:33:02,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055434155] [2019-11-23 22:33:02,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:02,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:02,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051195446] [2019-11-23 22:33:02,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:02,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:02,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:02,821 INFO L87 Difference]: Start difference. First operand 3722 states and 5156 transitions. Second operand 3 states. [2019-11-23 22:33:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:03,222 INFO L93 Difference]: Finished difference Result 7404 states and 10436 transitions. [2019-11-23 22:33:03,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:03,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-23 22:33:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:03,232 INFO L225 Difference]: With dead ends: 7404 [2019-11-23 22:33:03,232 INFO L226 Difference]: Without dead ends: 4165 [2019-11-23 22:33:03,238 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 22:33:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2019-11-23 22:33:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 3355. [2019-11-23 22:33:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3355 states. [2019-11-23 22:33:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4684 transitions. [2019-11-23 22:33:03,792 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4684 transitions. Word has length 56 [2019-11-23 22:33:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:03,793 INFO L462 AbstractCegarLoop]: Abstraction has 3355 states and 4684 transitions. [2019-11-23 22:33:03,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4684 transitions. [2019-11-23 22:33:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:33:03,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:03,801 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] [2019-11-23 22:33:03,801 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:03,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1444192760, now seen corresponding path program 1 times [2019-11-23 22:33:03,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:03,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568443245] [2019-11-23 22:33:03,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:04,374 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 22:33:04,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568443245] [2019-11-23 22:33:04,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:04,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:33:04,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806041989] [2019-11-23 22:33:04,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:33:04,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:04,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:33:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:33:04,377 INFO L87 Difference]: Start difference. First operand 3355 states and 4684 transitions. Second operand 19 states. [2019-11-23 22:33:04,523 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-11-23 22:33:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:09,041 INFO L93 Difference]: Finished difference Result 9317 states and 13196 transitions. [2019-11-23 22:33:09,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:33:09,042 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-11-23 22:33:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:09,056 INFO L225 Difference]: With dead ends: 9317 [2019-11-23 22:33:09,056 INFO L226 Difference]: Without dead ends: 9313 [2019-11-23 22:33:09,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 22:33:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9313 states. [2019-11-23 22:33:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9313 to 3355. [2019-11-23 22:33:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3355 states. [2019-11-23 22:33:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4683 transitions. [2019-11-23 22:33:09,578 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4683 transitions. Word has length 57 [2019-11-23 22:33:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:09,578 INFO L462 AbstractCegarLoop]: Abstraction has 3355 states and 4683 transitions. [2019-11-23 22:33:09,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:33:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4683 transitions. [2019-11-23 22:33:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:33:09,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:09,580 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] [2019-11-23 22:33:09,580 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:09,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2124806246, now seen corresponding path program 1 times [2019-11-23 22:33:09,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:09,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277094026] [2019-11-23 22:33:09,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:09,986 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 22:33:09,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277094026] [2019-11-23 22:33:09,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:09,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-23 22:33:09,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371243343] [2019-11-23 22:33:09,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:33:09,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:09,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:33:09,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:33:09,989 INFO L87 Difference]: Start difference. First operand 3355 states and 4683 transitions. Second operand 12 states. [2019-11-23 22:33:11,474 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-23 22:33:11,841 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-11-23 22:33:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:13,516 INFO L93 Difference]: Finished difference Result 9484 states and 13389 transitions. [2019-11-23 22:33:13,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:33:13,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-11-23 22:33:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:13,526 INFO L225 Difference]: With dead ends: 9484 [2019-11-23 22:33:13,527 INFO L226 Difference]: Without dead ends: 9332 [2019-11-23 22:33:13,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:33:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9332 states. [2019-11-23 22:33:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9332 to 3302. [2019-11-23 22:33:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3302 states. [2019-11-23 22:33:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4614 transitions. [2019-11-23 22:33:13,961 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4614 transitions. Word has length 58 [2019-11-23 22:33:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:13,962 INFO L462 AbstractCegarLoop]: Abstraction has 3302 states and 4614 transitions. [2019-11-23 22:33:13,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:33:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4614 transitions. [2019-11-23 22:33:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:33:13,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:13,964 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] [2019-11-23 22:33:13,964 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:13,964 INFO L82 PathProgramCache]: Analyzing trace with hash -386654778, now seen corresponding path program 1 times [2019-11-23 22:33:13,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:13,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209993793] [2019-11-23 22:33:13,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:14,009 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 22:33:14,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209993793] [2019-11-23 22:33:14,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:14,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:14,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582543446] [2019-11-23 22:33:14,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:14,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:14,011 INFO L87 Difference]: Start difference. First operand 3302 states and 4614 transitions. Second operand 3 states. [2019-11-23 22:33:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:14,701 INFO L93 Difference]: Finished difference Result 8376 states and 11918 transitions. [2019-11-23 22:33:14,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:14,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:33:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:14,705 INFO L225 Difference]: With dead ends: 8376 [2019-11-23 22:33:14,705 INFO L226 Difference]: Without dead ends: 5638 [2019-11-23 22:33:14,708 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 22:33:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2019-11-23 22:33:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5636. [2019-11-23 22:33:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2019-11-23 22:33:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7868 transitions. [2019-11-23 22:33:15,314 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7868 transitions. Word has length 61 [2019-11-23 22:33:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:15,314 INFO L462 AbstractCegarLoop]: Abstraction has 5636 states and 7868 transitions. [2019-11-23 22:33:15,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7868 transitions. [2019-11-23 22:33:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:33:15,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:15,315 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] [2019-11-23 22:33:15,315 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash 633580297, now seen corresponding path program 1 times [2019-11-23 22:33:15,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:15,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380959975] [2019-11-23 22:33:15,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:15,398 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 22:33:15,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380959975] [2019-11-23 22:33:15,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:15,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:15,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319634776] [2019-11-23 22:33:15,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:15,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:15,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:15,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:15,401 INFO L87 Difference]: Start difference. First operand 5636 states and 7868 transitions. Second operand 5 states. [2019-11-23 22:33:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:16,112 INFO L93 Difference]: Finished difference Result 9618 states and 13509 transitions. [2019-11-23 22:33:16,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:16,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-23 22:33:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:16,116 INFO L225 Difference]: With dead ends: 9618 [2019-11-23 22:33:16,116 INFO L226 Difference]: Without dead ends: 4508 [2019-11-23 22:33:16,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2019-11-23 22:33:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 3890. [2019-11-23 22:33:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3890 states. [2019-11-23 22:33:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 5337 transitions. [2019-11-23 22:33:16,611 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 5337 transitions. Word has length 62 [2019-11-23 22:33:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:16,611 INFO L462 AbstractCegarLoop]: Abstraction has 3890 states and 5337 transitions. [2019-11-23 22:33:16,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 5337 transitions. [2019-11-23 22:33:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:33:16,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:16,613 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] [2019-11-23 22:33:16,613 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:16,614 INFO L82 PathProgramCache]: Analyzing trace with hash 480339852, now seen corresponding path program 1 times [2019-11-23 22:33:16,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:16,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675290133] [2019-11-23 22:33:16,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:16,684 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 22:33:16,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675290133] [2019-11-23 22:33:16,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:16,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:16,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993241770] [2019-11-23 22:33:16,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:33:16,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:16,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:33:16,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:33:16,686 INFO L87 Difference]: Start difference. First operand 3890 states and 5337 transitions. Second operand 6 states. [2019-11-23 22:33:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:18,099 INFO L93 Difference]: Finished difference Result 7633 states and 10490 transitions. [2019-11-23 22:33:18,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:33:18,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-23 22:33:18,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:18,106 INFO L225 Difference]: With dead ends: 7633 [2019-11-23 22:33:18,106 INFO L226 Difference]: Without dead ends: 7631 [2019-11-23 22:33:18,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7631 states. [2019-11-23 22:33:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7631 to 4007. [2019-11-23 22:33:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2019-11-23 22:33:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5454 transitions. [2019-11-23 22:33:18,693 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5454 transitions. Word has length 66 [2019-11-23 22:33:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:18,694 INFO L462 AbstractCegarLoop]: Abstraction has 4007 states and 5454 transitions. [2019-11-23 22:33:18,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:33:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5454 transitions. [2019-11-23 22:33:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:33:18,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:18,696 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] [2019-11-23 22:33:18,696 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:18,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:18,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2118455333, now seen corresponding path program 1 times [2019-11-23 22:33:18,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:18,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559134281] [2019-11-23 22:33:18,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:18,749 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 22:33:18,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559134281] [2019-11-23 22:33:18,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:18,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:18,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930631680] [2019-11-23 22:33:18,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:18,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:18,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:18,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:18,752 INFO L87 Difference]: Start difference. First operand 4007 states and 5454 transitions. Second operand 3 states. [2019-11-23 22:33:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:20,311 INFO L93 Difference]: Finished difference Result 10269 states and 14100 transitions. [2019-11-23 22:33:20,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:20,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:33:20,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:20,317 INFO L225 Difference]: With dead ends: 10269 [2019-11-23 22:33:20,317 INFO L226 Difference]: Without dead ends: 6738 [2019-11-23 22:33:20,320 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 22:33:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2019-11-23 22:33:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6736. [2019-11-23 22:33:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6736 states. [2019-11-23 22:33:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 9135 transitions. [2019-11-23 22:33:21,296 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 9135 transitions. Word has length 67 [2019-11-23 22:33:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:21,296 INFO L462 AbstractCegarLoop]: Abstraction has 6736 states and 9135 transitions. [2019-11-23 22:33:21,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 9135 transitions. [2019-11-23 22:33:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:33:21,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:21,298 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] [2019-11-23 22:33:21,298 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:21,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1829906877, now seen corresponding path program 1 times [2019-11-23 22:33:21,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:21,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524786420] [2019-11-23 22:33:21,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:21,434 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 22:33:21,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524786420] [2019-11-23 22:33:21,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:21,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:21,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370142892] [2019-11-23 22:33:21,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:33:21,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:33:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:21,438 INFO L87 Difference]: Start difference. First operand 6736 states and 9135 transitions. Second operand 7 states. [2019-11-23 22:33:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:25,888 INFO L93 Difference]: Finished difference Result 26249 states and 35468 transitions. [2019-11-23 22:33:25,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:33:25,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-11-23 22:33:25,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:25,908 INFO L225 Difference]: With dead ends: 26249 [2019-11-23 22:33:25,908 INFO L226 Difference]: Without dead ends: 22635 [2019-11-23 22:33:25,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22635 states. [2019-11-23 22:33:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22635 to 13382. [2019-11-23 22:33:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13382 states. [2019-11-23 22:33:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13382 states to 13382 states and 18305 transitions. [2019-11-23 22:33:28,160 INFO L78 Accepts]: Start accepts. Automaton has 13382 states and 18305 transitions. Word has length 68 [2019-11-23 22:33:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:28,160 INFO L462 AbstractCegarLoop]: Abstraction has 13382 states and 18305 transitions. [2019-11-23 22:33:28,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:33:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13382 states and 18305 transitions. [2019-11-23 22:33:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 22:33:28,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:28,162 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] [2019-11-23 22:33:28,162 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:28,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1615525661, now seen corresponding path program 1 times [2019-11-23 22:33:28,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:28,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149006755] [2019-11-23 22:33:28,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:28,237 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 22:33:28,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149006755] [2019-11-23 22:33:28,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:28,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:28,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377587668] [2019-11-23 22:33:28,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:33:28,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:28,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:33:28,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:28,239 INFO L87 Difference]: Start difference. First operand 13382 states and 18305 transitions. Second operand 7 states. [2019-11-23 22:33:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:35,255 INFO L93 Difference]: Finished difference Result 40996 states and 56254 transitions. [2019-11-23 22:33:35,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:33:35,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-11-23 22:33:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:35,284 INFO L225 Difference]: With dead ends: 40996 [2019-11-23 22:33:35,284 INFO L226 Difference]: Without dead ends: 32754 [2019-11-23 22:33:35,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32754 states. [2019-11-23 22:33:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32754 to 21254. [2019-11-23 22:33:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21254 states. [2019-11-23 22:33:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21254 states to 21254 states and 29145 transitions. [2019-11-23 22:33:38,669 INFO L78 Accepts]: Start accepts. Automaton has 21254 states and 29145 transitions. Word has length 71 [2019-11-23 22:33:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:38,669 INFO L462 AbstractCegarLoop]: Abstraction has 21254 states and 29145 transitions. [2019-11-23 22:33:38,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:33:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 21254 states and 29145 transitions. [2019-11-23 22:33:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-23 22:33:38,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:38,673 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] [2019-11-23 22:33:38,673 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1529804766, now seen corresponding path program 1 times [2019-11-23 22:33:38,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:38,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077388113] [2019-11-23 22:33:38,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:38,739 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 22:33:38,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077388113] [2019-11-23 22:33:38,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:38,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:38,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824419655] [2019-11-23 22:33:38,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:38,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:38,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:38,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:38,741 INFO L87 Difference]: Start difference. First operand 21254 states and 29145 transitions. Second operand 3 states. [2019-11-23 22:33:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:45,411 INFO L93 Difference]: Finished difference Result 60150 states and 82245 transitions. [2019-11-23 22:33:45,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:45,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-23 22:33:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:45,448 INFO L225 Difference]: With dead ends: 60150 [2019-11-23 22:33:45,449 INFO L226 Difference]: Without dead ends: 39374 [2019-11-23 22:33:45,469 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 22:33:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39374 states. [2019-11-23 22:33:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39374 to 28920. [2019-11-23 22:33:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28920 states. [2019-11-23 22:33:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28920 states to 28920 states and 38940 transitions. [2019-11-23 22:33:50,644 INFO L78 Accepts]: Start accepts. Automaton has 28920 states and 38940 transitions. Word has length 79 [2019-11-23 22:33:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:50,644 INFO L462 AbstractCegarLoop]: Abstraction has 28920 states and 38940 transitions. [2019-11-23 22:33:50,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 28920 states and 38940 transitions. [2019-11-23 22:33:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-23 22:33:50,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:50,647 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] [2019-11-23 22:33:50,648 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash -769071113, now seen corresponding path program 1 times [2019-11-23 22:33:50,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:50,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683271136] [2019-11-23 22:33:50,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:50,720 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 22:33:50,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683271136] [2019-11-23 22:33:50,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:50,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:50,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741279677] [2019-11-23 22:33:50,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:50,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:50,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:50,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:50,728 INFO L87 Difference]: Start difference. First operand 28920 states and 38940 transitions. Second operand 3 states. [2019-11-23 22:33:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:57,859 INFO L93 Difference]: Finished difference Result 66092 states and 88822 transitions. [2019-11-23 22:33:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:57,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-23 22:33:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:57,897 INFO L225 Difference]: With dead ends: 66092 [2019-11-23 22:33:57,897 INFO L226 Difference]: Without dead ends: 37650 [2019-11-23 22:33:57,917 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 22:33:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37650 states. [2019-11-23 22:34:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37650 to 29616. [2019-11-23 22:34:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29616 states. [2019-11-23 22:34:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29616 states to 29616 states and 39096 transitions. [2019-11-23 22:34:03,204 INFO L78 Accepts]: Start accepts. Automaton has 29616 states and 39096 transitions. Word has length 82 [2019-11-23 22:34:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:03,205 INFO L462 AbstractCegarLoop]: Abstraction has 29616 states and 39096 transitions. [2019-11-23 22:34:03,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 29616 states and 39096 transitions. [2019-11-23 22:34:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:34:03,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:03,207 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] [2019-11-23 22:34:03,208 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash 788412604, now seen corresponding path program 1 times [2019-11-23 22:34:03,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:03,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252213976] [2019-11-23 22:34:03,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:03,340 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 22:34:03,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252213976] [2019-11-23 22:34:03,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:03,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:34:03,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553632437] [2019-11-23 22:34:03,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:34:03,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:03,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:34:03,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:34:03,342 INFO L87 Difference]: Start difference. First operand 29616 states and 39096 transitions. Second operand 6 states.