/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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:33:52,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:33:52,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:33:52,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:33:52,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:33:52,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:33:52,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:33:52,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:33:52,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:33:52,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:33:52,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:33:52,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:33:52,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:33:52,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:33:52,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:33:52,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:33:52,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:33:52,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:33:52,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:33:52,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:33:53,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:33:53,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:33:53,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:33:53,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:33:53,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:33:53,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:33:53,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:33:53,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:33:53,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:33:53,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:33:53,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:33:53,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:33:53,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:33:53,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:33:53,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:33:53,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:33:53,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:33:53,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:33:53,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:33:53,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:33:53,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:33:53,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:33:53,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:33:53,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:33:53,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:33:53,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:33:53,053 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:33:53,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:33:53,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:33:53,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:33:53,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:33:53,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:33:53,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:33:53,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:33:53,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:33:53,056 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:33:53,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:33:53,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:33:53,056 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:33:53,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:33:53,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:33:53,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:33:53,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:33:53,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:33:53,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:33:53,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:33:53,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:33:53,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:33:53,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:33:53,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:33:53,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:33:53,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:33:53,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:33:53,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:33:53,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:33:53,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:33:53,342 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:33:53,344 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-23 22:33:53,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b825178b/2e097971ef2f4e0b8afe9daa7400d777/FLAG43d69a2e6 [2019-11-23 22:33:54,142 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:33:54,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-23 22:33:54,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b825178b/2e097971ef2f4e0b8afe9daa7400d777/FLAG43d69a2e6 [2019-11-23 22:33:54,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b825178b/2e097971ef2f4e0b8afe9daa7400d777 [2019-11-23 22:33:54,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:33:54,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:33:54,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:33:54,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:33:54,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:33:54,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:33:54" (1/1) ... [2019-11-23 22:33:54,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a899d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:54, skipping insertion in model container [2019-11-23 22:33:54,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:33:54" (1/1) ... [2019-11-23 22:33:54,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:33:54,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:33:55,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:33:55,513 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:33:55,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:33:55,981 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:33:55,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55 WrapperNode [2019-11-23 22:33:55,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:33:55,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:33:55,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:33:55,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:33:55,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... [2019-11-23 22:33:56,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... [2019-11-23 22:33:56,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:33:56,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:33:56,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:33:56,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:33:56,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... [2019-11-23 22:33:56,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... [2019-11-23 22:33:56,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... [2019-11-23 22:33:56,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... [2019-11-23 22:33:56,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... [2019-11-23 22:33:56,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... [2019-11-23 22:33:56,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... [2019-11-23 22:33:56,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:33:56,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:33:56,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:33:56,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:33:56,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:33:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:33:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:34:00,033 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:34:00,034 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:34:00,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:00 BoogieIcfgContainer [2019-11-23 22:34:00,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:34:00,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:34:00,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:34:00,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:34:00,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:33:54" (1/3) ... [2019-11-23 22:34:00,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33511049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:00, skipping insertion in model container [2019-11-23 22:34:00,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:33:55" (2/3) ... [2019-11-23 22:34:00,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33511049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:00, skipping insertion in model container [2019-11-23 22:34:00,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:00" (3/3) ... [2019-11-23 22:34:00,049 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-23 22:34:00,059 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:34:00,067 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-23 22:34:00,077 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-23 22:34:00,111 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:34:00,111 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:34:00,111 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:34:00,111 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:34:00,112 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:34:00,112 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:34:00,112 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:34:00,112 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:34:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states. [2019-11-23 22:34:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:34:00,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:00,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:00,177 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:34:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:00,183 INFO L82 PathProgramCache]: Analyzing trace with hash 692081489, now seen corresponding path program 1 times [2019-11-23 22:34:00,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:00,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678465289] [2019-11-23 22:34:00,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:00,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678465289] [2019-11-23 22:34:00,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:00,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:00,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131316535] [2019-11-23 22:34:00,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:34:00,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:34:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:34:00,740 INFO L87 Difference]: Start difference. First operand 1290 states. Second operand 6 states. [2019-11-23 22:34:02,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:02,869 INFO L93 Difference]: Finished difference Result 2843 states and 4844 transitions. [2019-11-23 22:34:02,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:02,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-23 22:34:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:02,919 INFO L225 Difference]: With dead ends: 2843 [2019-11-23 22:34:02,919 INFO L226 Difference]: Without dead ends: 1919 [2019-11-23 22:34:02,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:34:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-11-23 22:34:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1907. [2019-11-23 22:34:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-11-23 22:34:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2512 transitions. [2019-11-23 22:34:03,132 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2512 transitions. Word has length 52 [2019-11-23 22:34:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:03,134 INFO L462 AbstractCegarLoop]: Abstraction has 1907 states and 2512 transitions. [2019-11-23 22:34:03,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:34:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2512 transitions. [2019-11-23 22:34:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:34:03,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:03,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:03,140 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:34:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash -736362272, now seen corresponding path program 1 times [2019-11-23 22:34:03,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:03,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292613532] [2019-11-23 22:34:03,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:03,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292613532] [2019-11-23 22:34:03,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:03,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:03,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954517358] [2019-11-23 22:34:03,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:03,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:03,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:03,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:03,351 INFO L87 Difference]: Start difference. First operand 1907 states and 2512 transitions. Second operand 5 states. [2019-11-23 22:34:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:04,619 INFO L93 Difference]: Finished difference Result 3871 states and 5140 transitions. [2019-11-23 22:34:04,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:04,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-23 22:34:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:04,635 INFO L225 Difference]: With dead ends: 3871 [2019-11-23 22:34:04,636 INFO L226 Difference]: Without dead ends: 2709 [2019-11-23 22:34:04,640 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:34:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2019-11-23 22:34:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2695. [2019-11-23 22:34:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-11-23 22:34:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3587 transitions. [2019-11-23 22:34:04,769 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3587 transitions. Word has length 53 [2019-11-23 22:34:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:04,770 INFO L462 AbstractCegarLoop]: Abstraction has 2695 states and 3587 transitions. [2019-11-23 22:34:04,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3587 transitions. [2019-11-23 22:34:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:34:04,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:04,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:04,780 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:34:04,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:04,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1386389066, now seen corresponding path program 1 times [2019-11-23 22:34:04,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:04,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945043327] [2019-11-23 22:34:04,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:05,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945043327] [2019-11-23 22:34:05,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:05,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:05,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415819726] [2019-11-23 22:34:05,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:05,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:05,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:05,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:05,019 INFO L87 Difference]: Start difference. First operand 2695 states and 3587 transitions. Second operand 5 states. [2019-11-23 22:34:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:06,409 INFO L93 Difference]: Finished difference Result 5677 states and 7654 transitions. [2019-11-23 22:34:06,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:06,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-23 22:34:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:06,430 INFO L225 Difference]: With dead ends: 5677 [2019-11-23 22:34:06,430 INFO L226 Difference]: Without dead ends: 3899 [2019-11-23 22:34:06,434 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:34:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2019-11-23 22:34:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3889. [2019-11-23 22:34:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3889 states. [2019-11-23 22:34:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 5199 transitions. [2019-11-23 22:34:06,627 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 5199 transitions. Word has length 53 [2019-11-23 22:34:06,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:06,628 INFO L462 AbstractCegarLoop]: Abstraction has 3889 states and 5199 transitions. [2019-11-23 22:34:06,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 5199 transitions. [2019-11-23 22:34:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:06,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:06,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:06,632 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:34:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1763239895, now seen corresponding path program 1 times [2019-11-23 22:34:06,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:06,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113416017] [2019-11-23 22:34:06,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:06,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113416017] [2019-11-23 22:34:06,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:06,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:34:06,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405801610] [2019-11-23 22:34:06,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:34:06,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:06,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:34:06,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:34:06,839 INFO L87 Difference]: Start difference. First operand 3889 states and 5199 transitions. Second operand 8 states. [2019-11-23 22:34:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:09,029 INFO L93 Difference]: Finished difference Result 6808 states and 9471 transitions. [2019-11-23 22:34:09,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:34:09,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-11-23 22:34:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:09,064 INFO L225 Difference]: With dead ends: 6808 [2019-11-23 22:34:09,064 INFO L226 Difference]: Without dead ends: 5872 [2019-11-23 22:34:09,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:34:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5872 states. [2019-11-23 22:34:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5872 to 3889. [2019-11-23 22:34:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3889 states. [2019-11-23 22:34:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 5198 transitions. [2019-11-23 22:34:09,313 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 5198 transitions. Word has length 55 [2019-11-23 22:34:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:09,314 INFO L462 AbstractCegarLoop]: Abstraction has 3889 states and 5198 transitions. [2019-11-23 22:34:09,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:34:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 5198 transitions. [2019-11-23 22:34:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:09,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:09,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:09,319 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:34:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash 622296368, now seen corresponding path program 1 times [2019-11-23 22:34:09,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:09,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64605505] [2019-11-23 22:34:09,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:09,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64605505] [2019-11-23 22:34:09,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:09,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:34:09,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601611369] [2019-11-23 22:34:09,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:34:09,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:34:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:34:09,608 INFO L87 Difference]: Start difference. First operand 3889 states and 5198 transitions. Second operand 9 states. [2019-11-23 22:34:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:13,924 INFO L93 Difference]: Finished difference Result 8405 states and 11898 transitions. [2019-11-23 22:34:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 22:34:13,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-23 22:34:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:13,956 INFO L225 Difference]: With dead ends: 8405 [2019-11-23 22:34:13,956 INFO L226 Difference]: Without dead ends: 7607 [2019-11-23 22:34:13,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-11-23 22:34:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7607 states. [2019-11-23 22:34:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7607 to 3889. [2019-11-23 22:34:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3889 states. [2019-11-23 22:34:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 5197 transitions. [2019-11-23 22:34:14,253 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 5197 transitions. Word has length 55 [2019-11-23 22:34:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:14,254 INFO L462 AbstractCegarLoop]: Abstraction has 3889 states and 5197 transitions. [2019-11-23 22:34:14,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:34:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 5197 transitions. [2019-11-23 22:34:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:14,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:14,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:14,259 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:14,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1268497001, now seen corresponding path program 1 times [2019-11-23 22:34:14,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:14,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744127606] [2019-11-23 22:34:14,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:14,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744127606] [2019-11-23 22:34:14,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:14,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:34:14,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470485330] [2019-11-23 22:34:14,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:34:14,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:34:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:34:14,412 INFO L87 Difference]: Start difference. First operand 3889 states and 5197 transitions. Second operand 9 states. [2019-11-23 22:34:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:17,118 INFO L93 Difference]: Finished difference Result 6062 states and 8278 transitions. [2019-11-23 22:34:17,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:34:17,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-23 22:34:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:17,143 INFO L225 Difference]: With dead ends: 6062 [2019-11-23 22:34:17,143 INFO L226 Difference]: Without dead ends: 6056 [2019-11-23 22:34:17,146 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:34:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-11-23 22:34:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3889. [2019-11-23 22:34:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3889 states. [2019-11-23 22:34:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 5196 transitions. [2019-11-23 22:34:17,430 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 5196 transitions. Word has length 55 [2019-11-23 22:34:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:17,431 INFO L462 AbstractCegarLoop]: Abstraction has 3889 states and 5196 transitions. [2019-11-23 22:34:17,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:34:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 5196 transitions. [2019-11-23 22:34:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:17,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:17,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:17,438 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:17,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1662572980, now seen corresponding path program 1 times [2019-11-23 22:34:17,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:17,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874791824] [2019-11-23 22:34:17,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:17,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874791824] [2019-11-23 22:34:17,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:17,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:17,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825062734] [2019-11-23 22:34:17,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:17,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:17,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:17,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:17,529 INFO L87 Difference]: Start difference. First operand 3889 states and 5196 transitions. Second operand 3 states. [2019-11-23 22:34:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:17,841 INFO L93 Difference]: Finished difference Result 5265 states and 7281 transitions. [2019-11-23 22:34:17,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:17,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-23 22:34:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:17,855 INFO L225 Difference]: With dead ends: 5265 [2019-11-23 22:34:17,855 INFO L226 Difference]: Without dead ends: 3974 [2019-11-23 22:34:17,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2019-11-23 22:34:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3972. [2019-11-23 22:34:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3972 states. [2019-11-23 22:34:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 5371 transitions. [2019-11-23 22:34:18,067 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 5371 transitions. Word has length 56 [2019-11-23 22:34:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:18,068 INFO L462 AbstractCegarLoop]: Abstraction has 3972 states and 5371 transitions. [2019-11-23 22:34:18,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 5371 transitions. [2019-11-23 22:34:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:18,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:18,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:18,072 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:18,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1775531576, now seen corresponding path program 1 times [2019-11-23 22:34:18,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:18,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505823761] [2019-11-23 22:34:18,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:18,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505823761] [2019-11-23 22:34:18,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:18,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:18,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815440863] [2019-11-23 22:34:18,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:18,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:18,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:18,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:18,133 INFO L87 Difference]: Start difference. First operand 3972 states and 5371 transitions. Second operand 3 states. [2019-11-23 22:34:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:18,394 INFO L93 Difference]: Finished difference Result 6366 states and 8994 transitions. [2019-11-23 22:34:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:18,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-23 22:34:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:18,404 INFO L225 Difference]: With dead ends: 6366 [2019-11-23 22:34:18,404 INFO L226 Difference]: Without dead ends: 4640 [2019-11-23 22:34:18,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2019-11-23 22:34:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4638. [2019-11-23 22:34:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4638 states. [2019-11-23 22:34:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 6407 transitions. [2019-11-23 22:34:18,799 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 6407 transitions. Word has length 56 [2019-11-23 22:34:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:18,799 INFO L462 AbstractCegarLoop]: Abstraction has 4638 states and 6407 transitions. [2019-11-23 22:34:18,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 6407 transitions. [2019-11-23 22:34:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:18,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:18,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:18,808 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1498951000, now seen corresponding path program 1 times [2019-11-23 22:34:18,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:18,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453421669] [2019-11-23 22:34:18,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:18,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453421669] [2019-11-23 22:34:18,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:18,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:18,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636207686] [2019-11-23 22:34:18,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:18,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:18,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:18,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:18,877 INFO L87 Difference]: Start difference. First operand 4638 states and 6407 transitions. Second operand 3 states. [2019-11-23 22:34:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:19,350 INFO L93 Difference]: Finished difference Result 10079 states and 14251 transitions. [2019-11-23 22:34:19,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:19,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-23 22:34:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:19,366 INFO L225 Difference]: With dead ends: 10079 [2019-11-23 22:34:19,366 INFO L226 Difference]: Without dead ends: 6860 [2019-11-23 22:34:19,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6860 states. [2019-11-23 22:34:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6860 to 5963. [2019-11-23 22:34:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5963 states. [2019-11-23 22:34:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5963 states to 5963 states and 8143 transitions. [2019-11-23 22:34:19,774 INFO L78 Accepts]: Start accepts. Automaton has 5963 states and 8143 transitions. Word has length 56 [2019-11-23 22:34:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:19,774 INFO L462 AbstractCegarLoop]: Abstraction has 5963 states and 8143 transitions. [2019-11-23 22:34:19,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5963 states and 8143 transitions. [2019-11-23 22:34:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:34:19,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:19,777 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:34:19,777 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:19,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1118792296, now seen corresponding path program 1 times [2019-11-23 22:34:19,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:19,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182490377] [2019-11-23 22:34:19,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:21,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182490377] [2019-11-23 22:34:21,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:21,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-23 22:34:21,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463930350] [2019-11-23 22:34:21,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 22:34:21,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:21,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 22:34:21,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-11-23 22:34:21,144 INFO L87 Difference]: Start difference. First operand 5963 states and 8143 transitions. Second operand 21 states. [2019-11-23 22:34:21,323 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-23 22:34:21,924 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-23 22:34:22,118 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-11-23 22:34:22,353 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-23 22:34:22,688 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-23 22:34:23,231 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-11-23 22:34:23,795 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-11-23 22:34:24,133 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-23 22:34:24,366 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-23 22:34:24,809 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-23 22:34:25,083 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-11-23 22:34:25,652 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-23 22:34:25,844 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-23 22:34:26,224 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-11-23 22:34:26,596 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-23 22:34:27,240 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-23 22:34:27,444 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-11-23 22:34:28,767 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-11-23 22:34:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:34,747 INFO L93 Difference]: Finished difference Result 18912 states and 26860 transitions. [2019-11-23 22:34:34,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 22:34:34,747 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-11-23 22:34:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:34,772 INFO L225 Difference]: With dead ends: 18912 [2019-11-23 22:34:34,772 INFO L226 Difference]: Without dead ends: 18814 [2019-11-23 22:34:34,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 22:34:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18814 states. [2019-11-23 22:34:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18814 to 5962. [2019-11-23 22:34:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5962 states. [2019-11-23 22:34:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5962 states to 5962 states and 8141 transitions. [2019-11-23 22:34:35,497 INFO L78 Accepts]: Start accepts. Automaton has 5962 states and 8141 transitions. Word has length 57 [2019-11-23 22:34:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:35,498 INFO L462 AbstractCegarLoop]: Abstraction has 5962 states and 8141 transitions. [2019-11-23 22:34:35,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 22:34:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5962 states and 8141 transitions. [2019-11-23 22:34:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:34:35,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:35,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:35,502 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -677466950, now seen corresponding path program 1 times [2019-11-23 22:34:35,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:35,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378112710] [2019-11-23 22:34:35,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:35,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378112710] [2019-11-23 22:34:35,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:35,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:35,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685221371] [2019-11-23 22:34:35,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:35,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:35,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:35,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:35,564 INFO L87 Difference]: Start difference. First operand 5962 states and 8141 transitions. Second operand 3 states. [2019-11-23 22:34:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:36,212 INFO L93 Difference]: Finished difference Result 11233 states and 15625 transitions. [2019-11-23 22:34:36,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:36,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-23 22:34:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:36,223 INFO L225 Difference]: With dead ends: 11233 [2019-11-23 22:34:36,223 INFO L226 Difference]: Without dead ends: 6443 [2019-11-23 22:34:36,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:36,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6443 states. [2019-11-23 22:34:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6443 to 5117. [2019-11-23 22:34:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-11-23 22:34:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 7091 transitions. [2019-11-23 22:34:36,813 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 7091 transitions. Word has length 57 [2019-11-23 22:34:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:36,814 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 7091 transitions. [2019-11-23 22:34:36,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 7091 transitions. [2019-11-23 22:34:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:34:36,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:36,817 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:34:36,817 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash -611117000, now seen corresponding path program 1 times [2019-11-23 22:34:36,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:36,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442120023] [2019-11-23 22:34:36,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:36,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442120023] [2019-11-23 22:34:36,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:36,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:36,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881581732] [2019-11-23 22:34:36,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:36,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:36,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:36,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:36,856 INFO L87 Difference]: Start difference. First operand 5117 states and 7091 transitions. Second operand 3 states. [2019-11-23 22:34:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:37,408 INFO L93 Difference]: Finished difference Result 9947 states and 14034 transitions. [2019-11-23 22:34:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:37,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-23 22:34:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:37,416 INFO L225 Difference]: With dead ends: 9947 [2019-11-23 22:34:37,417 INFO L226 Difference]: Without dead ends: 5663 [2019-11-23 22:34:37,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5663 states. [2019-11-23 22:34:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5663 to 4528. [2019-11-23 22:34:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4528 states. [2019-11-23 22:34:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4528 states to 4528 states and 6334 transitions. [2019-11-23 22:34:37,928 INFO L78 Accepts]: Start accepts. Automaton has 4528 states and 6334 transitions. Word has length 57 [2019-11-23 22:34:37,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:37,928 INFO L462 AbstractCegarLoop]: Abstraction has 4528 states and 6334 transitions. [2019-11-23 22:34:37,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 4528 states and 6334 transitions. [2019-11-23 22:34:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:34:37,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:37,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:37,931 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1274837938, now seen corresponding path program 1 times [2019-11-23 22:34:37,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:37,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235829846] [2019-11-23 22:34:37,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:37,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235829846] [2019-11-23 22:34:37,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:37,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:37,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581636137] [2019-11-23 22:34:37,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:37,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:37,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:37,971 INFO L87 Difference]: Start difference. First operand 4528 states and 6334 transitions. Second operand 3 states. [2019-11-23 22:34:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:38,705 INFO L93 Difference]: Finished difference Result 11051 states and 15815 transitions. [2019-11-23 22:34:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:38,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-23 22:34:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:38,711 INFO L225 Difference]: With dead ends: 11051 [2019-11-23 22:34:38,711 INFO L226 Difference]: Without dead ends: 6878 [2019-11-23 22:34:38,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2019-11-23 22:34:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 5397. [2019-11-23 22:34:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5397 states. [2019-11-23 22:34:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5397 states to 5397 states and 7695 transitions. [2019-11-23 22:34:39,183 INFO L78 Accepts]: Start accepts. Automaton has 5397 states and 7695 transitions. Word has length 57 [2019-11-23 22:34:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:39,183 INFO L462 AbstractCegarLoop]: Abstraction has 5397 states and 7695 transitions. [2019-11-23 22:34:39,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5397 states and 7695 transitions. [2019-11-23 22:34:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:34:39,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:39,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:39,186 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash -410378211, now seen corresponding path program 1 times [2019-11-23 22:34:39,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:39,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270023652] [2019-11-23 22:34:39,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:39,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270023652] [2019-11-23 22:34:39,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:39,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:34:39,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753668174] [2019-11-23 22:34:39,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:34:39,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:39,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:34:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:39,817 INFO L87 Difference]: Start difference. First operand 5397 states and 7695 transitions. Second operand 19 states. [2019-11-23 22:34:40,011 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-11-23 22:34:40,551 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-11-23 22:34:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:46,452 INFO L93 Difference]: Finished difference Result 16052 states and 23154 transitions. [2019-11-23 22:34:46,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 22:34:46,453 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-11-23 22:34:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:46,467 INFO L225 Difference]: With dead ends: 16052 [2019-11-23 22:34:46,468 INFO L226 Difference]: Without dead ends: 16048 [2019-11-23 22:34:46,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 22:34:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16048 states. [2019-11-23 22:34:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16048 to 5397. [2019-11-23 22:34:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5397 states. [2019-11-23 22:34:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5397 states to 5397 states and 7694 transitions. [2019-11-23 22:34:47,091 INFO L78 Accepts]: Start accepts. Automaton has 5397 states and 7694 transitions. Word has length 58 [2019-11-23 22:34:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:47,091 INFO L462 AbstractCegarLoop]: Abstraction has 5397 states and 7694 transitions. [2019-11-23 22:34:47,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:34:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5397 states and 7694 transitions. [2019-11-23 22:34:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:34:47,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:47,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:47,094 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:47,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1645651769, now seen corresponding path program 1 times [2019-11-23 22:34:47,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:47,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009474693] [2019-11-23 22:34:47,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:47,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009474693] [2019-11-23 22:34:47,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:47,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:34:47,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496723233] [2019-11-23 22:34:47,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:34:47,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:34:47,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:47,602 INFO L87 Difference]: Start difference. First operand 5397 states and 7694 transitions. Second operand 19 states. [2019-11-23 22:34:47,787 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-23 22:34:48,368 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-23 22:34:48,960 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-23 22:34:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:54,071 INFO L93 Difference]: Finished difference Result 12700 states and 18238 transitions. [2019-11-23 22:34:54,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 22:34:54,071 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-11-23 22:34:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:54,081 INFO L225 Difference]: With dead ends: 12700 [2019-11-23 22:34:54,081 INFO L226 Difference]: Without dead ends: 12696 [2019-11-23 22:34:54,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 22:34:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12696 states. [2019-11-23 22:34:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12696 to 5405. [2019-11-23 22:34:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-11-23 22:34:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7704 transitions. [2019-11-23 22:34:54,647 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7704 transitions. Word has length 58 [2019-11-23 22:34:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:54,647 INFO L462 AbstractCegarLoop]: Abstraction has 5405 states and 7704 transitions. [2019-11-23 22:34:54,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:34:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7704 transitions. [2019-11-23 22:34:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:34:54,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:54,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:54,648 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:54,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:54,648 INFO L82 PathProgramCache]: Analyzing trace with hash 666824509, now seen corresponding path program 1 times [2019-11-23 22:34:54,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:54,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496547999] [2019-11-23 22:34:54,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:55,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496547999] [2019-11-23 22:34:55,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:55,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:34:55,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678844655] [2019-11-23 22:34:55,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:34:55,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:34:55,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:55,108 INFO L87 Difference]: Start difference. First operand 5405 states and 7704 transitions. Second operand 19 states. [2019-11-23 22:34:55,275 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-11-23 22:35:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:00,832 INFO L93 Difference]: Finished difference Result 12378 states and 17801 transitions. [2019-11-23 22:35:00,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:35:00,833 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-11-23 22:35:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:00,841 INFO L225 Difference]: With dead ends: 12378 [2019-11-23 22:35:00,841 INFO L226 Difference]: Without dead ends: 12371 [2019-11-23 22:35:00,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 22:35:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12371 states. [2019-11-23 22:35:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12371 to 5405. [2019-11-23 22:35:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-11-23 22:35:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7703 transitions. [2019-11-23 22:35:01,427 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7703 transitions. Word has length 58 [2019-11-23 22:35:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:01,427 INFO L462 AbstractCegarLoop]: Abstraction has 5405 states and 7703 transitions. [2019-11-23 22:35:01,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:35:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7703 transitions. [2019-11-23 22:35:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 22:35:01,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:01,429 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] [2019-11-23 22:35:01,429 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:35:01,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash 360460988, now seen corresponding path program 1 times [2019-11-23 22:35:01,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:01,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546573753] [2019-11-23 22:35:01,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:01,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546573753] [2019-11-23 22:35:01,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:01,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-23 22:35:01,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213563711] [2019-11-23 22:35:01,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:35:01,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:01,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:35:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:35:01,948 INFO L87 Difference]: Start difference. First operand 5405 states and 7703 transitions. Second operand 15 states. [2019-11-23 22:35:02,770 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-11-23 22:35:02,939 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-11-23 22:35:03,242 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-11-23 22:35:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:05,795 INFO L93 Difference]: Finished difference Result 9113 states and 12982 transitions. [2019-11-23 22:35:05,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:35:05,796 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-11-23 22:35:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:05,803 INFO L225 Difference]: With dead ends: 9113 [2019-11-23 22:35:05,804 INFO L226 Difference]: Without dead ends: 9101 [2019-11-23 22:35:05,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-11-23 22:35:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9101 states. [2019-11-23 22:35:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9101 to 5393. [2019-11-23 22:35:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5393 states. [2019-11-23 22:35:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5393 states to 5393 states and 7691 transitions. [2019-11-23 22:35:06,479 INFO L78 Accepts]: Start accepts. Automaton has 5393 states and 7691 transitions. Word has length 59 [2019-11-23 22:35:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:06,479 INFO L462 AbstractCegarLoop]: Abstraction has 5393 states and 7691 transitions. [2019-11-23 22:35:06,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:35:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 5393 states and 7691 transitions. [2019-11-23 22:35:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 22:35:06,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:06,481 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] [2019-11-23 22:35:06,481 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:35:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash 3906094, now seen corresponding path program 1 times [2019-11-23 22:35:06,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:06,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394475150] [2019-11-23 22:35:06,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:06,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394475150] [2019-11-23 22:35:06,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:06,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-23 22:35:06,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022415651] [2019-11-23 22:35:06,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:35:06,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:35:06,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:35:06,787 INFO L87 Difference]: Start difference. First operand 5393 states and 7691 transitions. Second operand 12 states. [2019-11-23 22:35:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:09,456 INFO L93 Difference]: Finished difference Result 9451 states and 13502 transitions. [2019-11-23 22:35:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 22:35:09,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-11-23 22:35:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:09,463 INFO L225 Difference]: With dead ends: 9451 [2019-11-23 22:35:09,463 INFO L226 Difference]: Without dead ends: 9447 [2019-11-23 22:35:09,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:35:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9447 states. [2019-11-23 22:35:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9447 to 5381. [2019-11-23 22:35:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5381 states. [2019-11-23 22:35:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5381 states to 5381 states and 7677 transitions. [2019-11-23 22:35:10,129 INFO L78 Accepts]: Start accepts. Automaton has 5381 states and 7677 transitions. Word has length 59 [2019-11-23 22:35:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:10,129 INFO L462 AbstractCegarLoop]: Abstraction has 5381 states and 7677 transitions. [2019-11-23 22:35:10,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:35:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5381 states and 7677 transitions. [2019-11-23 22:35:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 22:35:10,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:10,130 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] [2019-11-23 22:35:10,131 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:35:10,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:10,131 INFO L82 PathProgramCache]: Analyzing trace with hash 467681014, now seen corresponding path program 1 times [2019-11-23 22:35:10,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:10,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525721939] [2019-11-23 22:35:10,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:10,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525721939] [2019-11-23 22:35:10,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:10,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-23 22:35:10,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699703779] [2019-11-23 22:35:10,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:35:10,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:35:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:35:10,752 INFO L87 Difference]: Start difference. First operand 5381 states and 7677 transitions. Second operand 15 states. [2019-11-23 22:35:11,226 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-23 22:35:11,772 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-23 22:35:13,218 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-23 22:35:13,719 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-23 22:35:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:15,669 INFO L93 Difference]: Finished difference Result 8661 states and 12333 transitions. [2019-11-23 22:35:15,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:35:15,669 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-11-23 22:35:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:15,677 INFO L225 Difference]: With dead ends: 8661 [2019-11-23 22:35:15,677 INFO L226 Difference]: Without dead ends: 8533 [2019-11-23 22:35:15,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:35:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8533 states. [2019-11-23 22:35:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8533 to 5357. [2019-11-23 22:35:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5357 states. [2019-11-23 22:35:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 7646 transitions. [2019-11-23 22:35:16,460 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 7646 transitions. Word has length 59 [2019-11-23 22:35:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:16,460 INFO L462 AbstractCegarLoop]: Abstraction has 5357 states and 7646 transitions. [2019-11-23 22:35:16,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:35:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 7646 transitions. [2019-11-23 22:35:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:35:16,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:16,462 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:16,463 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:35:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1327663405, now seen corresponding path program 1 times [2019-11-23 22:35:16,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:16,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320342670] [2019-11-23 22:35:16,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:16,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320342670] [2019-11-23 22:35:16,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:16,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:16,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265079285] [2019-11-23 22:35:16,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:16,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:16,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:16,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:16,521 INFO L87 Difference]: Start difference. First operand 5357 states and 7646 transitions. Second operand 3 states.