/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.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:33:42,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:33:42,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:33:42,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:33:42,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:33:42,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:33:42,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:33:42,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:33:42,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:33:42,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:33:42,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:33:42,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:33:42,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:33:42,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:33:42,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:33:42,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:33:42,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:33:42,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:33:42,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:33:42,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:33:42,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:33:42,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:33:42,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:33:42,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:33:42,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:33:42,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:33:42,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:33:42,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:33:42,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:33:42,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:33:42,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:33:42,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:33:42,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:33:42,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:33:42,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:33:42,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:33:42,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:33:42,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:33:42,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:33:42,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:33:42,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:33:42,585 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:33:42,605 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:33:42,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:33:42,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:33:42,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:33:42,608 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:33:42,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:33:42,608 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:33:42,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:33:42,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:33:42,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:33:42,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:33:42,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:33:42,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:33:42,610 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:33:42,611 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:33:42,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:33:42,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:33:42,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:33:42,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:33:42,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:33:42,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:33:42,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:33:42,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:33:42,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:33:42,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:33:42,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:33:42,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:33:42,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:33:42,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:33:42,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:33:42,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:33:42,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:33:42,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:33:42,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:33:42,891 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:33:42,892 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.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-23 22:33:42,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d484017e/7216dc8173844583b57d9a2d62365c85/FLAG5d1b54742 [2019-11-23 22:33:43,676 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:33:43,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-23 22:33:43,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d484017e/7216dc8173844583b57d9a2d62365c85/FLAG5d1b54742 [2019-11-23 22:33:43,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d484017e/7216dc8173844583b57d9a2d62365c85 [2019-11-23 22:33:43,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:33:43,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:33:43,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:33:43,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:33:43,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:33:43,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:33:43" (1/1) ... [2019-11-23 22:33:43,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164b9106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:43, skipping insertion in model container [2019-11-23 22:33:43,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:33:43" (1/1) ... [2019-11-23 22:33:43,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:33:44,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:33:44,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:33:44,992 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:33:45,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:33:45,387 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:33:45,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45 WrapperNode [2019-11-23 22:33:45,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:33:45,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:33:45,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:33:45,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:33:45,404 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:33:45" (1/1) ... [2019-11-23 22:33:45,479 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:33:45" (1/1) ... [2019-11-23 22:33:45,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:33:45,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:33:45,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:33:45,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:33:45,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45" (1/1) ... [2019-11-23 22:33:45,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45" (1/1) ... [2019-11-23 22:33:45,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45" (1/1) ... [2019-11-23 22:33:45,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45" (1/1) ... [2019-11-23 22:33:45,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45" (1/1) ... [2019-11-23 22:33:45,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45" (1/1) ... [2019-11-23 22:33:45,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45" (1/1) ... [2019-11-23 22:33:45,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:33:45,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:33:45,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:33:45,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:33:45,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45" (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:33:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:33:45,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:33:49,374 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:33:49,374 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:33:49,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:33:49 BoogieIcfgContainer [2019-11-23 22:33:49,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:33:49,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:33:49,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:33:49,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:33:49,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:33:43" (1/3) ... [2019-11-23 22:33:49,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1873f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:33:49, skipping insertion in model container [2019-11-23 22:33:49,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:45" (2/3) ... [2019-11-23 22:33:49,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1873f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:33:49, skipping insertion in model container [2019-11-23 22:33:49,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:33:49" (3/3) ... [2019-11-23 22:33:49,393 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-23 22:33:49,407 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:33:49,417 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-23 22:33:49,434 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-23 22:33:49,501 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:33:49,501 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:33:49,501 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:33:49,501 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:33:49,502 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:33:49,502 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:33:49,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:33:49,503 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:33:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states. [2019-11-23 22:33:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:49,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:49,583 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] [2019-11-23 22:33:49,583 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:33:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:49,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1703299446, now seen corresponding path program 1 times [2019-11-23 22:33:49,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:49,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87075994] [2019-11-23 22:33:49,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:50,094 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,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87075994] [2019-11-23 22:33:50,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:50,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:33:50,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015424225] [2019-11-23 22:33:50,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:50,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:50,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:50,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:50,118 INFO L87 Difference]: Start difference. First operand 1121 states. Second operand 5 states. [2019-11-23 22:33:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:51,831 INFO L93 Difference]: Finished difference Result 2061 states and 3646 transitions. [2019-11-23 22:33:51,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:51,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-23 22:33:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:51,859 INFO L225 Difference]: With dead ends: 2061 [2019-11-23 22:33:51,859 INFO L226 Difference]: Without dead ends: 1339 [2019-11-23 22:33:51,867 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:33:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-11-23 22:33:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1327. [2019-11-23 22:33:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1327 states. [2019-11-23 22:33:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1765 transitions. [2019-11-23 22:33:52,005 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1765 transitions. Word has length 51 [2019-11-23 22:33:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:52,006 INFO L462 AbstractCegarLoop]: Abstraction has 1327 states and 1765 transitions. [2019-11-23 22:33:52,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1765 transitions. [2019-11-23 22:33:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:52,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:52,010 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] [2019-11-23 22:33:52,010 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:33:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash 199718681, now seen corresponding path program 1 times [2019-11-23 22:33:52,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:52,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974244358] [2019-11-23 22:33:52,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:52,165 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:52,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974244358] [2019-11-23 22:33:52,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:52,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:33:52,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852315997] [2019-11-23 22:33:52,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:52,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:52,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:52,170 INFO L87 Difference]: Start difference. First operand 1327 states and 1765 transitions. Second operand 5 states. [2019-11-23 22:33:53,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:53,401 INFO L93 Difference]: Finished difference Result 2510 states and 3426 transitions. [2019-11-23 22:33:53,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:53,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-23 22:33:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:53,412 INFO L225 Difference]: With dead ends: 2510 [2019-11-23 22:33:53,412 INFO L226 Difference]: Without dead ends: 1697 [2019-11-23 22:33:53,415 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:33:53,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-11-23 22:33:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1687. [2019-11-23 22:33:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-11-23 22:33:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2295 transitions. [2019-11-23 22:33:53,496 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2295 transitions. Word has length 51 [2019-11-23 22:33:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:53,497 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 2295 transitions. [2019-11-23 22:33:53,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2295 transitions. [2019-11-23 22:33:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:53,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:53,501 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] [2019-11-23 22:33:53,502 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:33:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1084504014, now seen corresponding path program 1 times [2019-11-23 22:33:53,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:53,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710194906] [2019-11-23 22:33:53,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:53,615 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:53,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710194906] [2019-11-23 22:33:53,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:53,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:53,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118936403] [2019-11-23 22:33:53,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:33:53,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:53,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:33:53,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:33:53,619 INFO L87 Difference]: Start difference. First operand 1687 states and 2295 transitions. Second operand 6 states. [2019-11-23 22:33:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:54,966 INFO L93 Difference]: Finished difference Result 4075 states and 5640 transitions. [2019-11-23 22:33:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:54,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-23 22:33:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:54,981 INFO L225 Difference]: With dead ends: 4075 [2019-11-23 22:33:54,982 INFO L226 Difference]: Without dead ends: 3189 [2019-11-23 22:33:54,984 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:33:54,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-11-23 22:33:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2380. [2019-11-23 22:33:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2019-11-23 22:33:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3220 transitions. [2019-11-23 22:33:55,091 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3220 transitions. Word has length 51 [2019-11-23 22:33:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:55,092 INFO L462 AbstractCegarLoop]: Abstraction has 2380 states and 3220 transitions. [2019-11-23 22:33:55,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:33:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3220 transitions. [2019-11-23 22:33:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:55,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:55,095 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:33:55,096 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:33:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash -614217846, now seen corresponding path program 1 times [2019-11-23 22:33:55,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:55,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926520463] [2019-11-23 22:33:55,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:55,265 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:55,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926520463] [2019-11-23 22:33:55,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:55,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:55,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285344550] [2019-11-23 22:33:55,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:55,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:55,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:55,268 INFO L87 Difference]: Start difference. First operand 2380 states and 3220 transitions. Second operand 9 states. [2019-11-23 22:33:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:58,278 INFO L93 Difference]: Finished difference Result 4127 states and 5755 transitions. [2019-11-23 22:33:58,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:33:58,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-11-23 22:33:58,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:58,307 INFO L225 Difference]: With dead ends: 4127 [2019-11-23 22:33:58,308 INFO L226 Difference]: Without dead ends: 4122 [2019-11-23 22:33:58,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:33:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4122 states. [2019-11-23 22:33:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4122 to 2380. [2019-11-23 22:33:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2019-11-23 22:33:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3219 transitions. [2019-11-23 22:33:58,528 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3219 transitions. Word has length 52 [2019-11-23 22:33:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:58,528 INFO L462 AbstractCegarLoop]: Abstraction has 2380 states and 3219 transitions. [2019-11-23 22:33:58,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3219 transitions. [2019-11-23 22:33:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:58,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:58,532 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:33:58,533 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:33:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:58,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1085905725, now seen corresponding path program 1 times [2019-11-23 22:33:58,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:58,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220818112] [2019-11-23 22:33:58,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:58,755 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:58,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220818112] [2019-11-23 22:33:58,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:58,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:58,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507767029] [2019-11-23 22:33:58,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:58,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:58,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:58,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:58,759 INFO L87 Difference]: Start difference. First operand 2380 states and 3219 transitions. Second operand 9 states. [2019-11-23 22:34:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:02,703 INFO L93 Difference]: Finished difference Result 7118 states and 10384 transitions. [2019-11-23 22:34:02,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 22:34:02,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-11-23 22:34:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:02,745 INFO L225 Difference]: With dead ends: 7118 [2019-11-23 22:34:02,745 INFO L226 Difference]: Without dead ends: 6615 [2019-11-23 22:34:02,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-11-23 22:34:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6615 states. [2019-11-23 22:34:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6615 to 2380. [2019-11-23 22:34:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2019-11-23 22:34:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3218 transitions. [2019-11-23 22:34:02,926 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3218 transitions. Word has length 52 [2019-11-23 22:34:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:02,926 INFO L462 AbstractCegarLoop]: Abstraction has 2380 states and 3218 transitions. [2019-11-23 22:34:02,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:34:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3218 transitions. [2019-11-23 22:34:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:34:02,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:02,930 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:34:02,930 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:34:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash -592999742, now seen corresponding path program 1 times [2019-11-23 22:34:02,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:02,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954287988] [2019-11-23 22:34:02,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:03,072 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,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954287988] [2019-11-23 22:34:03,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:03,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:34:03,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245034824] [2019-11-23 22:34:03,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:34:03,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:34:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:34:03,078 INFO L87 Difference]: Start difference. First operand 2380 states and 3218 transitions. Second operand 8 states. [2019-11-23 22:34:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:05,028 INFO L93 Difference]: Finished difference Result 4291 states and 6038 transitions. [2019-11-23 22:34:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:34:05,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-23 22:34:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:05,044 INFO L225 Difference]: With dead ends: 4291 [2019-11-23 22:34:05,044 INFO L226 Difference]: Without dead ends: 3648 [2019-11-23 22:34:05,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:34:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-11-23 22:34:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2380. [2019-11-23 22:34:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2019-11-23 22:34:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3217 transitions. [2019-11-23 22:34:05,190 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3217 transitions. Word has length 52 [2019-11-23 22:34:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:05,190 INFO L462 AbstractCegarLoop]: Abstraction has 2380 states and 3217 transitions. [2019-11-23 22:34:05,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:34:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3217 transitions. [2019-11-23 22:34:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:34:05,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:05,194 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] [2019-11-23 22:34:05,194 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:34:05,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2034797542, now seen corresponding path program 1 times [2019-11-23 22:34:05,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:05,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558508540] [2019-11-23 22:34:05,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:05,243 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:05,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558508540] [2019-11-23 22:34:05,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:05,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:05,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966589990] [2019-11-23 22:34:05,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:05,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:05,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:05,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:05,245 INFO L87 Difference]: Start difference. First operand 2380 states and 3217 transitions. Second operand 3 states. [2019-11-23 22:34:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:05,549 INFO L93 Difference]: Finished difference Result 3973 states and 5552 transitions. [2019-11-23 22:34:05,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:05,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-23 22:34:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:05,560 INFO L225 Difference]: With dead ends: 3973 [2019-11-23 22:34:05,560 INFO L226 Difference]: Without dead ends: 2646 [2019-11-23 22:34:05,563 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:34:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2019-11-23 22:34:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2644. [2019-11-23 22:34:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2644 states. [2019-11-23 22:34:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3555 transitions. [2019-11-23 22:34:05,720 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3555 transitions. Word has length 53 [2019-11-23 22:34:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:05,720 INFO L462 AbstractCegarLoop]: Abstraction has 2644 states and 3555 transitions. [2019-11-23 22:34:05,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3555 transitions. [2019-11-23 22:34:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:34:05,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:05,724 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] [2019-11-23 22:34:05,724 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:34:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash -512099954, now seen corresponding path program 1 times [2019-11-23 22:34:05,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:05,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255527849] [2019-11-23 22:34:05,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:05,769 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:05,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255527849] [2019-11-23 22:34:05,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:05,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:05,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588786635] [2019-11-23 22:34:05,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:05,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:05,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:05,772 INFO L87 Difference]: Start difference. First operand 2644 states and 3555 transitions. Second operand 3 states. [2019-11-23 22:34:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:06,116 INFO L93 Difference]: Finished difference Result 4201 states and 5957 transitions. [2019-11-23 22:34:06,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:06,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-23 22:34:06,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:06,138 INFO L225 Difference]: With dead ends: 4201 [2019-11-23 22:34:06,138 INFO L226 Difference]: Without dead ends: 3115 [2019-11-23 22:34:06,141 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:34:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2019-11-23 22:34:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3113. [2019-11-23 22:34:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2019-11-23 22:34:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 4311 transitions. [2019-11-23 22:34:06,337 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 4311 transitions. Word has length 53 [2019-11-23 22:34:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:06,337 INFO L462 AbstractCegarLoop]: Abstraction has 3113 states and 4311 transitions. [2019-11-23 22:34:06,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 4311 transitions. [2019-11-23 22:34:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:34:06,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:06,341 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] [2019-11-23 22:34:06,341 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:34:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1062086298, now seen corresponding path program 1 times [2019-11-23 22:34:06,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:06,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194123843] [2019-11-23 22:34:06,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:06,383 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:06,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194123843] [2019-11-23 22:34:06,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:06,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:06,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006304582] [2019-11-23 22:34:06,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:06,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:06,385 INFO L87 Difference]: Start difference. First operand 3113 states and 4311 transitions. Second operand 3 states. [2019-11-23 22:34:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:06,656 INFO L93 Difference]: Finished difference Result 5935 states and 8590 transitions. [2019-11-23 22:34:06,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:06,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-23 22:34:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:06,666 INFO L225 Difference]: With dead ends: 5935 [2019-11-23 22:34:06,666 INFO L226 Difference]: Without dead ends: 4127 [2019-11-23 22:34:06,670 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:34:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2019-11-23 22:34:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 4125. [2019-11-23 22:34:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2019-11-23 22:34:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5818 transitions. [2019-11-23 22:34:07,166 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5818 transitions. Word has length 53 [2019-11-23 22:34:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:07,166 INFO L462 AbstractCegarLoop]: Abstraction has 4125 states and 5818 transitions. [2019-11-23 22:34:07,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5818 transitions. [2019-11-23 22:34:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:34:07,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:07,169 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:34:07,169 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:34:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:07,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1383066013, now seen corresponding path program 1 times [2019-11-23 22:34:07,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:07,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307458295] [2019-11-23 22:34:07,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:07,219 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:07,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307458295] [2019-11-23 22:34:07,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:07,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:07,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860601941] [2019-11-23 22:34:07,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:07,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:07,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:07,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:07,222 INFO L87 Difference]: Start difference. First operand 4125 states and 5818 transitions. Second operand 3 states. [2019-11-23 22:34:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:07,753 INFO L93 Difference]: Finished difference Result 7911 states and 11392 transitions. [2019-11-23 22:34:07,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:07,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:34:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:07,763 INFO L225 Difference]: With dead ends: 7911 [2019-11-23 22:34:07,764 INFO L226 Difference]: Without dead ends: 4469 [2019-11-23 22:34:07,769 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:34:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2019-11-23 22:34:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 3593. [2019-11-23 22:34:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3593 states. [2019-11-23 22:34:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5113 transitions. [2019-11-23 22:34:08,100 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5113 transitions. Word has length 54 [2019-11-23 22:34:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:08,100 INFO L462 AbstractCegarLoop]: Abstraction has 3593 states and 5113 transitions. [2019-11-23 22:34:08,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5113 transitions. [2019-11-23 22:34:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:34:08,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:08,103 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:34:08,103 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:34:08,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:08,104 INFO L82 PathProgramCache]: Analyzing trace with hash -111097732, now seen corresponding path program 1 times [2019-11-23 22:34:08,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:08,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803770150] [2019-11-23 22:34:08,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:08,169 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:08,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803770150] [2019-11-23 22:34:08,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:08,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:08,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223714415] [2019-11-23 22:34:08,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:08,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:08,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:08,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:08,171 INFO L87 Difference]: Start difference. First operand 3593 states and 5113 transitions. Second operand 3 states. [2019-11-23 22:34:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:08,598 INFO L93 Difference]: Finished difference Result 7156 states and 10370 transitions. [2019-11-23 22:34:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:08,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:34:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:08,608 INFO L225 Difference]: With dead ends: 7156 [2019-11-23 22:34:08,609 INFO L226 Difference]: Without dead ends: 4017 [2019-11-23 22:34:08,613 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:34:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2019-11-23 22:34:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 3229. [2019-11-23 22:34:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2019-11-23 22:34:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4649 transitions. [2019-11-23 22:34:08,852 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4649 transitions. Word has length 54 [2019-11-23 22:34:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:08,852 INFO L462 AbstractCegarLoop]: Abstraction has 3229 states and 4649 transitions. [2019-11-23 22:34:08,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4649 transitions. [2019-11-23 22:34:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:08,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:08,853 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:34:08,854 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:34:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1920628919, now seen corresponding path program 1 times [2019-11-23 22:34:08,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:08,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740243802] [2019-11-23 22:34:08,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:09,337 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:09,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740243802] [2019-11-23 22:34:09,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:09,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:34:09,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584652259] [2019-11-23 22:34:09,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:34:09,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:34:09,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:09,339 INFO L87 Difference]: Start difference. First operand 3229 states and 4649 transitions. Second operand 19 states. [2019-11-23 22:34:09,513 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-11-23 22:34:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:14,296 INFO L93 Difference]: Finished difference Result 7582 states and 11031 transitions. [2019-11-23 22:34:14,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 22:34:14,297 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-23 22:34:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:14,310 INFO L225 Difference]: With dead ends: 7582 [2019-11-23 22:34:14,311 INFO L226 Difference]: Without dead ends: 7576 [2019-11-23 22:34:14,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=283, Invalid=1123, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 22:34:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7576 states. [2019-11-23 22:34:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7576 to 3229. [2019-11-23 22:34:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2019-11-23 22:34:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4648 transitions. [2019-11-23 22:34:14,626 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4648 transitions. Word has length 55 [2019-11-23 22:34:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:14,626 INFO L462 AbstractCegarLoop]: Abstraction has 3229 states and 4648 transitions. [2019-11-23 22:34:14,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:34:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4648 transitions. [2019-11-23 22:34:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:14,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:14,628 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:34:14,628 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:34:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1947167719, now seen corresponding path program 1 times [2019-11-23 22:34:14,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:14,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845715657] [2019-11-23 22:34:14,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:15,478 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:15,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845715657] [2019-11-23 22:34:15,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:15,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-23 22:34:15,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931858892] [2019-11-23 22:34:15,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 22:34:15,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:15,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 22:34:15,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:34:15,480 INFO L87 Difference]: Start difference. First operand 3229 states and 4648 transitions. Second operand 17 states. [2019-11-23 22:34:16,227 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-11-23 22:34:16,487 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-11-23 22:34:16,718 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-11-23 22:34:16,940 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-11-23 22:34:17,198 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-11-23 22:34:17,381 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-11-23 22:34:17,664 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-11-23 22:34:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:20,284 INFO L93 Difference]: Finished difference Result 5674 states and 8179 transitions. [2019-11-23 22:34:20,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:34:20,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-11-23 22:34:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:20,292 INFO L225 Difference]: With dead ends: 5674 [2019-11-23 22:34:20,292 INFO L226 Difference]: Without dead ends: 5567 [2019-11-23 22:34:20,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 22:34:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5567 states. [2019-11-23 22:34:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5567 to 3217. [2019-11-23 22:34:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-11-23 22:34:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4635 transitions. [2019-11-23 22:34:20,717 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4635 transitions. Word has length 55 [2019-11-23 22:34:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:20,718 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 4635 transitions. [2019-11-23 22:34:20,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 22:34:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4635 transitions. [2019-11-23 22:34:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:20,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:20,720 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:34:20,720 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:34:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2018662677, now seen corresponding path program 1 times [2019-11-23 22:34:20,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:20,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219564863] [2019-11-23 22:34:20,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:21,191 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:21,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219564863] [2019-11-23 22:34:21,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:21,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:34:21,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248721446] [2019-11-23 22:34:21,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:34:21,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:34:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:21,193 INFO L87 Difference]: Start difference. First operand 3217 states and 4635 transitions. Second operand 19 states. [2019-11-23 22:34:21,373 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-23 22:34:21,906 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-23 22:34:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:26,249 INFO L93 Difference]: Finished difference Result 7631 states and 11105 transitions. [2019-11-23 22:34:26,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 22:34:26,250 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-23 22:34:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:26,258 INFO L225 Difference]: With dead ends: 7631 [2019-11-23 22:34:26,258 INFO L226 Difference]: Without dead ends: 7627 [2019-11-23 22:34:26,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 22:34:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2019-11-23 22:34:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 3224. [2019-11-23 22:34:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3224 states. [2019-11-23 22:34:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 4644 transitions. [2019-11-23 22:34:26,614 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 4644 transitions. Word has length 55 [2019-11-23 22:34:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:26,614 INFO L462 AbstractCegarLoop]: Abstraction has 3224 states and 4644 transitions. [2019-11-23 22:34:26,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:34:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 4644 transitions. [2019-11-23 22:34:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:26,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:26,616 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:34:26,616 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:34:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1431726049, now seen corresponding path program 1 times [2019-11-23 22:34:26,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:26,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650461403] [2019-11-23 22:34:26,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:27,063 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:27,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650461403] [2019-11-23 22:34:27,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:27,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:34:27,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829941986] [2019-11-23 22:34:27,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:34:27,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:27,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:34:27,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:27,065 INFO L87 Difference]: Start difference. First operand 3224 states and 4644 transitions. Second operand 19 states. [2019-11-23 22:34:27,197 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-11-23 22:34:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:31,667 INFO L93 Difference]: Finished difference Result 8928 states and 13036 transitions. [2019-11-23 22:34:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:34:31,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-23 22:34:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:31,675 INFO L225 Difference]: With dead ends: 8928 [2019-11-23 22:34:31,675 INFO L226 Difference]: Without dead ends: 8924 [2019-11-23 22:34:31,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 22:34:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8924 states. [2019-11-23 22:34:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8924 to 3224. [2019-11-23 22:34:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3224 states. [2019-11-23 22:34:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 4643 transitions. [2019-11-23 22:34:31,996 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 4643 transitions. Word has length 55 [2019-11-23 22:34:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:31,996 INFO L462 AbstractCegarLoop]: Abstraction has 3224 states and 4643 transitions. [2019-11-23 22:34:31,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:34:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 4643 transitions. [2019-11-23 22:34:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:31,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:31,998 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:34:31,998 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:34:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:31,998 INFO L82 PathProgramCache]: Analyzing trace with hash -156193940, now seen corresponding path program 1 times [2019-11-23 22:34:31,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:31,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569783887] [2019-11-23 22:34:31,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:32,420 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:32,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569783887] [2019-11-23 22:34:32,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:32,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-23 22:34:32,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878120679] [2019-11-23 22:34:32,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 22:34:32,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 22:34:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:34:32,422 INFO L87 Difference]: Start difference. First operand 3224 states and 4643 transitions. Second operand 14 states. [2019-11-23 22:34:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:35,385 INFO L93 Difference]: Finished difference Result 6180 states and 8935 transitions. [2019-11-23 22:34:35,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:34:35,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-11-23 22:34:35,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:35,391 INFO L225 Difference]: With dead ends: 6180 [2019-11-23 22:34:35,391 INFO L226 Difference]: Without dead ends: 6176 [2019-11-23 22:34:35,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-11-23 22:34:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2019-11-23 22:34:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 3213. [2019-11-23 22:34:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3213 states. [2019-11-23 22:34:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 4630 transitions. [2019-11-23 22:34:35,741 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 4630 transitions. Word has length 56 [2019-11-23 22:34:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:35,741 INFO L462 AbstractCegarLoop]: Abstraction has 3213 states and 4630 transitions. [2019-11-23 22:34:35,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 22:34:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 4630 transitions. [2019-11-23 22:34:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:35,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:35,743 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:34:35,743 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:34:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash -434174057, now seen corresponding path program 1 times [2019-11-23 22:34:35,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:35,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700459908] [2019-11-23 22:34:35,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:36,298 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:36,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700459908] [2019-11-23 22:34:36,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:36,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-23 22:34:36,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275410401] [2019-11-23 22:34:36,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 22:34:36,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:36,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 22:34:36,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:34:36,301 INFO L87 Difference]: Start difference. First operand 3213 states and 4630 transitions. Second operand 13 states. [2019-11-23 22:34:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:38,581 INFO L93 Difference]: Finished difference Result 4623 states and 6647 transitions. [2019-11-23 22:34:38,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:34:38,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-11-23 22:34:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:38,586 INFO L225 Difference]: With dead ends: 4623 [2019-11-23 22:34:38,586 INFO L226 Difference]: Without dead ends: 4499 [2019-11-23 22:34:38,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:34:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-11-23 22:34:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 3189. [2019-11-23 22:34:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-11-23 22:34:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4598 transitions. [2019-11-23 22:34:38,958 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4598 transitions. Word has length 56 [2019-11-23 22:34:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:38,958 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4598 transitions. [2019-11-23 22:34:38,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 22:34:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4598 transitions. [2019-11-23 22:34:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:34:38,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:38,960 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] [2019-11-23 22:34:38,960 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:34:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1827161320, now seen corresponding path program 1 times [2019-11-23 22:34:38,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:38,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826735469] [2019-11-23 22:34:38,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:39,000 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:39,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826735469] [2019-11-23 22:34:39,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:39,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:39,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894261165] [2019-11-23 22:34:39,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:39,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:39,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:39,002 INFO L87 Difference]: Start difference. First operand 3189 states and 4598 transitions. Second operand 3 states. [2019-11-23 22:34:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:39,928 INFO L93 Difference]: Finished difference Result 8023 states and 11782 transitions. [2019-11-23 22:34:39,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:39,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-23 22:34:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:39,933 INFO L225 Difference]: With dead ends: 8023 [2019-11-23 22:34:39,933 INFO L226 Difference]: Without dead ends: 5413 [2019-11-23 22:34:39,936 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:34:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5413 states. [2019-11-23 22:34:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5413 to 5411. [2019-11-23 22:34:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5411 states. [2019-11-23 22:34:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5411 states to 5411 states and 7796 transitions. [2019-11-23 22:34:40,604 INFO L78 Accepts]: Start accepts. Automaton has 5411 states and 7796 transitions. Word has length 60 [2019-11-23 22:34:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:40,605 INFO L462 AbstractCegarLoop]: Abstraction has 5411 states and 7796 transitions. [2019-11-23 22:34:40,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5411 states and 7796 transitions. [2019-11-23 22:34:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:34:40,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:40,606 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:34:40,606 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:34:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1073283694, now seen corresponding path program 1 times [2019-11-23 22:34:40,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:40,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219768171] [2019-11-23 22:34:40,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:40,677 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:40,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219768171] [2019-11-23 22:34:40,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:40,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:40,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867460065] [2019-11-23 22:34:40,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:40,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:40,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:40,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:40,680 INFO L87 Difference]: Start difference. First operand 5411 states and 7796 transitions. Second operand 5 states. [2019-11-23 22:34:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:41,373 INFO L93 Difference]: Finished difference Result 9209 states and 13345 transitions. [2019-11-23 22:34:41,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:41,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-23 22:34:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:41,377 INFO L225 Difference]: With dead ends: 9209 [2019-11-23 22:34:41,377 INFO L226 Difference]: Without dead ends: 4351 [2019-11-23 22:34:41,381 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:34:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2019-11-23 22:34:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 3769. [2019-11-23 22:34:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3769 states. [2019-11-23 22:34:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 5333 transitions. [2019-11-23 22:34:41,889 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 5333 transitions. Word has length 61 [2019-11-23 22:34:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:41,889 INFO L462 AbstractCegarLoop]: Abstraction has 3769 states and 5333 transitions. [2019-11-23 22:34:41,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 5333 transitions. [2019-11-23 22:34:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:34:41,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:41,891 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:34:41,891 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:34:41,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:41,892 INFO L82 PathProgramCache]: Analyzing trace with hash 778828119, now seen corresponding path program 1 times [2019-11-23 22:34:41,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:41,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617411489] [2019-11-23 22:34:41,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:42,010 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:42,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617411489] [2019-11-23 22:34:42,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:42,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:34:42,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63258269] [2019-11-23 22:34:42,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:34:42,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:42,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:34:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:34:42,014 INFO L87 Difference]: Start difference. First operand 3769 states and 5333 transitions. Second operand 6 states. [2019-11-23 22:34:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:43,299 INFO L93 Difference]: Finished difference Result 7237 states and 10235 transitions. [2019-11-23 22:34:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:34:43,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-23 22:34:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:43,305 INFO L225 Difference]: With dead ends: 7237 [2019-11-23 22:34:43,306 INFO L226 Difference]: Without dead ends: 7235 [2019-11-23 22:34:43,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:34:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7235 states. [2019-11-23 22:34:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7235 to 3886. [2019-11-23 22:34:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2019-11-23 22:34:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5450 transitions. [2019-11-23 22:34:43,961 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5450 transitions. Word has length 61 [2019-11-23 22:34:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:43,962 INFO L462 AbstractCegarLoop]: Abstraction has 3886 states and 5450 transitions. [2019-11-23 22:34:43,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:34:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5450 transitions. [2019-11-23 22:34:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:34:43,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:43,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, 1] [2019-11-23 22:34:43,964 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:34:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1456087797, now seen corresponding path program 1 times [2019-11-23 22:34:43,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:43,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763439074] [2019-11-23 22:34:43,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:44,008 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:44,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763439074] [2019-11-23 22:34:44,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:44,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:44,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963566279] [2019-11-23 22:34:44,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:44,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:44,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:44,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:44,010 INFO L87 Difference]: Start difference. First operand 3886 states and 5450 transitions. Second operand 3 states. [2019-11-23 22:34:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:45,300 INFO L93 Difference]: Finished difference Result 9887 states and 13995 transitions. [2019-11-23 22:34:45,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:45,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-23 22:34:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:45,306 INFO L225 Difference]: With dead ends: 9887 [2019-11-23 22:34:45,307 INFO L226 Difference]: Without dead ends: 6483 [2019-11-23 22:34:45,310 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:34:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6483 states. [2019-11-23 22:34:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6483 to 6403. [2019-11-23 22:34:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6403 states. [2019-11-23 22:34:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6403 states to 6403 states and 8915 transitions. [2019-11-23 22:34:46,327 INFO L78 Accepts]: Start accepts. Automaton has 6403 states and 8915 transitions. Word has length 62 [2019-11-23 22:34:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:46,327 INFO L462 AbstractCegarLoop]: Abstraction has 6403 states and 8915 transitions. [2019-11-23 22:34:46,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6403 states and 8915 transitions. [2019-11-23 22:34:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:34:46,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:46,329 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] [2019-11-23 22:34:46,329 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:34:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:46,329 INFO L82 PathProgramCache]: Analyzing trace with hash -499639906, now seen corresponding path program 1 times [2019-11-23 22:34:46,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:46,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537360852] [2019-11-23 22:34:46,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:46,409 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:46,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537360852] [2019-11-23 22:34:46,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:46,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:34:46,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417456460] [2019-11-23 22:34:46,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:34:46,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:46,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:34:46,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:34:46,411 INFO L87 Difference]: Start difference. First operand 6403 states and 8915 transitions. Second operand 7 states. [2019-11-23 22:34:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:50,714 INFO L93 Difference]: Finished difference Result 24134 states and 33659 transitions. [2019-11-23 22:34:50,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:34:50,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-11-23 22:34:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:50,737 INFO L225 Difference]: With dead ends: 24134 [2019-11-23 22:34:50,737 INFO L226 Difference]: Without dead ends: 20730 [2019-11-23 22:34:50,744 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:34:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20730 states. [2019-11-23 22:34:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20730 to 12497. [2019-11-23 22:34:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12497 states. [2019-11-23 22:34:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12497 states to 12497 states and 17593 transitions. [2019-11-23 22:34:52,840 INFO L78 Accepts]: Start accepts. Automaton has 12497 states and 17593 transitions. Word has length 63 [2019-11-23 22:34:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:52,841 INFO L462 AbstractCegarLoop]: Abstraction has 12497 states and 17593 transitions. [2019-11-23 22:34:52,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:34:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 12497 states and 17593 transitions. [2019-11-23 22:34:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:34:52,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:52,843 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:34:52,843 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:52,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:52,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1303834928, now seen corresponding path program 1 times [2019-11-23 22:34:52,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:52,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573576354] [2019-11-23 22:34:52,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:52,892 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:52,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573576354] [2019-11-23 22:34:52,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:52,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:52,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100406959] [2019-11-23 22:34:52,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:52,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:52,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:52,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:52,894 INFO L87 Difference]: Start difference. First operand 12497 states and 17593 transitions. Second operand 5 states. [2019-11-23 22:34:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:59,327 INFO L93 Difference]: Finished difference Result 43474 states and 61474 transitions. [2019-11-23 22:34:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:34:59,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-23 22:34:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:59,361 INFO L225 Difference]: With dead ends: 43474 [2019-11-23 22:34:59,361 INFO L226 Difference]: Without dead ends: 33670 [2019-11-23 22:34:59,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:34:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33670 states. [2019-11-23 22:35:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33670 to 12374. [2019-11-23 22:35:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12374 states. [2019-11-23 22:35:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12374 states to 12374 states and 17349 transitions. [2019-11-23 22:35:02,500 INFO L78 Accepts]: Start accepts. Automaton has 12374 states and 17349 transitions. Word has length 66 [2019-11-23 22:35:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:02,500 INFO L462 AbstractCegarLoop]: Abstraction has 12374 states and 17349 transitions. [2019-11-23 22:35:02,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:35:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 12374 states and 17349 transitions. [2019-11-23 22:35:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:35:02,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:02,502 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:35:02,502 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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:35:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1565169608, now seen corresponding path program 1 times [2019-11-23 22:35:02,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:02,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27489052] [2019-11-23 22:35:02,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:02,575 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:35:02,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27489052] [2019-11-23 22:35:02,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:02,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:35:02,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512129059] [2019-11-23 22:35:02,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:35:02,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:35:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:35:02,577 INFO L87 Difference]: Start difference. First operand 12374 states and 17349 transitions. Second operand 7 states.