/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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:32:28,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:32:28,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:32:28,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:32:28,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:32:28,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:32:28,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:32:28,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:32:28,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:32:28,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:32:28,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:32:29,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:32:29,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:32:29,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:32:29,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:32:29,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:32:29,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:32:29,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:32:29,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:32:29,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:32:29,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:32:29,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:32:29,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:32:29,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:32:29,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:32:29,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:32:29,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:32:29,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:32:29,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:32:29,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:32:29,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:32:29,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:32:29,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:32:29,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:32:29,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:32:29,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:32:29,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:32:29,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:32:29,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:32:29,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:32:29,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:32:29,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:32:29,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:32:29,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:32:29,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:32:29,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:32:29,076 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:32:29,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:32:29,077 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:32:29,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:32:29,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:32:29,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:32:29,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:32:29,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:32:29,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:32:29,080 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:32:29,080 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:32:29,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:32:29,080 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:32:29,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:32:29,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:32:29,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:32:29,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:32:29,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:32:29,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:32:29,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:32:29,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:32:29,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:32:29,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:32:29,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:32:29,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:32:29,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:32:29,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:32:29,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:32:29,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:32:29,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:32:29,362 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:32:29,363 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-23 22:32:29,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707c9d188/d000167c16674ac6b0b438f6a3942204/FLAG7813b6b50 [2019-11-23 22:32:30,149 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:32:30,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-23 22:32:30,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707c9d188/d000167c16674ac6b0b438f6a3942204/FLAG7813b6b50 [2019-11-23 22:32:30,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707c9d188/d000167c16674ac6b0b438f6a3942204 [2019-11-23 22:32:30,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:32:30,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:32:30,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:30,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:32:30,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:32:30,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:30" (1/1) ... [2019-11-23 22:32:30,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637c5fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:30, skipping insertion in model container [2019-11-23 22:32:30,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:30" (1/1) ... [2019-11-23 22:32:30,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:32:30,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:32:31,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:31,637 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:32:31,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:31,990 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:32:31,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31 WrapperNode [2019-11-23 22:32:31,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:31,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:31,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:32:31,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:32:32,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:32,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:32:32,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:32:32,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:32:32,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:32:32,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:32:32,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:32:32,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:32:32,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:32:32,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:32:32,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:32:35,860 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:32:35,860 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:32:35,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:35 BoogieIcfgContainer [2019-11-23 22:32:35,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:32:35,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:32:35,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:32:35,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:32:35,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:32:30" (1/3) ... [2019-11-23 22:32:35,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe780ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:35, skipping insertion in model container [2019-11-23 22:32:35,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (2/3) ... [2019-11-23 22:32:35,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe780ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:35, skipping insertion in model container [2019-11-23 22:32:35,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:35" (3/3) ... [2019-11-23 22:32:35,871 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-23 22:32:35,880 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:32:35,888 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-23 22:32:35,900 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-23 22:32:35,939 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:32:35,939 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:32:35,940 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:32:35,940 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:32:35,940 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:32:35,940 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:32:35,940 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:32:35,940 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:32:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states. [2019-11-23 22:32:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:32:36,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:36,007 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:32:36,008 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1061871762, now seen corresponding path program 1 times [2019-11-23 22:32:36,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:36,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816033494] [2019-11-23 22:32:36,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:36,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816033494] [2019-11-23 22:32:36,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:36,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:36,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089060031] [2019-11-23 22:32:36,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:32:36,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:36,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:32:36,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:36,468 INFO L87 Difference]: Start difference. First operand 1254 states. Second operand 5 states. [2019-11-23 22:32:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:38,433 INFO L93 Difference]: Finished difference Result 2475 states and 4331 transitions. [2019-11-23 22:32:38,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:32:38,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-23 22:32:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:38,462 INFO L225 Difference]: With dead ends: 2475 [2019-11-23 22:32:38,463 INFO L226 Difference]: Without dead ends: 1558 [2019-11-23 22:32:38,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:32:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-11-23 22:32:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1552. [2019-11-23 22:32:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-11-23 22:32:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2094 transitions. [2019-11-23 22:32:38,596 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2094 transitions. Word has length 51 [2019-11-23 22:32:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:38,597 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 2094 transitions. [2019-11-23 22:32:38,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:32:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2094 transitions. [2019-11-23 22:32:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:32:38,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:38,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:38,602 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:38,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1625759521, now seen corresponding path program 1 times [2019-11-23 22:32:38,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:38,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750596617] [2019-11-23 22:32:38,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:38,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750596617] [2019-11-23 22:32:38,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:38,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:38,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662881958] [2019-11-23 22:32:38,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:32:38,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:32:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:38,756 INFO L87 Difference]: Start difference. First operand 1552 states and 2094 transitions. Second operand 5 states. [2019-11-23 22:32:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:40,257 INFO L93 Difference]: Finished difference Result 3181 states and 4350 transitions. [2019-11-23 22:32:40,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:32:40,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-23 22:32:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:40,270 INFO L225 Difference]: With dead ends: 3181 [2019-11-23 22:32:40,270 INFO L226 Difference]: Without dead ends: 2197 [2019-11-23 22:32:40,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:32:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-11-23 22:32:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 2185. [2019-11-23 22:32:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2019-11-23 22:32:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 2994 transitions. [2019-11-23 22:32:40,392 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 2994 transitions. Word has length 52 [2019-11-23 22:32:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:40,393 INFO L462 AbstractCegarLoop]: Abstraction has 2185 states and 2994 transitions. [2019-11-23 22:32:40,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:32:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2994 transitions. [2019-11-23 22:32:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:32:40,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:40,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:40,402 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 299183278, now seen corresponding path program 1 times [2019-11-23 22:32:40,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:40,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642164108] [2019-11-23 22:32:40,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:40,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642164108] [2019-11-23 22:32:40,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:40,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:40,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138050871] [2019-11-23 22:32:40,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:32:40,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:32:40,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:40,618 INFO L87 Difference]: Start difference. First operand 2185 states and 2994 transitions. Second operand 5 states. [2019-11-23 22:32:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:41,806 INFO L93 Difference]: Finished difference Result 4530 states and 6290 transitions. [2019-11-23 22:32:41,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:32:41,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-23 22:32:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:41,822 INFO L225 Difference]: With dead ends: 4530 [2019-11-23 22:32:41,822 INFO L226 Difference]: Without dead ends: 3051 [2019-11-23 22:32:41,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:32:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2019-11-23 22:32:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3041. [2019-11-23 22:32:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3041 states. [2019-11-23 22:32:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4176 transitions. [2019-11-23 22:32:41,954 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4176 transitions. Word has length 52 [2019-11-23 22:32:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:41,955 INFO L462 AbstractCegarLoop]: Abstraction has 3041 states and 4176 transitions. [2019-11-23 22:32:41,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:32:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4176 transitions. [2019-11-23 22:32:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:32:41,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:41,959 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:32:41,960 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:41,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:41,960 INFO L82 PathProgramCache]: Analyzing trace with hash 448762372, now seen corresponding path program 1 times [2019-11-23 22:32:41,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:41,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121704407] [2019-11-23 22:32:41,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:42,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121704407] [2019-11-23 22:32:42,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:42,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:42,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723531769] [2019-11-23 22:32:42,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:42,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:42,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:42,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:42,117 INFO L87 Difference]: Start difference. First operand 3041 states and 4176 transitions. Second operand 9 states. [2019-11-23 22:32:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:46,436 INFO L93 Difference]: Finished difference Result 7167 states and 10258 transitions. [2019-11-23 22:32:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:32:46,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-11-23 22:32:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:46,482 INFO L225 Difference]: With dead ends: 7167 [2019-11-23 22:32:46,482 INFO L226 Difference]: Without dead ends: 6610 [2019-11-23 22:32:46,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:32:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2019-11-23 22:32:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 3041. [2019-11-23 22:32:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3041 states. [2019-11-23 22:32:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4175 transitions. [2019-11-23 22:32:46,814 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4175 transitions. Word has length 53 [2019-11-23 22:32:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:46,814 INFO L462 AbstractCegarLoop]: Abstraction has 3041 states and 4175 transitions. [2019-11-23 22:32:46,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4175 transitions. [2019-11-23 22:32:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:32:46,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:46,819 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:32:46,820 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash 303472925, now seen corresponding path program 1 times [2019-11-23 22:32:46,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:46,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844861200] [2019-11-23 22:32:46,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:47,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844861200] [2019-11-23 22:32:47,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:47,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:47,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903831727] [2019-11-23 22:32:47,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:47,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:47,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:47,094 INFO L87 Difference]: Start difference. First operand 3041 states and 4175 transitions. Second operand 9 states. [2019-11-23 22:32:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:49,928 INFO L93 Difference]: Finished difference Result 4569 states and 6366 transitions. [2019-11-23 22:32:49,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:32:49,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-11-23 22:32:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:49,953 INFO L225 Difference]: With dead ends: 4569 [2019-11-23 22:32:49,953 INFO L226 Difference]: Without dead ends: 4564 [2019-11-23 22:32:49,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:32:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2019-11-23 22:32:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 3041. [2019-11-23 22:32:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3041 states. [2019-11-23 22:32:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4174 transitions. [2019-11-23 22:32:50,132 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4174 transitions. Word has length 53 [2019-11-23 22:32:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:50,132 INFO L462 AbstractCegarLoop]: Abstraction has 3041 states and 4174 transitions. [2019-11-23 22:32:50,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4174 transitions. [2019-11-23 22:32:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:32:50,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:50,136 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:32:50,136 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:50,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:50,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1162103691, now seen corresponding path program 1 times [2019-11-23 22:32:50,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:50,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013877987] [2019-11-23 22:32:50,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:50,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013877987] [2019-11-23 22:32:50,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:50,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:32:50,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907115896] [2019-11-23 22:32:50,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:32:50,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:50,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:32:50,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:32:50,262 INFO L87 Difference]: Start difference. First operand 3041 states and 4174 transitions. Second operand 8 states. [2019-11-23 22:32:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:52,484 INFO L93 Difference]: Finished difference Result 5101 states and 7239 transitions. [2019-11-23 22:32:52,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:32:52,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-23 22:32:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:52,502 INFO L225 Difference]: With dead ends: 5101 [2019-11-23 22:32:52,502 INFO L226 Difference]: Without dead ends: 4430 [2019-11-23 22:32:52,505 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:32:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2019-11-23 22:32:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 3041. [2019-11-23 22:32:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3041 states. [2019-11-23 22:32:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4173 transitions. [2019-11-23 22:32:52,671 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4173 transitions. Word has length 53 [2019-11-23 22:32:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:52,672 INFO L462 AbstractCegarLoop]: Abstraction has 3041 states and 4173 transitions. [2019-11-23 22:32:52,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:32:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4173 transitions. [2019-11-23 22:32:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:52,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:52,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:52,676 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash -482264145, now seen corresponding path program 1 times [2019-11-23 22:32:52,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:52,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735109839] [2019-11-23 22:32:52,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:52,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735109839] [2019-11-23 22:32:52,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:52,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:52,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807686065] [2019-11-23 22:32:52,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:52,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:52,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:52,762 INFO L87 Difference]: Start difference. First operand 3041 states and 4173 transitions. Second operand 3 states. [2019-11-23 22:32:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:53,019 INFO L93 Difference]: Finished difference Result 3997 states and 5638 transitions. [2019-11-23 22:32:53,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:53,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:32:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:53,033 INFO L225 Difference]: With dead ends: 3997 [2019-11-23 22:32:53,033 INFO L226 Difference]: Without dead ends: 3094 [2019-11-23 22:32:53,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2019-11-23 22:32:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3092. [2019-11-23 22:32:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-11-23 22:32:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4269 transitions. [2019-11-23 22:32:53,283 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4269 transitions. Word has length 54 [2019-11-23 22:32:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:53,284 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4269 transitions. [2019-11-23 22:32:53,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4269 transitions. [2019-11-23 22:32:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:53,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:53,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:53,288 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:53,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:53,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1622556323, now seen corresponding path program 1 times [2019-11-23 22:32:53,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:53,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303052634] [2019-11-23 22:32:53,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:53,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303052634] [2019-11-23 22:32:53,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:53,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:53,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675078733] [2019-11-23 22:32:53,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:53,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:53,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:53,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:53,346 INFO L87 Difference]: Start difference. First operand 3092 states and 4269 transitions. Second operand 3 states. [2019-11-23 22:32:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:53,644 INFO L93 Difference]: Finished difference Result 4733 states and 6803 transitions. [2019-11-23 22:32:53,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:53,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:32:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:53,676 INFO L225 Difference]: With dead ends: 4733 [2019-11-23 22:32:53,677 INFO L226 Difference]: Without dead ends: 3514 [2019-11-23 22:32:53,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2019-11-23 22:32:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3512. [2019-11-23 22:32:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2019-11-23 22:32:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 4947 transitions. [2019-11-23 22:32:53,926 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 4947 transitions. Word has length 54 [2019-11-23 22:32:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:53,926 INFO L462 AbstractCegarLoop]: Abstraction has 3512 states and 4947 transitions. [2019-11-23 22:32:53,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 4947 transitions. [2019-11-23 22:32:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:53,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:53,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:53,930 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:53,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1612308197, now seen corresponding path program 1 times [2019-11-23 22:32:53,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:53,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034091811] [2019-11-23 22:32:53,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:53,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034091811] [2019-11-23 22:32:53,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:53,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:53,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281819796] [2019-11-23 22:32:53,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:53,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:53,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:53,987 INFO L87 Difference]: Start difference. First operand 3512 states and 4947 transitions. Second operand 3 states. [2019-11-23 22:32:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:54,528 INFO L93 Difference]: Finished difference Result 7801 states and 11245 transitions. [2019-11-23 22:32:54,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:54,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:32:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:54,544 INFO L225 Difference]: With dead ends: 7801 [2019-11-23 22:32:54,545 INFO L226 Difference]: Without dead ends: 5349 [2019-11-23 22:32:54,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2019-11-23 22:32:54,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 5343. [2019-11-23 22:32:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5343 states. [2019-11-23 22:32:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 7500 transitions. [2019-11-23 22:32:55,002 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 7500 transitions. Word has length 54 [2019-11-23 22:32:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:55,002 INFO L462 AbstractCegarLoop]: Abstraction has 5343 states and 7500 transitions. [2019-11-23 22:32:55,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 7500 transitions. [2019-11-23 22:32:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:32:55,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:55,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:55,007 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:55,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1623263409, now seen corresponding path program 1 times [2019-11-23 22:32:55,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:55,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306770633] [2019-11-23 22:32:55,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:55,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306770633] [2019-11-23 22:32:55,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:55,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:55,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817545805] [2019-11-23 22:32:55,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:55,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:55,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:55,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:55,058 INFO L87 Difference]: Start difference. First operand 5343 states and 7500 transitions. Second operand 3 states. [2019-11-23 22:32:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:55,579 INFO L93 Difference]: Finished difference Result 9822 states and 14011 transitions. [2019-11-23 22:32:55,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:55,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:32:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:55,595 INFO L225 Difference]: With dead ends: 9822 [2019-11-23 22:32:55,595 INFO L226 Difference]: Without dead ends: 5548 [2019-11-23 22:32:55,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2019-11-23 22:32:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 4450. [2019-11-23 22:32:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4450 states. [2019-11-23 22:32:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4450 states to 4450 states and 6318 transitions. [2019-11-23 22:32:56,061 INFO L78 Accepts]: Start accepts. Automaton has 4450 states and 6318 transitions. Word has length 55 [2019-11-23 22:32:56,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:56,062 INFO L462 AbstractCegarLoop]: Abstraction has 4450 states and 6318 transitions. [2019-11-23 22:32:56,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4450 states and 6318 transitions. [2019-11-23 22:32:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:32:56,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:56,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:56,066 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:56,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:56,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1493102210, now seen corresponding path program 1 times [2019-11-23 22:32:56,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:56,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928756498] [2019-11-23 22:32:56,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:56,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928756498] [2019-11-23 22:32:56,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:56,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:56,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053326772] [2019-11-23 22:32:56,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:56,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:56,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:56,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:56,107 INFO L87 Difference]: Start difference. First operand 4450 states and 6318 transitions. Second operand 3 states. [2019-11-23 22:32:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:56,426 INFO L93 Difference]: Finished difference Result 8479 states and 12251 transitions. [2019-11-23 22:32:56,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:56,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:32:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:56,435 INFO L225 Difference]: With dead ends: 8479 [2019-11-23 22:32:56,436 INFO L226 Difference]: Without dead ends: 4773 [2019-11-23 22:32:56,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2019-11-23 22:32:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 3845. [2019-11-23 22:32:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3845 states. [2019-11-23 22:32:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 5496 transitions. [2019-11-23 22:32:56,707 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 5496 transitions. Word has length 55 [2019-11-23 22:32:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:56,707 INFO L462 AbstractCegarLoop]: Abstraction has 3845 states and 5496 transitions. [2019-11-23 22:32:56,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 5496 transitions. [2019-11-23 22:32:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:32:56,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:56,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:56,710 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:32:56,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1419432604, now seen corresponding path program 1 times [2019-11-23 22:32:56,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:56,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210945997] [2019-11-23 22:32:56,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:56,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210945997] [2019-11-23 22:32:56,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:56,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:56,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973842099] [2019-11-23 22:32:56,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:56,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:56,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:56,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:56,749 INFO L87 Difference]: Start difference. First operand 3845 states and 5496 transitions. Second operand 3 states. [2019-11-23 22:32:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:57,125 INFO L93 Difference]: Finished difference Result 7664 states and 11130 transitions. [2019-11-23 22:32:57,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:57,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:32:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:57,134 INFO L225 Difference]: With dead ends: 7664 [2019-11-23 22:32:57,135 INFO L226 Difference]: Without dead ends: 4134 [2019-11-23 22:32:57,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2019-11-23 22:32:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 3399. [2019-11-23 22:32:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3399 states. [2019-11-23 22:32:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4901 transitions. [2019-11-23 22:32:57,397 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4901 transitions. Word has length 55 [2019-11-23 22:32:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:57,397 INFO L462 AbstractCegarLoop]: Abstraction has 3399 states and 4901 transitions. [2019-11-23 22:32:57,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4901 transitions. [2019-11-23 22:32:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:32:57,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:57,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:57,399 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:32:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:57,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1871407914, now seen corresponding path program 1 times [2019-11-23 22:32:57,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:57,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28199658] [2019-11-23 22:32:57,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:57,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28199658] [2019-11-23 22:32:57,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:57,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:32:57,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636724631] [2019-11-23 22:32:57,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:32:57,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:57,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:32:57,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:32:57,863 INFO L87 Difference]: Start difference. First operand 3399 states and 4901 transitions. Second operand 19 states. [2019-11-23 22:33:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:02,163 INFO L93 Difference]: Finished difference Result 7037 states and 10206 transitions. [2019-11-23 22:33:02,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:33:02,163 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-11-23 22:33:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:02,174 INFO L225 Difference]: With dead ends: 7037 [2019-11-23 22:33:02,175 INFO L226 Difference]: Without dead ends: 7033 [2019-11-23 22:33:02,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 22:33:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2019-11-23 22:33:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 3399. [2019-11-23 22:33:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3399 states. [2019-11-23 22:33:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4900 transitions. [2019-11-23 22:33:02,624 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4900 transitions. Word has length 56 [2019-11-23 22:33:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:02,624 INFO L462 AbstractCegarLoop]: Abstraction has 3399 states and 4900 transitions. [2019-11-23 22:33:02,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:33:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4900 transitions. [2019-11-23 22:33:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:33:02,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:02,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:02,626 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:02,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:02,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1094868748, now seen corresponding path program 1 times [2019-11-23 22:33:02,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:02,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904400625] [2019-11-23 22:33:02,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:03,238 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:03,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904400625] [2019-11-23 22:33:03,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:03,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:33:03,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052560768] [2019-11-23 22:33:03,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:33:03,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:03,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:33:03,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:33:03,240 INFO L87 Difference]: Start difference. First operand 3399 states and 4900 transitions. Second operand 19 states. [2019-11-23 22:33:03,484 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-11-23 22:33:04,170 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-23 22:33:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:08,943 INFO L93 Difference]: Finished difference Result 6423 states and 9295 transitions. [2019-11-23 22:33:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 22:33:08,944 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-11-23 22:33:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:08,951 INFO L225 Difference]: With dead ends: 6423 [2019-11-23 22:33:08,951 INFO L226 Difference]: Without dead ends: 6419 [2019-11-23 22:33:08,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 22:33:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2019-11-23 22:33:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 3406. [2019-11-23 22:33:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3406 states. [2019-11-23 22:33:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 4909 transitions. [2019-11-23 22:33:09,235 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 4909 transitions. Word has length 56 [2019-11-23 22:33:09,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:09,235 INFO L462 AbstractCegarLoop]: Abstraction has 3406 states and 4909 transitions. [2019-11-23 22:33:09,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:33:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 4909 transitions. [2019-11-23 22:33:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:33:09,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:09,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:09,237 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:09,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:09,237 INFO L82 PathProgramCache]: Analyzing trace with hash 557999134, now seen corresponding path program 1 times [2019-11-23 22:33:09,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:09,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501973597] [2019-11-23 22:33:09,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:33:09,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501973597] [2019-11-23 22:33:09,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:09,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:33:09,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180837790] [2019-11-23 22:33:09,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:33:09,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:09,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:33:09,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:33:09,648 INFO L87 Difference]: Start difference. First operand 3406 states and 4909 transitions. Second operand 19 states. [2019-11-23 22:33:09,827 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-11-23 22:33:10,349 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-23 22:33:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:14,265 INFO L93 Difference]: Finished difference Result 7055 states and 10235 transitions. [2019-11-23 22:33:14,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 22:33:14,265 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-11-23 22:33:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:14,271 INFO L225 Difference]: With dead ends: 7055 [2019-11-23 22:33:14,271 INFO L226 Difference]: Without dead ends: 7049 [2019-11-23 22:33:14,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 22:33:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7049 states. [2019-11-23 22:33:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7049 to 3406. [2019-11-23 22:33:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3406 states. [2019-11-23 22:33:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 4908 transitions. [2019-11-23 22:33:14,505 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 4908 transitions. Word has length 56 [2019-11-23 22:33:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:14,505 INFO L462 AbstractCegarLoop]: Abstraction has 3406 states and 4908 transitions. [2019-11-23 22:33:14,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:33:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 4908 transitions. [2019-11-23 22:33:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:33:14,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:14,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:14,507 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash 513328539, now seen corresponding path program 1 times [2019-11-23 22:33:14,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:14,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094192300] [2019-11-23 22:33:14,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:33:15,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094192300] [2019-11-23 22:33:15,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:15,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-23 22:33:15,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245062194] [2019-11-23 22:33:15,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 22:33:15,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:15,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 22:33:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:33:15,365 INFO L87 Difference]: Start difference. First operand 3406 states and 4908 transitions. Second operand 17 states. [2019-11-23 22:33:15,960 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-11-23 22:33:16,114 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-11-23 22:33:16,368 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-23 22:33:16,589 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-23 22:33:16,804 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-23 22:33:17,028 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-23 22:33:17,197 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-11-23 22:33:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:19,780 INFO L93 Difference]: Finished difference Result 6476 states and 9379 transitions. [2019-11-23 22:33:19,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 22:33:19,781 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-11-23 22:33:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:19,786 INFO L225 Difference]: With dead ends: 6476 [2019-11-23 22:33:19,786 INFO L226 Difference]: Without dead ends: 6368 [2019-11-23 22:33:19,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 22:33:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6368 states. [2019-11-23 22:33:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6368 to 3394. [2019-11-23 22:33:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3394 states. [2019-11-23 22:33:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4895 transitions. [2019-11-23 22:33:20,052 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4895 transitions. Word has length 56 [2019-11-23 22:33:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:20,052 INFO L462 AbstractCegarLoop]: Abstraction has 3394 states and 4895 transitions. [2019-11-23 22:33:20,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 22:33:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4895 transitions. [2019-11-23 22:33:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:33:20,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:20,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:20,053 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:20,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1785706246, now seen corresponding path program 1 times [2019-11-23 22:33:20,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:20,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697054367] [2019-11-23 22:33:20,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:20,604 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:20,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697054367] [2019-11-23 22:33:20,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:20,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-23 22:33:20,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717022788] [2019-11-23 22:33:20,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 22:33:20,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:20,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 22:33:20,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:33:20,606 INFO L87 Difference]: Start difference. First operand 3394 states and 4895 transitions. Second operand 16 states. [2019-11-23 22:33:21,183 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-11-23 22:33:21,928 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-23 22:33:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:24,971 INFO L93 Difference]: Finished difference Result 6349 states and 9198 transitions. [2019-11-23 22:33:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:33:24,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-11-23 22:33:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:24,976 INFO L225 Difference]: With dead ends: 6349 [2019-11-23 22:33:24,976 INFO L226 Difference]: Without dead ends: 6345 [2019-11-23 22:33:24,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2019-11-23 22:33:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6345 states. [2019-11-23 22:33:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6345 to 3383. [2019-11-23 22:33:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3383 states. [2019-11-23 22:33:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 4882 transitions. [2019-11-23 22:33:25,280 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 4882 transitions. Word has length 57 [2019-11-23 22:33:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:25,280 INFO L462 AbstractCegarLoop]: Abstraction has 3383 states and 4882 transitions. [2019-11-23 22:33:25,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 22:33:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 4882 transitions. [2019-11-23 22:33:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:33:25,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:25,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:25,281 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 247888215, now seen corresponding path program 1 times [2019-11-23 22:33:25,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:25,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740228085] [2019-11-23 22:33:25,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:25,897 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:25,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740228085] [2019-11-23 22:33:25,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:25,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-23 22:33:25,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234245138] [2019-11-23 22:33:25,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:33:25,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:25,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:33:25,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:25,900 INFO L87 Difference]: Start difference. First operand 3383 states and 4882 transitions. Second operand 15 states. [2019-11-23 22:33:26,461 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-23 22:33:26,755 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-23 22:33:27,012 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-23 22:33:27,394 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-11-23 22:33:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:30,222 INFO L93 Difference]: Finished difference Result 6288 states and 9120 transitions. [2019-11-23 22:33:30,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:30,223 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-11-23 22:33:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:30,228 INFO L225 Difference]: With dead ends: 6288 [2019-11-23 22:33:30,228 INFO L226 Difference]: Without dead ends: 6163 [2019-11-23 22:33:30,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:33:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6163 states. [2019-11-23 22:33:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6163 to 3356. [2019-11-23 22:33:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3356 states. [2019-11-23 22:33:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4845 transitions. [2019-11-23 22:33:30,534 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 4845 transitions. Word has length 57 [2019-11-23 22:33:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:30,534 INFO L462 AbstractCegarLoop]: Abstraction has 3356 states and 4845 transitions. [2019-11-23 22:33:30,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:33:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 4845 transitions. [2019-11-23 22:33:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:33:30,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:30,536 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:33:30,536 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:30,536 INFO L82 PathProgramCache]: Analyzing trace with hash -101338621, now seen corresponding path program 1 times [2019-11-23 22:33:30,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:30,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269639861] [2019-11-23 22:33:30,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:30,585 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:30,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269639861] [2019-11-23 22:33:30,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:30,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:30,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339857383] [2019-11-23 22:33:30,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:30,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:30,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:30,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:30,587 INFO L87 Difference]: Start difference. First operand 3356 states and 4845 transitions. Second operand 3 states. [2019-11-23 22:33:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:31,411 INFO L93 Difference]: Finished difference Result 8391 states and 12346 transitions. [2019-11-23 22:33:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:31,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-23 22:33:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:31,417 INFO L225 Difference]: With dead ends: 8391 [2019-11-23 22:33:31,417 INFO L226 Difference]: Without dead ends: 5669 [2019-11-23 22:33:31,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2019-11-23 22:33:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 5667. [2019-11-23 22:33:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5667 states. [2019-11-23 22:33:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5667 states to 5667 states and 8184 transitions. [2019-11-23 22:33:31,984 INFO L78 Accepts]: Start accepts. Automaton has 5667 states and 8184 transitions. Word has length 63 [2019-11-23 22:33:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:31,984 INFO L462 AbstractCegarLoop]: Abstraction has 5667 states and 8184 transitions. [2019-11-23 22:33:31,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5667 states and 8184 transitions. [2019-11-23 22:33:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-23 22:33:31,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:31,986 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] [2019-11-23 22:33:31,986 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash 838129574, now seen corresponding path program 1 times [2019-11-23 22:33:31,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:31,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875731949] [2019-11-23 22:33:31,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:32,083 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:32,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875731949] [2019-11-23 22:33:32,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:32,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:32,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413554313] [2019-11-23 22:33:32,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:32,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:32,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:32,086 INFO L87 Difference]: Start difference. First operand 5667 states and 8184 transitions. Second operand 5 states. [2019-11-23 22:33:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:32,762 INFO L93 Difference]: Finished difference Result 10033 states and 14591 transitions. [2019-11-23 22:33:32,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:32,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-23 22:33:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:32,767 INFO L225 Difference]: With dead ends: 10033 [2019-11-23 22:33:32,767 INFO L226 Difference]: Without dead ends: 4974 [2019-11-23 22:33:32,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4974 states. [2019-11-23 22:33:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4974 to 4958. [2019-11-23 22:33:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4958 states. [2019-11-23 22:33:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4958 states to 4958 states and 7061 transitions. [2019-11-23 22:33:33,296 INFO L78 Accepts]: Start accepts. Automaton has 4958 states and 7061 transitions. Word has length 64 [2019-11-23 22:33:33,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:33,296 INFO L462 AbstractCegarLoop]: Abstraction has 4958 states and 7061 transitions. [2019-11-23 22:33:33,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4958 states and 7061 transitions. [2019-11-23 22:33:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:33:33,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:33,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:33,299 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1809556404, now seen corresponding path program 1 times [2019-11-23 22:33:33,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:33,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715014426] [2019-11-23 22:33:33,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:33,385 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:33,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715014426] [2019-11-23 22:33:33,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:33,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:33,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570878826] [2019-11-23 22:33:33,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:33:33,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:33,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:33:33,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:33:33,387 INFO L87 Difference]: Start difference. First operand 4958 states and 7061 transitions. Second operand 6 states. [2019-11-23 22:33:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:34,597 INFO L93 Difference]: Finished difference Result 9379 states and 13301 transitions. [2019-11-23 22:33:34,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:33:34,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-23 22:33:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:34,605 INFO L225 Difference]: With dead ends: 9379 [2019-11-23 22:33:34,605 INFO L226 Difference]: Without dead ends: 9377 [2019-11-23 22:33:34,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2019-11-23 22:33:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 5114. [2019-11-23 22:33:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5114 states. [2019-11-23 22:33:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 7217 transitions. [2019-11-23 22:33:35,229 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 7217 transitions. Word has length 66 [2019-11-23 22:33:35,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:35,230 INFO L462 AbstractCegarLoop]: Abstraction has 5114 states and 7217 transitions. [2019-11-23 22:33:35,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:33:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 7217 transitions. [2019-11-23 22:33:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:33:35,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:35,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:35,233 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:35,233 INFO L82 PathProgramCache]: Analyzing trace with hash 382235117, now seen corresponding path program 1 times [2019-11-23 22:33:35,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:35,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503740908] [2019-11-23 22:33:35,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:35,280 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:35,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503740908] [2019-11-23 22:33:35,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:35,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:35,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498205216] [2019-11-23 22:33:35,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:35,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:35,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:35,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:35,282 INFO L87 Difference]: Start difference. First operand 5114 states and 7217 transitions. Second operand 3 states. [2019-11-23 22:33:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:36,734 INFO L93 Difference]: Finished difference Result 13212 states and 18793 transitions. [2019-11-23 22:33:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:36,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:33:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:36,744 INFO L225 Difference]: With dead ends: 13212 [2019-11-23 22:33:36,744 INFO L226 Difference]: Without dead ends: 8676 [2019-11-23 22:33:36,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8676 states. [2019-11-23 22:33:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8676 to 8570. [2019-11-23 22:33:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8570 states. [2019-11-23 22:33:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8570 states to 8570 states and 11993 transitions. [2019-11-23 22:33:37,824 INFO L78 Accepts]: Start accepts. Automaton has 8570 states and 11993 transitions. Word has length 67 [2019-11-23 22:33:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:37,825 INFO L462 AbstractCegarLoop]: Abstraction has 8570 states and 11993 transitions. [2019-11-23 22:33:37,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 8570 states and 11993 transitions. [2019-11-23 22:33:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:33:37,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:37,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:37,827 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:33:37,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:37,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1080773224, now seen corresponding path program 1 times [2019-11-23 22:33:37,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:37,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321673359] [2019-11-23 22:33:37,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:37,882 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:37,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321673359] [2019-11-23 22:33:37,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:37,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:37,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603742907] [2019-11-23 22:33:37,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:37,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:37,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:37,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:37,884 INFO L87 Difference]: Start difference. First operand 8570 states and 11993 transitions. Second operand 3 states. [2019-11-23 22:33:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:39,043 INFO L93 Difference]: Finished difference Result 9918 states and 13875 transitions. [2019-11-23 22:33:39,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:39,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-23 22:33:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:39,053 INFO L225 Difference]: With dead ends: 9918 [2019-11-23 22:33:39,053 INFO L226 Difference]: Without dead ends: 7210 [2019-11-23 22:33:39,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7210 states. [2019-11-23 22:33:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7210 to 6027. [2019-11-23 22:33:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6027 states. [2019-11-23 22:33:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 8319 transitions. [2019-11-23 22:33:39,780 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 8319 transitions. Word has length 68 [2019-11-23 22:33:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:39,780 INFO L462 AbstractCegarLoop]: Abstraction has 6027 states and 8319 transitions. [2019-11-23 22:33:39,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 8319 transitions. [2019-11-23 22:33:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:33:39,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:39,782 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:39,782 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:33:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash 604312731, now seen corresponding path program 1 times [2019-11-23 22:33:39,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:39,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885584198] [2019-11-23 22:33:39,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:39,826 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:39,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885584198] [2019-11-23 22:33:39,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:39,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:39,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738005137] [2019-11-23 22:33:39,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:39,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:39,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:39,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:39,828 INFO L87 Difference]: Start difference. First operand 6027 states and 8319 transitions. Second operand 3 states. [2019-11-23 22:33:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:41,261 INFO L93 Difference]: Finished difference Result 7351 states and 10141 transitions. [2019-11-23 22:33:41,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:41,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-23 22:33:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:41,265 INFO L225 Difference]: With dead ends: 7351 [2019-11-23 22:33:41,266 INFO L226 Difference]: Without dead ends: 4709 [2019-11-23 22:33:41,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2019-11-23 22:33:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 4679. [2019-11-23 22:33:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4679 states. [2019-11-23 22:33:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4679 states to 4679 states and 6327 transitions. [2019-11-23 22:33:41,851 INFO L78 Accepts]: Start accepts. Automaton has 4679 states and 6327 transitions. Word has length 68 [2019-11-23 22:33:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:41,851 INFO L462 AbstractCegarLoop]: Abstraction has 4679 states and 6327 transitions. [2019-11-23 22:33:41,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4679 states and 6327 transitions. [2019-11-23 22:33:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:33:41,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:41,853 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:41,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1757380342, now seen corresponding path program 1 times [2019-11-23 22:33:41,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:41,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517154855] [2019-11-23 22:33:41,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:41,935 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:41,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517154855] [2019-11-23 22:33:41,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:41,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:41,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246032802] [2019-11-23 22:33:41,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:33:41,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:33:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:41,937 INFO L87 Difference]: Start difference. First operand 4679 states and 6327 transitions. Second operand 7 states. [2019-11-23 22:33:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:44,759 INFO L93 Difference]: Finished difference Result 15848 states and 21618 transitions. [2019-11-23 22:33:44,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:33:44,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-11-23 22:33:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:44,780 INFO L225 Difference]: With dead ends: 15848 [2019-11-23 22:33:44,780 INFO L226 Difference]: Without dead ends: 13918 [2019-11-23 22:33:44,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13918 states. [2019-11-23 22:33:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13918 to 6519. [2019-11-23 22:33:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6519 states. [2019-11-23 22:33:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6519 states to 6519 states and 8855 transitions. [2019-11-23 22:33:45,814 INFO L78 Accepts]: Start accepts. Automaton has 6519 states and 8855 transitions. Word has length 68 [2019-11-23 22:33:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:45,815 INFO L462 AbstractCegarLoop]: Abstraction has 6519 states and 8855 transitions. [2019-11-23 22:33:45,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:33:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 6519 states and 8855 transitions. [2019-11-23 22:33:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-23 22:33:45,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:45,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:45,818 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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:45,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:45,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1471837234, now seen corresponding path program 1 times [2019-11-23 22:33:45,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:45,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430068235] [2019-11-23 22:33:45,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:45,882 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:45,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430068235] [2019-11-23 22:33:45,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:45,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:45,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008672570] [2019-11-23 22:33:45,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:33:45,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:45,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:33:45,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:45,884 INFO L87 Difference]: Start difference. First operand 6519 states and 8855 transitions. Second operand 7 states. [2019-11-23 22:33:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:49,554 INFO L93 Difference]: Finished difference Result 20677 states and 28221 transitions. [2019-11-23 22:33:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:33:49,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-23 22:33:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:49,568 INFO L225 Difference]: With dead ends: 20677 [2019-11-23 22:33:49,568 INFO L226 Difference]: Without dead ends: 17875 [2019-11-23 22:33:49,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17875 states. [2019-11-23 22:33:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17875 to 8333. [2019-11-23 22:33:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8333 states. [2019-11-23 22:33:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8333 states to 8333 states and 11347 transitions. [2019-11-23 22:33:50,789 INFO L78 Accepts]: Start accepts. Automaton has 8333 states and 11347 transitions. Word has length 70 [2019-11-23 22:33:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:50,790 INFO L462 AbstractCegarLoop]: Abstraction has 8333 states and 11347 transitions. [2019-11-23 22:33:50,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:33:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 8333 states and 11347 transitions. [2019-11-23 22:33:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 22:33:50,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:50,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:50,792 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1552375103, now seen corresponding path program 1 times [2019-11-23 22:33:50,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:50,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477794113] [2019-11-23 22:33:50,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:50,895 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,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477794113] [2019-11-23 22:33:50,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:50,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:50,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724942795] [2019-11-23 22:33:50,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:33:50,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:33:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:33:50,896 INFO L87 Difference]: Start difference. First operand 8333 states and 11347 transitions. Second operand 6 states.