java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:03:04,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:03:04,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:03:04,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:03:04,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:03:04,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:03:04,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:03:04,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:03:04,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:03:04,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:03:04,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:03:04,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:03:04,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:03:04,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:03:04,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:03:04,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:03:04,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:03:04,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:03:04,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:03:04,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:03:04,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:03:04,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:03:04,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:03:04,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:03:04,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:03:04,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:03:04,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:03:04,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:03:04,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:03:04,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:03:04,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:03:04,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:03:04,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:03:04,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:03:04,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:03:04,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:03:04,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:03:04,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:03:04,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:03:04,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:03:04,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:03:04,236 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-09-08 13:03:04,253 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:03:04,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:03:04,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:03:04,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:03:04,256 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:03:04,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:03:04,256 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:03:04,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:03:04,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:03:04,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:03:04,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:03:04,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:03:04,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:03:04,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:03:04,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:03:04,259 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:03:04,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:03:04,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:03:04,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:03:04,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:03:04,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:03:04,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:03:04,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:03:04,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:03:04,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:03:04,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:03:04,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:03:04,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:03:04,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:03:04,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:03:04,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:03:04,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:03:04,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:03:04,317 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:03:04,318 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:03:04,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c45e9eb55/2e1c01ec0fe04cfb92751421705ba4f4/FLAGce5760ae7 [2019-09-08 13:03:04,951 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:03:04,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:03:04,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c45e9eb55/2e1c01ec0fe04cfb92751421705ba4f4/FLAGce5760ae7 [2019-09-08 13:03:05,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c45e9eb55/2e1c01ec0fe04cfb92751421705ba4f4 [2019-09-08 13:03:05,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:03:05,257 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:03:05,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:03:05,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:03:05,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:03:05,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:03:05" (1/1) ... [2019-09-08 13:03:05,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c34d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:05, skipping insertion in model container [2019-09-08 13:03:05,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:03:05" (1/1) ... [2019-09-08 13:03:05,275 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:03:05,343 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:03:06,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:03:06,078 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:03:06,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:03:06,530 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:03:06,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06 WrapperNode [2019-09-08 13:03:06,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:03:06,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:03:06,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:03:06,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:03:06,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06" (1/1) ... [2019-09-08 13:03:06,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06" (1/1) ... [2019-09-08 13:03:06,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06" (1/1) ... [2019-09-08 13:03:06,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06" (1/1) ... [2019-09-08 13:03:06,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06" (1/1) ... [2019-09-08 13:03:06,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06" (1/1) ... [2019-09-08 13:03:06,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06" (1/1) ... [2019-09-08 13:03:06,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:03:06,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:03:06,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:03:06,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:03:06,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06" (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-09-08 13:03:06,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:03:06,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:03:06,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:03:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:03:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:03:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:03:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:03:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:03:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:03:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:03:06,739 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:03:06,739 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:03:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:03:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:03:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:03:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:03:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:03:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:03:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:03:08,360 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:03:08,361 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:03:08,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:03:08 BoogieIcfgContainer [2019-09-08 13:03:08,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:03:08,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:03:08,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:03:08,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:03:08,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:03:05" (1/3) ... [2019-09-08 13:03:08,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb7ba1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:03:08, skipping insertion in model container [2019-09-08 13:03:08,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:03:06" (2/3) ... [2019-09-08 13:03:08,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb7ba1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:03:08, skipping insertion in model container [2019-09-08 13:03:08,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:03:08" (3/3) ... [2019-09-08 13:03:08,379 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:03:08,391 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:03:08,418 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-08 13:03:08,441 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-08 13:03:08,508 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:03:08,509 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:03:08,509 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:03:08,509 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:03:08,510 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:03:08,510 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:03:08,510 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:03:08,510 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:03:08,511 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:03:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states. [2019-09-08 13:03:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 13:03:08,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:08,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:08,609 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash 257827157, now seen corresponding path program 1 times [2019-09-08 13:03:08,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:08,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:08,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:09,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:09,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:09,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:09,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:09,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:09,350 INFO L87 Difference]: Start difference. First operand 416 states. Second operand 3 states. [2019-09-08 13:03:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:09,580 INFO L93 Difference]: Finished difference Result 759 states and 1331 transitions. [2019-09-08 13:03:09,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:09,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 13:03:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:09,602 INFO L225 Difference]: With dead ends: 759 [2019-09-08 13:03:09,602 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 13:03:09,607 INFO L628 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-09-08 13:03:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 13:03:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2019-09-08 13:03:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-09-08 13:03:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 857 transitions. [2019-09-08 13:03:09,712 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 857 transitions. Word has length 151 [2019-09-08 13:03:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:09,713 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 857 transitions. [2019-09-08 13:03:09,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 857 transitions. [2019-09-08 13:03:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 13:03:09,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:09,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:09,726 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:09,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1201169525, now seen corresponding path program 1 times [2019-09-08 13:03:09,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:09,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:09,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:09,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:09,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:10,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:10,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:10,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:10,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:10,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:10,039 INFO L87 Difference]: Start difference. First operand 588 states and 857 transitions. Second operand 3 states. [2019-09-08 13:03:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:10,209 INFO L93 Difference]: Finished difference Result 1187 states and 1790 transitions. [2019-09-08 13:03:10,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:10,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 13:03:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:10,217 INFO L225 Difference]: With dead ends: 1187 [2019-09-08 13:03:10,218 INFO L226 Difference]: Without dead ends: 964 [2019-09-08 13:03:10,221 INFO L628 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-09-08 13:03:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-09-08 13:03:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2019-09-08 13:03:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-09-08 13:03:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1427 transitions. [2019-09-08 13:03:10,335 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1427 transitions. Word has length 151 [2019-09-08 13:03:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:10,336 INFO L475 AbstractCegarLoop]: Abstraction has 962 states and 1427 transitions. [2019-09-08 13:03:10,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1427 transitions. [2019-09-08 13:03:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 13:03:10,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:10,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:10,340 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1200830901, now seen corresponding path program 1 times [2019-09-08 13:03:10,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:10,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:10,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:10,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:10,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:03:10,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:03:10,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:03:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:03:10,869 INFO L87 Difference]: Start difference. First operand 962 states and 1427 transitions. Second operand 4 states. [2019-09-08 13:03:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:11,049 INFO L93 Difference]: Finished difference Result 2828 states and 4188 transitions. [2019-09-08 13:03:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:03:11,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-08 13:03:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:11,068 INFO L225 Difference]: With dead ends: 2828 [2019-09-08 13:03:11,068 INFO L226 Difference]: Without dead ends: 1879 [2019-09-08 13:03:11,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-09-08 13:03:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1837. [2019-09-08 13:03:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-09-08 13:03:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2717 transitions. [2019-09-08 13:03:11,185 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2717 transitions. Word has length 151 [2019-09-08 13:03:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:11,186 INFO L475 AbstractCegarLoop]: Abstraction has 1837 states and 2717 transitions. [2019-09-08 13:03:11,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:03:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2717 transitions. [2019-09-08 13:03:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 13:03:11,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:11,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:11,191 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:11,192 INFO L82 PathProgramCache]: Analyzing trace with hash -958267271, now seen corresponding path program 1 times [2019-09-08 13:03:11,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:11,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:11,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:11,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:11,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:11,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:11,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:11,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:11,313 INFO L87 Difference]: Start difference. First operand 1837 states and 2717 transitions. Second operand 3 states. [2019-09-08 13:03:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:11,462 INFO L93 Difference]: Finished difference Result 5465 states and 8081 transitions. [2019-09-08 13:03:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:11,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 13:03:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:11,485 INFO L225 Difference]: With dead ends: 5465 [2019-09-08 13:03:11,485 INFO L226 Difference]: Without dead ends: 3660 [2019-09-08 13:03:11,491 INFO L628 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-09-08 13:03:11,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-09-08 13:03:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 1839. [2019-09-08 13:03:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-09-08 13:03:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2719 transitions. [2019-09-08 13:03:11,615 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2719 transitions. Word has length 152 [2019-09-08 13:03:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:11,616 INFO L475 AbstractCegarLoop]: Abstraction has 1839 states and 2719 transitions. [2019-09-08 13:03:11,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2719 transitions. [2019-09-08 13:03:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 13:03:11,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:11,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:11,621 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1744211523, now seen corresponding path program 1 times [2019-09-08 13:03:11,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:11,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:11,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:11,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:11,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:11,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:11,746 INFO L87 Difference]: Start difference. First operand 1839 states and 2719 transitions. Second operand 3 states. [2019-09-08 13:03:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:11,971 INFO L93 Difference]: Finished difference Result 5196 states and 7684 transitions. [2019-09-08 13:03:11,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:11,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 13:03:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:11,995 INFO L225 Difference]: With dead ends: 5196 [2019-09-08 13:03:11,996 INFO L226 Difference]: Without dead ends: 3554 [2019-09-08 13:03:12,004 INFO L628 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-09-08 13:03:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-09-08 13:03:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3512. [2019-09-08 13:03:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2019-09-08 13:03:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5152 transitions. [2019-09-08 13:03:12,295 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5152 transitions. Word has length 153 [2019-09-08 13:03:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:12,295 INFO L475 AbstractCegarLoop]: Abstraction has 3512 states and 5152 transitions. [2019-09-08 13:03:12,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5152 transitions. [2019-09-08 13:03:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 13:03:12,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:12,302 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:12,302 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash 294713414, now seen corresponding path program 1 times [2019-09-08 13:03:12,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:12,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:12,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:12,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:12,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:03:12,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:03:12,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:03:12,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:03:12,532 INFO L87 Difference]: Start difference. First operand 3512 states and 5152 transitions. Second operand 4 states. [2019-09-08 13:03:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:12,744 INFO L93 Difference]: Finished difference Result 6017 states and 8836 transitions. [2019-09-08 13:03:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:03:12,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-08 13:03:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:12,763 INFO L225 Difference]: With dead ends: 6017 [2019-09-08 13:03:12,764 INFO L226 Difference]: Without dead ends: 2690 [2019-09-08 13:03:12,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2019-09-08 13:03:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690. [2019-09-08 13:03:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2019-09-08 13:03:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3933 transitions. [2019-09-08 13:03:12,932 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3933 transitions. Word has length 153 [2019-09-08 13:03:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:12,933 INFO L475 AbstractCegarLoop]: Abstraction has 2690 states and 3933 transitions. [2019-09-08 13:03:12,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:03:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3933 transitions. [2019-09-08 13:03:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 13:03:12,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:12,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:12,939 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:12,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2083946363, now seen corresponding path program 1 times [2019-09-08 13:03:12,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:12,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:12,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:12,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:13,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:13,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:13,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:13,027 INFO L87 Difference]: Start difference. First operand 2690 states and 3933 transitions. Second operand 3 states. [2019-09-08 13:03:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:13,278 INFO L93 Difference]: Finished difference Result 6148 states and 9216 transitions. [2019-09-08 13:03:13,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:13,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-08 13:03:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:13,298 INFO L225 Difference]: With dead ends: 6148 [2019-09-08 13:03:13,298 INFO L226 Difference]: Without dead ends: 3644 [2019-09-08 13:03:13,305 INFO L628 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-09-08 13:03:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2019-09-08 13:03:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3558. [2019-09-08 13:03:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-09-08 13:03:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5350 transitions. [2019-09-08 13:03:13,543 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5350 transitions. Word has length 154 [2019-09-08 13:03:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:13,544 INFO L475 AbstractCegarLoop]: Abstraction has 3558 states and 5350 transitions. [2019-09-08 13:03:13,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5350 transitions. [2019-09-08 13:03:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 13:03:13,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:13,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:13,549 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash -564593784, now seen corresponding path program 1 times [2019-09-08 13:03:13,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:13,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:13,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:13,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:13,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:13,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:13,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:03:13,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:03:13,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:03:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:13,717 INFO L87 Difference]: Start difference. First operand 3558 states and 5350 transitions. Second operand 5 states. [2019-09-08 13:03:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:14,395 INFO L93 Difference]: Finished difference Result 6938 states and 10473 transitions. [2019-09-08 13:03:14,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:03:14,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 13:03:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:14,415 INFO L225 Difference]: With dead ends: 6938 [2019-09-08 13:03:14,415 INFO L226 Difference]: Without dead ends: 3560 [2019-09-08 13:03:14,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:03:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2019-09-08 13:03:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3558. [2019-09-08 13:03:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-09-08 13:03:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5335 transitions. [2019-09-08 13:03:14,624 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5335 transitions. Word has length 157 [2019-09-08 13:03:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:14,625 INFO L475 AbstractCegarLoop]: Abstraction has 3558 states and 5335 transitions. [2019-09-08 13:03:14,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:03:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5335 transitions. [2019-09-08 13:03:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 13:03:14,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:14,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:14,630 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1981028429, now seen corresponding path program 1 times [2019-09-08 13:03:14,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:14,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:14,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:14,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:14,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:14,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:14,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:03:14,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:03:14,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:03:14,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:03:14,873 INFO L87 Difference]: Start difference. First operand 3558 states and 5335 transitions. Second operand 9 states. [2019-09-08 13:03:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:16,715 INFO L93 Difference]: Finished difference Result 16721 states and 25805 transitions. [2019-09-08 13:03:16,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:03:16,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-09-08 13:03:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:16,776 INFO L225 Difference]: With dead ends: 16721 [2019-09-08 13:03:16,777 INFO L226 Difference]: Without dead ends: 13382 [2019-09-08 13:03:16,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:03:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2019-09-08 13:03:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 8886. [2019-09-08 13:03:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8886 states. [2019-09-08 13:03:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 13413 transitions. [2019-09-08 13:03:17,562 INFO L78 Accepts]: Start accepts. Automaton has 8886 states and 13413 transitions. Word has length 157 [2019-09-08 13:03:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:17,562 INFO L475 AbstractCegarLoop]: Abstraction has 8886 states and 13413 transitions. [2019-09-08 13:03:17,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:03:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8886 states and 13413 transitions. [2019-09-08 13:03:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 13:03:17,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:17,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:17,571 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2002866937, now seen corresponding path program 1 times [2019-09-08 13:03:17,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:17,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:17,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:17,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:17,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:03:17,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:03:17,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:03:17,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:03:17,784 INFO L87 Difference]: Start difference. First operand 8886 states and 13413 transitions. Second operand 4 states. [2019-09-08 13:03:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:18,516 INFO L93 Difference]: Finished difference Result 16603 states and 25814 transitions. [2019-09-08 13:03:18,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:03:18,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-08 13:03:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:18,544 INFO L225 Difference]: With dead ends: 16603 [2019-09-08 13:03:18,544 INFO L226 Difference]: Without dead ends: 10662 [2019-09-08 13:03:18,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:03:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10662 states. [2019-09-08 13:03:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10662 to 10660. [2019-09-08 13:03:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10660 states. [2019-09-08 13:03:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10660 states to 10660 states and 16201 transitions. [2019-09-08 13:03:19,258 INFO L78 Accepts]: Start accepts. Automaton has 10660 states and 16201 transitions. Word has length 157 [2019-09-08 13:03:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:19,258 INFO L475 AbstractCegarLoop]: Abstraction has 10660 states and 16201 transitions. [2019-09-08 13:03:19,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:03:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 10660 states and 16201 transitions. [2019-09-08 13:03:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 13:03:19,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:19,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:19,267 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:19,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -286073469, now seen corresponding path program 1 times [2019-09-08 13:03:19,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:19,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:19,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:19,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:19,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:19,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:19,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:03:19,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:03:19,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:03:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:03:19,492 INFO L87 Difference]: Start difference. First operand 10660 states and 16201 transitions. Second operand 4 states. [2019-09-08 13:03:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:20,851 INFO L93 Difference]: Finished difference Result 28048 states and 42570 transitions. [2019-09-08 13:03:20,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:03:20,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-08 13:03:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:20,897 INFO L225 Difference]: With dead ends: 28048 [2019-09-08 13:03:20,897 INFO L226 Difference]: Without dead ends: 17411 [2019-09-08 13:03:20,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17411 states. [2019-09-08 13:03:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17411 to 17377. [2019-09-08 13:03:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2019-09-08 13:03:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 26114 transitions. [2019-09-08 13:03:21,815 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 26114 transitions. Word has length 157 [2019-09-08 13:03:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:21,815 INFO L475 AbstractCegarLoop]: Abstraction has 17377 states and 26114 transitions. [2019-09-08 13:03:21,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:03:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 26114 transitions. [2019-09-08 13:03:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 13:03:21,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:21,828 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:21,829 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:21,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1553675807, now seen corresponding path program 1 times [2019-09-08 13:03:21,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:21,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:21,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:22,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:22,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:22,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:22,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:22,031 INFO L87 Difference]: Start difference. First operand 17377 states and 26114 transitions. Second operand 3 states. [2019-09-08 13:03:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:23,457 INFO L93 Difference]: Finished difference Result 46780 states and 70277 transitions. [2019-09-08 13:03:23,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:23,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 13:03:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:23,535 INFO L225 Difference]: With dead ends: 46780 [2019-09-08 13:03:23,535 INFO L226 Difference]: Without dead ends: 29799 [2019-09-08 13:03:23,572 INFO L628 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-09-08 13:03:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29799 states. [2019-09-08 13:03:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29799 to 29769. [2019-09-08 13:03:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29769 states. [2019-09-08 13:03:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29769 states to 29769 states and 44199 transitions. [2019-09-08 13:03:25,533 INFO L78 Accepts]: Start accepts. Automaton has 29769 states and 44199 transitions. Word has length 159 [2019-09-08 13:03:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:25,534 INFO L475 AbstractCegarLoop]: Abstraction has 29769 states and 44199 transitions. [2019-09-08 13:03:25,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 29769 states and 44199 transitions. [2019-09-08 13:03:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 13:03:25,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:25,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:25,559 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2132469410, now seen corresponding path program 1 times [2019-09-08 13:03:25,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:25,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:25,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:25,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:25,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:03:25,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:03:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:03:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:03:25,702 INFO L87 Difference]: Start difference. First operand 29769 states and 44199 transitions. Second operand 4 states. [2019-09-08 13:03:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:26,732 INFO L93 Difference]: Finished difference Result 50148 states and 74433 transitions. [2019-09-08 13:03:26,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:03:26,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-08 13:03:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:26,793 INFO L225 Difference]: With dead ends: 50148 [2019-09-08 13:03:26,794 INFO L226 Difference]: Without dead ends: 27144 [2019-09-08 13:03:26,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27144 states. [2019-09-08 13:03:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27144 to 27144. [2019-09-08 13:03:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27144 states. [2019-09-08 13:03:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27144 states to 27144 states and 40307 transitions. [2019-09-08 13:03:28,231 INFO L78 Accepts]: Start accepts. Automaton has 27144 states and 40307 transitions. Word has length 159 [2019-09-08 13:03:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:28,232 INFO L475 AbstractCegarLoop]: Abstraction has 27144 states and 40307 transitions. [2019-09-08 13:03:28,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:03:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 27144 states and 40307 transitions. [2019-09-08 13:03:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 13:03:28,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:28,245 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:28,246 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:28,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash 642084846, now seen corresponding path program 1 times [2019-09-08 13:03:28,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:28,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:28,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:28,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:28,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:28,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:28,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:28,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:28,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:28,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:28,330 INFO L87 Difference]: Start difference. First operand 27144 states and 40307 transitions. Second operand 3 states. [2019-09-08 13:03:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:30,840 INFO L93 Difference]: Finished difference Result 72226 states and 108579 transitions. [2019-09-08 13:03:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:30,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-08 13:03:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:30,922 INFO L225 Difference]: With dead ends: 72226 [2019-09-08 13:03:30,922 INFO L226 Difference]: Without dead ends: 45418 [2019-09-08 13:03:30,966 INFO L628 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-09-08 13:03:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45418 states. [2019-09-08 13:03:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45418 to 41012. [2019-09-08 13:03:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41012 states. [2019-09-08 13:03:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41012 states to 41012 states and 62306 transitions. [2019-09-08 13:03:32,800 INFO L78 Accepts]: Start accepts. Automaton has 41012 states and 62306 transitions. Word has length 163 [2019-09-08 13:03:32,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:32,801 INFO L475 AbstractCegarLoop]: Abstraction has 41012 states and 62306 transitions. [2019-09-08 13:03:32,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 41012 states and 62306 transitions. [2019-09-08 13:03:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 13:03:32,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:32,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:32,813 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1347636143, now seen corresponding path program 1 times [2019-09-08 13:03:32,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:32,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:32,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:33,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:33,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:03:33,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:03:33,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:03:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:03:33,024 INFO L87 Difference]: Start difference. First operand 41012 states and 62306 transitions. Second operand 4 states. [2019-09-08 13:03:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:37,168 INFO L93 Difference]: Finished difference Result 115881 states and 175779 transitions. [2019-09-08 13:03:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:03:37,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-08 13:03:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:37,271 INFO L225 Difference]: With dead ends: 115881 [2019-09-08 13:03:37,272 INFO L226 Difference]: Without dead ends: 74912 [2019-09-08 13:03:37,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74912 states. [2019-09-08 13:03:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74912 to 74854. [2019-09-08 13:03:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74854 states. [2019-09-08 13:03:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74854 states to 74854 states and 112645 transitions. [2019-09-08 13:03:40,860 INFO L78 Accepts]: Start accepts. Automaton has 74854 states and 112645 transitions. Word has length 163 [2019-09-08 13:03:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:40,861 INFO L475 AbstractCegarLoop]: Abstraction has 74854 states and 112645 transitions. [2019-09-08 13:03:40,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:03:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 74854 states and 112645 transitions. [2019-09-08 13:03:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 13:03:40,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:40,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:40,878 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:40,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:40,878 INFO L82 PathProgramCache]: Analyzing trace with hash -603572205, now seen corresponding path program 1 times [2019-09-08 13:03:40,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:40,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:40,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:40,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-09-08 13:03:40,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:40,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:40,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:40,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:40,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:40,947 INFO L87 Difference]: Start difference. First operand 74854 states and 112645 transitions. Second operand 3 states. [2019-09-08 13:03:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:48,277 INFO L93 Difference]: Finished difference Result 224362 states and 337680 transitions. [2019-09-08 13:03:48,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:48,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-08 13:03:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:48,480 INFO L225 Difference]: With dead ends: 224362 [2019-09-08 13:03:48,481 INFO L226 Difference]: Without dead ends: 149617 [2019-09-08 13:03:48,542 INFO L628 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-09-08 13:03:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149617 states. [2019-09-08 13:03:52,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149617 to 74860. [2019-09-08 13:03:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74860 states. [2019-09-08 13:03:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74860 states to 74860 states and 112651 transitions. [2019-09-08 13:03:52,710 INFO L78 Accepts]: Start accepts. Automaton has 74860 states and 112651 transitions. Word has length 164 [2019-09-08 13:03:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:52,710 INFO L475 AbstractCegarLoop]: Abstraction has 74860 states and 112651 transitions. [2019-09-08 13:03:52,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 74860 states and 112651 transitions. [2019-09-08 13:03:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 13:03:52,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:52,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:52,727 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:52,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:52,727 INFO L82 PathProgramCache]: Analyzing trace with hash -115889413, now seen corresponding path program 1 times [2019-09-08 13:03:52,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:52,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:52,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:52,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:52,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:52,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:52,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:52,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:52,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:52,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:52,857 INFO L87 Difference]: Start difference. First operand 74860 states and 112651 transitions. Second operand 3 states. [2019-09-08 13:03:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:59,908 INFO L93 Difference]: Finished difference Result 199304 states and 299050 transitions. [2019-09-08 13:03:59,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:59,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 13:03:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:00,101 INFO L225 Difference]: With dead ends: 199304 [2019-09-08 13:04:00,102 INFO L226 Difference]: Without dead ends: 125194 [2019-09-08 13:04:00,169 INFO L628 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-09-08 13:04:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125194 states. [2019-09-08 13:04:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125194 to 125136. [2019-09-08 13:04:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125136 states. [2019-09-08 13:04:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125136 states to 125136 states and 185628 transitions. [2019-09-08 13:04:08,815 INFO L78 Accepts]: Start accepts. Automaton has 125136 states and 185628 transitions. Word has length 165 [2019-09-08 13:04:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:08,815 INFO L475 AbstractCegarLoop]: Abstraction has 125136 states and 185628 transitions. [2019-09-08 13:04:08,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 125136 states and 185628 transitions. [2019-09-08 13:04:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 13:04:09,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:09,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:09,124 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:09,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2071290366, now seen corresponding path program 1 times [2019-09-08 13:04:09,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:09,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:09,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:09,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:09,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:09,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:09,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:09,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:09,276 INFO L87 Difference]: Start difference. First operand 125136 states and 185628 transitions. Second operand 4 states. [2019-09-08 13:04:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:17,387 INFO L93 Difference]: Finished difference Result 237191 states and 352256 transitions. [2019-09-08 13:04:17,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:17,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-08 13:04:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:17,561 INFO L225 Difference]: With dead ends: 237191 [2019-09-08 13:04:17,561 INFO L226 Difference]: Without dead ends: 112729 [2019-09-08 13:04:17,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112729 states. [2019-09-08 13:04:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112729 to 112729. [2019-09-08 13:04:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112729 states. [2019-09-08 13:04:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112729 states to 112729 states and 167393 transitions. [2019-09-08 13:04:23,580 INFO L78 Accepts]: Start accepts. Automaton has 112729 states and 167393 transitions. Word has length 165 [2019-09-08 13:04:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:23,580 INFO L475 AbstractCegarLoop]: Abstraction has 112729 states and 167393 transitions. [2019-09-08 13:04:23,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 112729 states and 167393 transitions. [2019-09-08 13:04:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 13:04:23,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:23,599 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:23,599 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1478414802, now seen corresponding path program 1 times [2019-09-08 13:04:23,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:23,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:23,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:23,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:23,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:23,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:23,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:23,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:23,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:23,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:23,690 INFO L87 Difference]: Start difference. First operand 112729 states and 167393 transitions. Second operand 3 states. [2019-09-08 13:04:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:36,408 INFO L93 Difference]: Finished difference Result 287648 states and 430049 transitions. [2019-09-08 13:04:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:36,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 13:04:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:36,736 INFO L225 Difference]: With dead ends: 287648 [2019-09-08 13:04:36,736 INFO L226 Difference]: Without dead ends: 189855 [2019-09-08 13:04:36,826 INFO L628 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-09-08 13:04:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189855 states. [2019-09-08 13:04:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189855 to 175437. [2019-09-08 13:04:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175437 states. [2019-09-08 13:04:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175437 states to 175437 states and 263484 transitions. [2019-09-08 13:04:46,823 INFO L78 Accepts]: Start accepts. Automaton has 175437 states and 263484 transitions. Word has length 169 [2019-09-08 13:04:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:46,824 INFO L475 AbstractCegarLoop]: Abstraction has 175437 states and 263484 transitions. [2019-09-08 13:04:46,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 175437 states and 263484 transitions. [2019-09-08 13:04:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:04:46,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:46,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:46,848 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:46,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:46,848 INFO L82 PathProgramCache]: Analyzing trace with hash 525237271, now seen corresponding path program 1 times [2019-09-08 13:04:46,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:46,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:46,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:46,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:46,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:46,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:46,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:46,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:46,964 INFO L87 Difference]: Start difference. First operand 175437 states and 263484 transitions. Second operand 4 states. [2019-09-08 13:05:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:02,774 INFO L93 Difference]: Finished difference Result 299503 states and 450830 transitions. [2019-09-08 13:05:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:02,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-08 13:05:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:03,202 INFO L225 Difference]: With dead ends: 299503 [2019-09-08 13:05:03,203 INFO L226 Difference]: Without dead ends: 237146 [2019-09-08 13:05:03,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237146 states. [2019-09-08 13:05:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237146 to 175333. [2019-09-08 13:05:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175333 states. [2019-09-08 13:05:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175333 states to 175333 states and 263232 transitions. [2019-09-08 13:05:14,387 INFO L78 Accepts]: Start accepts. Automaton has 175333 states and 263232 transitions. Word has length 170 [2019-09-08 13:05:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:14,387 INFO L475 AbstractCegarLoop]: Abstraction has 175333 states and 263232 transitions. [2019-09-08 13:05:14,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 175333 states and 263232 transitions. [2019-09-08 13:05:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:05:14,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:14,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:14,403 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash -70719432, now seen corresponding path program 1 times [2019-09-08 13:05:14,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:14,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:14,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:14,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:17,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:17,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:05:17,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:05:17,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:05:17,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:05:17,474 INFO L87 Difference]: Start difference. First operand 175333 states and 263232 transitions. Second operand 8 states. [2019-09-08 13:05:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:51,550 INFO L93 Difference]: Finished difference Result 634605 states and 952560 transitions. [2019-09-08 13:05:51,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:05:51,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2019-09-08 13:05:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:52,443 INFO L225 Difference]: With dead ends: 634605 [2019-09-08 13:05:52,444 INFO L226 Difference]: Without dead ends: 474221 [2019-09-08 13:05:52,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:05:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474221 states. [2019-09-08 13:06:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474221 to 206617. [2019-09-08 13:06:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206617 states. [2019-09-08 13:06:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206617 states to 206617 states and 310664 transitions. [2019-09-08 13:06:09,318 INFO L78 Accepts]: Start accepts. Automaton has 206617 states and 310664 transitions. Word has length 170 [2019-09-08 13:06:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:09,319 INFO L475 AbstractCegarLoop]: Abstraction has 206617 states and 310664 transitions. [2019-09-08 13:06:09,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:06:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 206617 states and 310664 transitions. [2019-09-08 13:06:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:06:09,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:09,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:09,336 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:09,336 INFO L82 PathProgramCache]: Analyzing trace with hash -831791091, now seen corresponding path program 1 times [2019-09-08 13:06:09,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:09,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:09,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:09,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:09,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:06:09,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:09,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:06:09,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:06:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:06:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:06:09,542 INFO L87 Difference]: Start difference. First operand 206617 states and 310664 transitions. Second operand 8 states. [2019-09-08 13:06:12,640 WARN L188 SmtUtils]: Spent 3.01 s on a formula simplification that was a NOOP. DAG size: 13 [2019-09-08 13:06:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:58,684 INFO L93 Difference]: Finished difference Result 650240 states and 968605 transitions. [2019-09-08 13:06:58,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:06:58,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2019-09-08 13:06:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:59,728 INFO L225 Difference]: With dead ends: 650240 [2019-09-08 13:06:59,728 INFO L226 Difference]: Without dead ends: 579591 [2019-09-08 13:06:59,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:07:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579591 states. [2019-09-08 13:07:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579591 to 167465. [2019-09-08 13:07:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167465 states. [2019-09-08 13:07:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167465 states to 167465 states and 249100 transitions. [2019-09-08 13:07:24,446 INFO L78 Accepts]: Start accepts. Automaton has 167465 states and 249100 transitions. Word has length 170 [2019-09-08 13:07:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:24,446 INFO L475 AbstractCegarLoop]: Abstraction has 167465 states and 249100 transitions. [2019-09-08 13:07:24,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:07:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 167465 states and 249100 transitions. [2019-09-08 13:07:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:07:24,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:24,462 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:24,463 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -833569283, now seen corresponding path program 1 times [2019-09-08 13:07:24,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:24,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:24,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:24,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:24,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:24,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:07:24,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:07:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:07:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:07:24,656 INFO L87 Difference]: Start difference. First operand 167465 states and 249100 transitions. Second operand 8 states. [2019-09-08 13:08:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:16,705 INFO L93 Difference]: Finished difference Result 623855 states and 924833 transitions. [2019-09-08 13:08:16,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:08:16,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2019-09-08 13:08:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:17,615 INFO L225 Difference]: With dead ends: 623855 [2019-09-08 13:08:17,615 INFO L226 Difference]: Without dead ends: 463421 [2019-09-08 13:08:17,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:08:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463421 states. [2019-09-08 13:08:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463421 to 250105. [2019-09-08 13:08:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250105 states. [2019-09-08 13:08:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250105 states to 250105 states and 366523 transitions. [2019-09-08 13:08:50,923 INFO L78 Accepts]: Start accepts. Automaton has 250105 states and 366523 transitions. Word has length 170 [2019-09-08 13:08:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:50,923 INFO L475 AbstractCegarLoop]: Abstraction has 250105 states and 366523 transitions. [2019-09-08 13:08:50,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:08:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 250105 states and 366523 transitions. [2019-09-08 13:08:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:08:50,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:50,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:50,939 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash -650317869, now seen corresponding path program 1 times [2019-09-08 13:08:50,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:50,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:50,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:50,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:50,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:08:51,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:51,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:51,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:51,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:51,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:51,137 INFO L87 Difference]: Start difference. First operand 250105 states and 366523 transitions. Second operand 4 states. [2019-09-08 13:09:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:21,478 INFO L93 Difference]: Finished difference Result 482683 states and 707336 transitions. [2019-09-08 13:09:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:21,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-08 13:09:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:21,905 INFO L225 Difference]: With dead ends: 482683 [2019-09-08 13:09:21,906 INFO L226 Difference]: Without dead ends: 232891 [2019-09-08 13:09:22,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:09:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232891 states. [2019-09-08 13:09:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232891 to 232821. [2019-09-08 13:09:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232821 states. [2019-09-08 13:09:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232821 states to 232821 states and 341089 transitions. [2019-09-08 13:09:47,452 INFO L78 Accepts]: Start accepts. Automaton has 232821 states and 341089 transitions. Word has length 170 [2019-09-08 13:09:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:47,453 INFO L475 AbstractCegarLoop]: Abstraction has 232821 states and 341089 transitions. [2019-09-08 13:09:47,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 232821 states and 341089 transitions. [2019-09-08 13:09:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 13:09:47,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:47,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:09:47,467 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:47,467 INFO L82 PathProgramCache]: Analyzing trace with hash -260368357, now seen corresponding path program 1 times [2019-09-08 13:09:47,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:47,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:47,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:47,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:47,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:47,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:47,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:47,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:47,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:47,705 INFO L87 Difference]: Start difference. First operand 232821 states and 341089 transitions. Second operand 4 states. [2019-09-08 13:10:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:18,775 INFO L93 Difference]: Finished difference Result 465703 states and 682233 transitions. [2019-09-08 13:10:18,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:18,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-08 13:10:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:19,187 INFO L225 Difference]: With dead ends: 465703 [2019-09-08 13:10:19,187 INFO L226 Difference]: Without dead ends: 233041 [2019-09-08 13:10:19,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:10:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233041 states. [2019-09-08 13:10:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233041 to 232923. [2019-09-08 13:10:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232923 states. [2019-09-08 13:10:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232923 states to 232923 states and 341189 transitions. [2019-09-08 13:10:44,783 INFO L78 Accepts]: Start accepts. Automaton has 232923 states and 341189 transitions. Word has length 172 [2019-09-08 13:10:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:44,784 INFO L475 AbstractCegarLoop]: Abstraction has 232923 states and 341189 transitions. [2019-09-08 13:10:44,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 232923 states and 341189 transitions. [2019-09-08 13:10:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:10:44,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:44,799 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:10:44,800 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:44,800 INFO L82 PathProgramCache]: Analyzing trace with hash -686513461, now seen corresponding path program 1 times [2019-09-08 13:10:44,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:44,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:44,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:44,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:10:44,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:44,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:44,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:44,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:44,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:44,876 INFO L87 Difference]: Start difference. First operand 232923 states and 341189 transitions. Second operand 3 states. [2019-09-08 13:11:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:40,078 INFO L93 Difference]: Finished difference Result 650579 states and 953002 transitions. [2019-09-08 13:11:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:11:40,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 13:11:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:40,922 INFO L225 Difference]: With dead ends: 650579 [2019-09-08 13:11:40,923 INFO L226 Difference]: Without dead ends: 465635 [2019-09-08 13:11:41,144 INFO L628 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-09-08 13:11:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465635 states. [2019-09-08 13:12:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465635 to 232933. [2019-09-08 13:12:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232933 states. [2019-09-08 13:12:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232933 states to 232933 states and 341199 transitions. [2019-09-08 13:12:16,000 INFO L78 Accepts]: Start accepts. Automaton has 232933 states and 341199 transitions. Word has length 173 [2019-09-08 13:12:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:16,000 INFO L475 AbstractCegarLoop]: Abstraction has 232933 states and 341199 transitions. [2019-09-08 13:12:16,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:12:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 232933 states and 341199 transitions. [2019-09-08 13:12:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 13:12:16,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:16,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:12:16,015 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1907638940, now seen corresponding path program 1 times [2019-09-08 13:12:16,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:16,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:12:16,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:16,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:12:16,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:12:16,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:12:16,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:12:16,159 INFO L87 Difference]: Start difference. First operand 232933 states and 341199 transitions. Second operand 4 states. [2019-09-08 13:12:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:43,048 INFO L93 Difference]: Finished difference Result 418312 states and 612537 transitions. [2019-09-08 13:12:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:12:43,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-08 13:12:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:43,523 INFO L225 Difference]: With dead ends: 418312 [2019-09-08 13:12:43,524 INFO L226 Difference]: Without dead ends: 232923 [2019-09-08 13:12:43,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:12:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232923 states. [2019-09-08 13:13:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232923 to 232923. [2019-09-08 13:13:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232923 states. [2019-09-08 13:13:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232923 states to 232923 states and 341184 transitions. [2019-09-08 13:13:16,610 INFO L78 Accepts]: Start accepts. Automaton has 232923 states and 341184 transitions. Word has length 174 [2019-09-08 13:13:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:16,610 INFO L475 AbstractCegarLoop]: Abstraction has 232923 states and 341184 transitions. [2019-09-08 13:13:16,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:13:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 232923 states and 341184 transitions. [2019-09-08 13:13:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 13:13:16,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:16,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:13:16,624 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:16,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1319059861, now seen corresponding path program 1 times [2019-09-08 13:13:16,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:16,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:16,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:16,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:16,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:16,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-09-08 13:13:16,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:13:16,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:13:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:13:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:13:16,782 INFO L87 Difference]: Start difference. First operand 232923 states and 341184 transitions. Second operand 4 states. [2019-09-08 13:13:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:13:42,344 INFO L93 Difference]: Finished difference Result 444255 states and 650523 transitions. [2019-09-08 13:13:42,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:13:42,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-08 13:13:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:42,710 INFO L225 Difference]: With dead ends: 444255 [2019-09-08 13:13:42,710 INFO L226 Difference]: Without dead ends: 211600 [2019-09-08 13:13:42,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:13:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211600 states. [2019-09-08 13:14:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211600 to 211387. [2019-09-08 13:14:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211387 states. [2019-09-08 13:14:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211387 states to 211387 states and 309393 transitions. [2019-09-08 13:14:13,042 INFO L78 Accepts]: Start accepts. Automaton has 211387 states and 309393 transitions. Word has length 174 [2019-09-08 13:14:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:13,043 INFO L475 AbstractCegarLoop]: Abstraction has 211387 states and 309393 transitions. [2019-09-08 13:14:13,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:14:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 211387 states and 309393 transitions. [2019-09-08 13:14:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 13:14:13,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:13,055 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 13:14:13,055 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash -444041038, now seen corresponding path program 1 times [2019-09-08 13:14:13,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:13,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:13,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:13,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:13,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:13,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:13,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:13,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:13,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:13,142 INFO L87 Difference]: Start difference. First operand 211387 states and 309393 transitions. Second operand 4 states. [2019-09-08 13:14:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:58,314 INFO L93 Difference]: Finished difference Result 577859 states and 852720 transitions. [2019-09-08 13:14:58,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:14:58,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-08 13:14:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:59,034 INFO L225 Difference]: With dead ends: 577859 [2019-09-08 13:14:59,034 INFO L226 Difference]: Without dead ends: 378282 [2019-09-08 13:14:59,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:14:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378282 states.