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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 15:09:34,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 15:09:34,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 15:09:34,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 15:09:34,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 15:09:34,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 15:09:34,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 15:09:34,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 15:09:34,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 15:09:34,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 15:09:34,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 15:09:34,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 15:09:34,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 15:09:34,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 15:09:34,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 15:09:34,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 15:09:34,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 15:09:34,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 15:09:34,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 15:09:34,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 15:09:34,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 15:09:34,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 15:09:34,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 15:09:34,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 15:09:34,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 15:09:34,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 15:09:34,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 15:09:34,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 15:09:34,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 15:09:34,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 15:09:34,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 15:09:34,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 15:09:34,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 15:09:34,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 15:09:34,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 15:09:34,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 15:09:34,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 15:09:34,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 15:09:34,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 15:09:34,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 15:09:34,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 15:09:34,390 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-10-02 15:09:34,405 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 15:09:34,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 15:09:34,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 15:09:34,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 15:09:34,407 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 15:09:34,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 15:09:34,407 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 15:09:34,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 15:09:34,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 15:09:34,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 15:09:34,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 15:09:34,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 15:09:34,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 15:09:34,409 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 15:09:34,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 15:09:34,409 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 15:09:34,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 15:09:34,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 15:09:34,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 15:09:34,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 15:09:34,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 15:09:34,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 15:09:34,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 15:09:34,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 15:09:34,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 15:09:34,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 15:09:34,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 15:09:34,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 15:09:34,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 15:09:34,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 15:09:34,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 15:09:34,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 15:09:34,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 15:09:34,457 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 15:09:34,458 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+nlh-reducer.c [2019-10-02 15:09:34,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95c455c0c/7278f887597f47fa9d06899cbe96083d/FLAGaabfa47c0 [2019-10-02 15:09:35,062 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 15:09:35,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-02 15:09:35,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95c455c0c/7278f887597f47fa9d06899cbe96083d/FLAGaabfa47c0 [2019-10-02 15:09:35,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95c455c0c/7278f887597f47fa9d06899cbe96083d [2019-10-02 15:09:35,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 15:09:35,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 15:09:35,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 15:09:35,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 15:09:35,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 15:09:35,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:09:35" (1/1) ... [2019-10-02 15:09:35,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc441a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:35, skipping insertion in model container [2019-10-02 15:09:35,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:09:35" (1/1) ... [2019-10-02 15:09:35,376 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 15:09:35,454 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 15:09:36,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:09:36,043 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 15:09:36,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:09:36,249 INFO L192 MainTranslator]: Completed translation [2019-10-02 15:09:36,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36 WrapperNode [2019-10-02 15:09:36,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 15:09:36,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 15:09:36,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 15:09:36,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 15:09:36,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 15:09:36,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 15:09:36,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 15:09:36,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 15:09:36,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (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-10-02 15:09:36,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 15:09:36,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 15:09:36,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 15:09:36,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 15:09:36,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 15:09:36,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 15:09:36,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 15:09:36,438 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 15:09:36,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 15:09:36,438 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 15:09:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 15:09:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 15:09:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 15:09:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 15:09:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 15:09:36,441 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 15:09:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 15:09:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 15:09:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 15:09:37,820 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 15:09:37,821 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 15:09:37,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:09:37 BoogieIcfgContainer [2019-10-02 15:09:37,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 15:09:37,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 15:09:37,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 15:09:37,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 15:09:37,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 03:09:35" (1/3) ... [2019-10-02 15:09:37,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461a2c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:09:37, skipping insertion in model container [2019-10-02 15:09:37,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (2/3) ... [2019-10-02 15:09:37,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461a2c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:09:37, skipping insertion in model container [2019-10-02 15:09:37,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:09:37" (3/3) ... [2019-10-02 15:09:37,832 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-02 15:09:37,840 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 15:09:37,846 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 15:09:37,862 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 15:09:37,897 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 15:09:37,898 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 15:09:37,898 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 15:09:37,898 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 15:09:37,898 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 15:09:37,898 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 15:09:37,898 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 15:09:37,898 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 15:09:37,899 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 15:09:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-10-02 15:09:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 15:09:37,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:37,943 INFO L411 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] [2019-10-02 15:09:37,945 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1155837260, now seen corresponding path program 1 times [2019-10-02 15:09:37,952 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:37,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:38,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:38,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:38,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:38,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:38,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:38,665 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 3 states. [2019-10-02 15:09:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:38,906 INFO L93 Difference]: Finished difference Result 647 states and 1119 transitions. [2019-10-02 15:09:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:38,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-02 15:09:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:38,944 INFO L225 Difference]: With dead ends: 647 [2019-10-02 15:09:38,944 INFO L226 Difference]: Without dead ends: 527 [2019-10-02 15:09:38,951 INFO L640 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-10-02 15:09:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-02 15:09:39,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2019-10-02 15:09:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-10-02 15:09:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 780 transitions. [2019-10-02 15:09:39,048 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 780 transitions. Word has length 156 [2019-10-02 15:09:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:39,049 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 780 transitions. [2019-10-02 15:09:39,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 780 transitions. [2019-10-02 15:09:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 15:09:39,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:39,055 INFO L411 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] [2019-10-02 15:09:39,056 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:39,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1353690447, now seen corresponding path program 1 times [2019-10-02 15:09:39,056 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:39,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:39,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:39,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:39,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:39,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:39,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:09:39,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:09:39,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:09:39,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:09:39,482 INFO L87 Difference]: Start difference. First operand 525 states and 780 transitions. Second operand 4 states. [2019-10-02 15:09:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:39,606 INFO L93 Difference]: Finished difference Result 1532 states and 2273 transitions. [2019-10-02 15:09:39,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:39,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-02 15:09:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:39,614 INFO L225 Difference]: With dead ends: 1532 [2019-10-02 15:09:39,615 INFO L226 Difference]: Without dead ends: 1020 [2019-10-02 15:09:39,621 INFO L640 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-10-02 15:09:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-10-02 15:09:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1018. [2019-10-02 15:09:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-10-02 15:09:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1501 transitions. [2019-10-02 15:09:39,704 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1501 transitions. Word has length 156 [2019-10-02 15:09:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:39,707 INFO L475 AbstractCegarLoop]: Abstraction has 1018 states and 1501 transitions. [2019-10-02 15:09:39,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1501 transitions. [2019-10-02 15:09:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 15:09:39,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:39,716 INFO L411 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-10-02 15:09:39,716 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:39,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1552789903, now seen corresponding path program 1 times [2019-10-02 15:09:39,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:39,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:39,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:39,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:39,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:39,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:39,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:39,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:39,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:39,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:39,907 INFO L87 Difference]: Start difference. First operand 1018 states and 1501 transitions. Second operand 3 states. [2019-10-02 15:09:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:40,019 INFO L93 Difference]: Finished difference Result 3008 states and 4433 transitions. [2019-10-02 15:09:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:40,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-02 15:09:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:40,040 INFO L225 Difference]: With dead ends: 3008 [2019-10-02 15:09:40,040 INFO L226 Difference]: Without dead ends: 2022 [2019-10-02 15:09:40,044 INFO L640 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-10-02 15:09:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2019-10-02 15:09:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1020. [2019-10-02 15:09:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-02 15:09:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1503 transitions. [2019-10-02 15:09:40,150 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1503 transitions. Word has length 157 [2019-10-02 15:09:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:40,150 INFO L475 AbstractCegarLoop]: Abstraction has 1020 states and 1503 transitions. [2019-10-02 15:09:40,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1503 transitions. [2019-10-02 15:09:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 15:09:40,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:40,155 INFO L411 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] [2019-10-02 15:09:40,155 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1516867775, now seen corresponding path program 1 times [2019-10-02 15:09:40,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:40,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:40,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:40,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:40,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:40,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:40,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:40,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:40,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:40,344 INFO L87 Difference]: Start difference. First operand 1020 states and 1503 transitions. Second operand 3 states. [2019-10-02 15:09:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:40,478 INFO L93 Difference]: Finished difference Result 2789 states and 4120 transitions. [2019-10-02 15:09:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:40,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-02 15:09:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:40,490 INFO L225 Difference]: With dead ends: 2789 [2019-10-02 15:09:40,490 INFO L226 Difference]: Without dead ends: 1966 [2019-10-02 15:09:40,493 INFO L640 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-10-02 15:09:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-10-02 15:09:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1964. [2019-10-02 15:09:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-10-02 15:09:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2867 transitions. [2019-10-02 15:09:40,621 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2867 transitions. Word has length 158 [2019-10-02 15:09:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:40,624 INFO L475 AbstractCegarLoop]: Abstraction has 1964 states and 2867 transitions. [2019-10-02 15:09:40,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2867 transitions. [2019-10-02 15:09:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 15:09:40,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:40,629 INFO L411 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] [2019-10-02 15:09:40,629 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2015367012, now seen corresponding path program 1 times [2019-10-02 15:09:40,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:40,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:40,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:40,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:40,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:09:40,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:09:40,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:09:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:09:40,874 INFO L87 Difference]: Start difference. First operand 1964 states and 2867 transitions. Second operand 4 states. [2019-10-02 15:09:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:40,986 INFO L93 Difference]: Finished difference Result 3278 states and 4800 transitions. [2019-10-02 15:09:40,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:40,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-02 15:09:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:40,998 INFO L225 Difference]: With dead ends: 3278 [2019-10-02 15:09:40,998 INFO L226 Difference]: Without dead ends: 1499 [2019-10-02 15:09:41,003 INFO L640 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-10-02 15:09:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-10-02 15:09:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2019-10-02 15:09:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-10-02 15:09:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2182 transitions. [2019-10-02 15:09:41,112 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2182 transitions. Word has length 158 [2019-10-02 15:09:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:41,113 INFO L475 AbstractCegarLoop]: Abstraction has 1499 states and 2182 transitions. [2019-10-02 15:09:41,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2182 transitions. [2019-10-02 15:09:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 15:09:41,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:41,117 INFO L411 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-10-02 15:09:41,117 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash -528962491, now seen corresponding path program 1 times [2019-10-02 15:09:41,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:41,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:41,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:41,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:41,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:41,217 INFO L87 Difference]: Start difference. First operand 1499 states and 2182 transitions. Second operand 3 states. [2019-10-02 15:09:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:41,358 INFO L93 Difference]: Finished difference Result 3290 states and 4921 transitions. [2019-10-02 15:09:41,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:41,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 15:09:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:41,370 INFO L225 Difference]: With dead ends: 3290 [2019-10-02 15:09:41,371 INFO L226 Difference]: Without dead ends: 1977 [2019-10-02 15:09:41,377 INFO L640 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-10-02 15:09:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-10-02 15:09:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1933. [2019-10-02 15:09:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2019-10-02 15:09:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2888 transitions. [2019-10-02 15:09:41,532 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2888 transitions. Word has length 159 [2019-10-02 15:09:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:41,533 INFO L475 AbstractCegarLoop]: Abstraction has 1933 states and 2888 transitions. [2019-10-02 15:09:41,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2888 transitions. [2019-10-02 15:09:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 15:09:41,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:41,538 INFO L411 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] [2019-10-02 15:09:41,538 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:41,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1484207381, now seen corresponding path program 1 times [2019-10-02 15:09:41,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:41,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:41,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:41,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:41,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:41,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:41,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:41,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:41,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:41,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:41,646 INFO L87 Difference]: Start difference. First operand 1933 states and 2888 transitions. Second operand 3 states. [2019-10-02 15:09:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:41,836 INFO L93 Difference]: Finished difference Result 4690 states and 7155 transitions. [2019-10-02 15:09:41,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:41,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-02 15:09:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:41,852 INFO L225 Difference]: With dead ends: 4690 [2019-10-02 15:09:41,852 INFO L226 Difference]: Without dead ends: 3027 [2019-10-02 15:09:41,857 INFO L640 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-10-02 15:09:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2019-10-02 15:09:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2711. [2019-10-02 15:09:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2019-10-02 15:09:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4151 transitions. [2019-10-02 15:09:42,025 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4151 transitions. Word has length 162 [2019-10-02 15:09:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:42,025 INFO L475 AbstractCegarLoop]: Abstraction has 2711 states and 4151 transitions. [2019-10-02 15:09:42,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4151 transitions. [2019-10-02 15:09:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 15:09:42,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:42,029 INFO L411 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] [2019-10-02 15:09:42,030 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:42,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2071220188, now seen corresponding path program 1 times [2019-10-02 15:09:42,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:42,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:42,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:42,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:42,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:42,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:42,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:09:42,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:09:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:09:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:09:42,427 INFO L87 Difference]: Start difference. First operand 2711 states and 4151 transitions. Second operand 9 states. [2019-10-02 15:09:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:43,470 INFO L93 Difference]: Finished difference Result 9554 states and 14922 transitions. [2019-10-02 15:09:43,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 15:09:43,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-10-02 15:09:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:43,508 INFO L225 Difference]: With dead ends: 9554 [2019-10-02 15:09:43,509 INFO L226 Difference]: Without dead ends: 7023 [2019-10-02 15:09:43,521 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 15:09:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2019-10-02 15:09:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 5089. [2019-10-02 15:09:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5089 states. [2019-10-02 15:09:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5089 states to 5089 states and 7829 transitions. [2019-10-02 15:09:43,933 INFO L78 Accepts]: Start accepts. Automaton has 5089 states and 7829 transitions. Word has length 162 [2019-10-02 15:09:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:43,933 INFO L475 AbstractCegarLoop]: Abstraction has 5089 states and 7829 transitions. [2019-10-02 15:09:43,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:09:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5089 states and 7829 transitions. [2019-10-02 15:09:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 15:09:43,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:43,942 INFO L411 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] [2019-10-02 15:09:43,942 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash 430958199, now seen corresponding path program 1 times [2019-10-02 15:09:43,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:43,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:43,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:43,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:43,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:44,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:44,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:09:44,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:09:44,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:09:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:09:44,117 INFO L87 Difference]: Start difference. First operand 5089 states and 7829 transitions. Second operand 4 states. [2019-10-02 15:09:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:44,684 INFO L93 Difference]: Finished difference Result 13547 states and 21235 transitions. [2019-10-02 15:09:44,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:44,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-02 15:09:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:44,742 INFO L225 Difference]: With dead ends: 13547 [2019-10-02 15:09:44,742 INFO L226 Difference]: Without dead ends: 9797 [2019-10-02 15:09:44,752 INFO L640 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-10-02 15:09:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9797 states. [2019-10-02 15:09:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9797 to 9795. [2019-10-02 15:09:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9795 states. [2019-10-02 15:09:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 15103 transitions. [2019-10-02 15:09:45,289 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 15103 transitions. Word has length 162 [2019-10-02 15:09:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:45,290 INFO L475 AbstractCegarLoop]: Abstraction has 9795 states and 15103 transitions. [2019-10-02 15:09:45,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 15103 transitions. [2019-10-02 15:09:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 15:09:45,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:45,299 INFO L411 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] [2019-10-02 15:09:45,300 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash 169281566, now seen corresponding path program 1 times [2019-10-02 15:09:45,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:45,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:45,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:45,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:45,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:09:45,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:09:45,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:09:45,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:09:45,595 INFO L87 Difference]: Start difference. First operand 9795 states and 15103 transitions. Second operand 4 states. [2019-10-02 15:09:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:46,453 INFO L93 Difference]: Finished difference Result 25746 states and 39693 transitions. [2019-10-02 15:09:46,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:46,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-02 15:09:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:46,489 INFO L225 Difference]: With dead ends: 25746 [2019-10-02 15:09:46,490 INFO L226 Difference]: Without dead ends: 15974 [2019-10-02 15:09:46,508 INFO L640 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-10-02 15:09:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15974 states. [2019-10-02 15:09:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15974 to 15972. [2019-10-02 15:09:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15972 states. [2019-10-02 15:09:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15972 states to 15972 states and 24436 transitions. [2019-10-02 15:09:47,600 INFO L78 Accepts]: Start accepts. Automaton has 15972 states and 24436 transitions. Word has length 162 [2019-10-02 15:09:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:47,600 INFO L475 AbstractCegarLoop]: Abstraction has 15972 states and 24436 transitions. [2019-10-02 15:09:47,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15972 states and 24436 transitions. [2019-10-02 15:09:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 15:09:47,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:47,612 INFO L411 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-10-02 15:09:47,613 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1075293888, now seen corresponding path program 1 times [2019-10-02 15:09:47,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:47,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:47,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:47,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:47,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:47,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:47,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:47,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:47,709 INFO L87 Difference]: Start difference. First operand 15972 states and 24436 transitions. Second operand 3 states. [2019-10-02 15:09:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:49,278 INFO L93 Difference]: Finished difference Result 43438 states and 66412 transitions. [2019-10-02 15:09:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:49,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-02 15:09:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:49,347 INFO L225 Difference]: With dead ends: 43438 [2019-10-02 15:09:49,348 INFO L226 Difference]: Without dead ends: 27862 [2019-10-02 15:09:49,380 INFO L640 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-10-02 15:09:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27862 states. [2019-10-02 15:09:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27862 to 27860. [2019-10-02 15:09:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27860 states. [2019-10-02 15:09:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27860 states to 27860 states and 42130 transitions. [2019-10-02 15:09:50,684 INFO L78 Accepts]: Start accepts. Automaton has 27860 states and 42130 transitions. Word has length 164 [2019-10-02 15:09:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:50,685 INFO L475 AbstractCegarLoop]: Abstraction has 27860 states and 42130 transitions. [2019-10-02 15:09:50,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27860 states and 42130 transitions. [2019-10-02 15:09:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 15:09:50,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:50,702 INFO L411 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-10-02 15:09:50,703 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:50,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:50,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1992197475, now seen corresponding path program 1 times [2019-10-02 15:09:50,703 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:50,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:50,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:50,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:50,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:50,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:09:50,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:09:50,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:09:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:09:50,835 INFO L87 Difference]: Start difference. First operand 27860 states and 42130 transitions. Second operand 4 states. [2019-10-02 15:09:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:51,841 INFO L93 Difference]: Finished difference Result 46369 states and 70138 transitions. [2019-10-02 15:09:51,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:51,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-02 15:09:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:51,908 INFO L225 Difference]: With dead ends: 46369 [2019-10-02 15:09:51,909 INFO L226 Difference]: Without dead ends: 24890 [2019-10-02 15:09:51,951 INFO L640 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-10-02 15:09:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24890 states. [2019-10-02 15:09:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24890 to 24890. [2019-10-02 15:09:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24890 states. [2019-10-02 15:09:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24890 states to 24890 states and 37611 transitions. [2019-10-02 15:09:53,757 INFO L78 Accepts]: Start accepts. Automaton has 24890 states and 37611 transitions. Word has length 164 [2019-10-02 15:09:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:53,757 INFO L475 AbstractCegarLoop]: Abstraction has 24890 states and 37611 transitions. [2019-10-02 15:09:53,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 24890 states and 37611 transitions. [2019-10-02 15:09:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 15:09:53,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:53,771 INFO L411 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] [2019-10-02 15:09:53,771 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash 914961264, now seen corresponding path program 1 times [2019-10-02 15:09:53,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:53,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:53,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:53,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:53,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:53,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:53,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:53,849 INFO L87 Difference]: Start difference. First operand 24890 states and 37611 transitions. Second operand 3 states. [2019-10-02 15:09:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:55,309 INFO L93 Difference]: Finished difference Result 67686 states and 103354 transitions. [2019-10-02 15:09:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:55,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 15:09:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:55,372 INFO L225 Difference]: With dead ends: 67686 [2019-10-02 15:09:55,372 INFO L226 Difference]: Without dead ends: 43132 [2019-10-02 15:09:55,411 INFO L640 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-10-02 15:09:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43132 states. [2019-10-02 15:09:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43132 to 38738. [2019-10-02 15:09:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-10-02 15:09:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 59682 transitions. [2019-10-02 15:09:57,140 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 59682 transitions. Word has length 168 [2019-10-02 15:09:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:57,140 INFO L475 AbstractCegarLoop]: Abstraction has 38738 states and 59682 transitions. [2019-10-02 15:09:57,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 59682 transitions. [2019-10-02 15:09:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 15:09:57,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:57,153 INFO L411 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] [2019-10-02 15:09:57,153 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:57,154 INFO L82 PathProgramCache]: Analyzing trace with hash -808861162, now seen corresponding path program 1 times [2019-10-02 15:09:57,154 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:57,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:57,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:57,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:58,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:58,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:09:58,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:09:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:09:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:09:58,206 INFO L87 Difference]: Start difference. First operand 38738 states and 59682 transitions. Second operand 9 states. [2019-10-02 15:10:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:05,364 INFO L93 Difference]: Finished difference Result 185670 states and 287874 transitions. [2019-10-02 15:10:05,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 15:10:05,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2019-10-02 15:10:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:05,641 INFO L225 Difference]: With dead ends: 185670 [2019-10-02 15:10:05,641 INFO L226 Difference]: Without dead ends: 147342 [2019-10-02 15:10:05,691 INFO L640 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-10-02 15:10:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147342 states. [2019-10-02 15:10:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147342 to 86702. [2019-10-02 15:10:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86702 states. [2019-10-02 15:10:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86702 states to 86702 states and 133802 transitions. [2019-10-02 15:10:11,742 INFO L78 Accepts]: Start accepts. Automaton has 86702 states and 133802 transitions. Word has length 168 [2019-10-02 15:10:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:11,743 INFO L475 AbstractCegarLoop]: Abstraction has 86702 states and 133802 transitions. [2019-10-02 15:10:11,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:10:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 86702 states and 133802 transitions. [2019-10-02 15:10:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 15:10:11,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:11,753 INFO L411 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] [2019-10-02 15:10:11,753 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:11,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1828444201, now seen corresponding path program 1 times [2019-10-02 15:10:11,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:11,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:11,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:11,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:11,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:10:11,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:11,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:10:11,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:10:11,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:10:11,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:10:11,946 INFO L87 Difference]: Start difference. First operand 86702 states and 133802 transitions. Second operand 5 states. [2019-10-02 15:10:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:21,211 INFO L93 Difference]: Finished difference Result 176140 states and 273164 transitions. [2019-10-02 15:10:21,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:10:21,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-10-02 15:10:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:21,477 INFO L225 Difference]: With dead ends: 176140 [2019-10-02 15:10:21,477 INFO L226 Difference]: Without dead ends: 147547 [2019-10-02 15:10:21,520 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:10:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147547 states. [2019-10-02 15:10:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147547 to 108473. [2019-10-02 15:10:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108473 states. [2019-10-02 15:10:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108473 states to 108473 states and 167515 transitions. [2019-10-02 15:10:29,446 INFO L78 Accepts]: Start accepts. Automaton has 108473 states and 167515 transitions. Word has length 168 [2019-10-02 15:10:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:29,446 INFO L475 AbstractCegarLoop]: Abstraction has 108473 states and 167515 transitions. [2019-10-02 15:10:29,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:10:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 108473 states and 167515 transitions. [2019-10-02 15:10:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 15:10:29,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:29,457 INFO L411 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] [2019-10-02 15:10:29,457 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:29,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2026297388, now seen corresponding path program 1 times [2019-10-02 15:10:29,457 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:29,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:29,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:29,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:29,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:10:29,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:29,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:10:29,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:10:29,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:10:29,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:10:29,613 INFO L87 Difference]: Start difference. First operand 108473 states and 167515 transitions. Second operand 4 states. [2019-10-02 15:10:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:33,814 INFO L93 Difference]: Finished difference Result 136709 states and 211573 transitions. [2019-10-02 15:10:33,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:10:33,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-02 15:10:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:33,913 INFO L225 Difference]: With dead ends: 136709 [2019-10-02 15:10:33,913 INFO L226 Difference]: Without dead ends: 76619 [2019-10-02 15:10:33,959 INFO L640 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-10-02 15:10:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76619 states. [2019-10-02 15:10:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76619 to 76617. [2019-10-02 15:10:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76617 states. [2019-10-02 15:10:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76617 states to 76617 states and 117343 transitions. [2019-10-02 15:10:40,054 INFO L78 Accepts]: Start accepts. Automaton has 76617 states and 117343 transitions. Word has length 168 [2019-10-02 15:10:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:40,055 INFO L475 AbstractCegarLoop]: Abstraction has 76617 states and 117343 transitions. [2019-10-02 15:10:40,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:10:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 76617 states and 117343 transitions. [2019-10-02 15:10:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 15:10:40,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:40,064 INFO L411 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] [2019-10-02 15:10:40,065 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:40,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:40,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1750643892, now seen corresponding path program 1 times [2019-10-02 15:10:40,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:40,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:40,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:40,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:40,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:10:40,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:40,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:10:40,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:10:40,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:10:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:10:40,239 INFO L87 Difference]: Start difference. First operand 76617 states and 117343 transitions. Second operand 4 states. [2019-10-02 15:10:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:47,658 INFO L93 Difference]: Finished difference Result 213301 states and 325983 transitions. [2019-10-02 15:10:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:10:47,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-02 15:10:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:47,845 INFO L225 Difference]: With dead ends: 213301 [2019-10-02 15:10:47,845 INFO L226 Difference]: Without dead ends: 136727 [2019-10-02 15:10:47,902 INFO L640 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-10-02 15:10:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136727 states. [2019-10-02 15:10:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136727 to 136725. [2019-10-02 15:10:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136725 states. [2019-10-02 15:10:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136725 states to 136725 states and 206597 transitions. [2019-10-02 15:10:58,496 INFO L78 Accepts]: Start accepts. Automaton has 136725 states and 206597 transitions. Word has length 168 [2019-10-02 15:10:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:58,496 INFO L475 AbstractCegarLoop]: Abstraction has 136725 states and 206597 transitions. [2019-10-02 15:10:58,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:10:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 136725 states and 206597 transitions. [2019-10-02 15:10:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 15:10:58,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:58,512 INFO L411 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-10-02 15:10:58,512 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1922317134, now seen corresponding path program 1 times [2019-10-02 15:10:58,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:58,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:58,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:58,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:58,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:10:58,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:58,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:10:58,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:10:58,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:10:58,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:10:58,575 INFO L87 Difference]: Start difference. First operand 136725 states and 206597 transitions. Second operand 3 states. [2019-10-02 15:11:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:11:18,418 INFO L93 Difference]: Finished difference Result 409975 states and 619536 transitions. [2019-10-02 15:11:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:11:18,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 15:11:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:11:18,812 INFO L225 Difference]: With dead ends: 409975 [2019-10-02 15:11:18,812 INFO L226 Difference]: Without dead ends: 273359 [2019-10-02 15:11:18,907 INFO L640 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-10-02 15:11:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273359 states. [2019-10-02 15:11:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273359 to 136731. [2019-10-02 15:11:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136731 states. [2019-10-02 15:11:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136731 states to 136731 states and 206603 transitions. [2019-10-02 15:11:28,097 INFO L78 Accepts]: Start accepts. Automaton has 136731 states and 206603 transitions. Word has length 169 [2019-10-02 15:11:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:11:28,097 INFO L475 AbstractCegarLoop]: Abstraction has 136731 states and 206603 transitions. [2019-10-02 15:11:28,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:11:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 136731 states and 206603 transitions. [2019-10-02 15:11:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:11:28,108 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:11:28,108 INFO L411 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-10-02 15:11:28,109 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:11:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:11:28,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1844980787, now seen corresponding path program 1 times [2019-10-02 15:11:28,109 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:11:28,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:11:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:28,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:11:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:11:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:11:28,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:11:28,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:11:28,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:11:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:11:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:11:28,251 INFO L87 Difference]: Start difference. First operand 136731 states and 206603 transitions. Second operand 4 states. [2019-10-02 15:11:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:11:39,454 INFO L93 Difference]: Finished difference Result 273351 states and 413065 transitions. [2019-10-02 15:11:39,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:11:39,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-10-02 15:11:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:11:39,639 INFO L225 Difference]: With dead ends: 273351 [2019-10-02 15:11:39,639 INFO L226 Difference]: Without dead ends: 136731 [2019-10-02 15:11:39,719 INFO L640 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-10-02 15:11:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136731 states. [2019-10-02 15:11:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136731 to 136728. [2019-10-02 15:11:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136728 states. [2019-10-02 15:11:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136728 states to 136728 states and 206596 transitions. [2019-10-02 15:11:47,828 INFO L78 Accepts]: Start accepts. Automaton has 136728 states and 206596 transitions. Word has length 170 [2019-10-02 15:11:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:11:47,828 INFO L475 AbstractCegarLoop]: Abstraction has 136728 states and 206596 transitions. [2019-10-02 15:11:47,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:11:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 136728 states and 206596 transitions. [2019-10-02 15:11:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:11:47,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:11:47,841 INFO L411 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-10-02 15:11:47,842 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:11:47,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:11:47,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2007638048, now seen corresponding path program 1 times [2019-10-02 15:11:47,842 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:11:47,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:11:47,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:47,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:11:47,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:11:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:11:47,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:11:47,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:11:47,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:11:47,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:11:47,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:11:47,949 INFO L87 Difference]: Start difference. First operand 136728 states and 206596 transitions. Second operand 3 states. [2019-10-02 15:12:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:12:05,483 INFO L93 Difference]: Finished difference Result 358238 states and 540437 transitions. [2019-10-02 15:12:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:12:05,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-02 15:12:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:12:05,823 INFO L225 Difference]: With dead ends: 358238 [2019-10-02 15:12:05,823 INFO L226 Difference]: Without dead ends: 222257 [2019-10-02 15:12:05,927 INFO L640 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-10-02 15:12:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222257 states. [2019-10-02 15:12:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222257 to 222255. [2019-10-02 15:12:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222255 states. [2019-10-02 15:12:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222255 states to 222255 states and 331883 transitions. [2019-10-02 15:12:23,880 INFO L78 Accepts]: Start accepts. Automaton has 222255 states and 331883 transitions. Word has length 170 [2019-10-02 15:12:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:12:23,881 INFO L475 AbstractCegarLoop]: Abstraction has 222255 states and 331883 transitions. [2019-10-02 15:12:23,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:12:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 222255 states and 331883 transitions. [2019-10-02 15:12:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:12:23,904 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:12:23,905 INFO L411 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-10-02 15:12:23,905 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:12:23,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:12:23,906 INFO L82 PathProgramCache]: Analyzing trace with hash 862278397, now seen corresponding path program 1 times [2019-10-02 15:12:23,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:12:23,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:12:23,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:23,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:12:23,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:12:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:12:24,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:12:24,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:12:24,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:12:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:12:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:12:24,029 INFO L87 Difference]: Start difference. First operand 222255 states and 331883 transitions. Second operand 4 states. [2019-10-02 15:12:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:12:38,272 INFO L93 Difference]: Finished difference Result 421131 states and 629004 transitions. [2019-10-02 15:12:38,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:12:38,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-10-02 15:12:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:12:38,588 INFO L225 Difference]: With dead ends: 421131 [2019-10-02 15:12:38,588 INFO L226 Difference]: Without dead ends: 199547 [2019-10-02 15:12:38,707 INFO L640 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-10-02 15:12:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199547 states. [2019-10-02 15:12:55,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199547 to 199547. [2019-10-02 15:12:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199547 states. [2019-10-02 15:12:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199547 states to 199547 states and 297892 transitions. [2019-10-02 15:12:55,715 INFO L78 Accepts]: Start accepts. Automaton has 199547 states and 297892 transitions. Word has length 170 [2019-10-02 15:12:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:12:55,715 INFO L475 AbstractCegarLoop]: Abstraction has 199547 states and 297892 transitions. [2019-10-02 15:12:55,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:12:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 199547 states and 297892 transitions. [2019-10-02 15:12:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 15:12:55,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:12:55,736 INFO L411 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] [2019-10-02 15:12:55,736 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:12:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:12:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1517127692, now seen corresponding path program 1 times [2019-10-02 15:12:55,737 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:12:55,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:12:55,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:55,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:12:55,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:12:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:12:55,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:12:55,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:12:55,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:12:55,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:12:55,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:12:55,847 INFO L87 Difference]: Start difference. First operand 199547 states and 297892 transitions. Second operand 3 states. [2019-10-02 15:13:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:13:19,970 INFO L93 Difference]: Finished difference Result 482464 states and 720013 transitions. [2019-10-02 15:13:19,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:13:19,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 15:13:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:13:20,507 INFO L225 Difference]: With dead ends: 482464 [2019-10-02 15:13:20,507 INFO L226 Difference]: Without dead ends: 305624 [2019-10-02 15:13:20,657 INFO L640 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-10-02 15:13:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305624 states. [2019-10-02 15:13:44,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305624 to 282213. [2019-10-02 15:13:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282213 states. [2019-10-02 15:13:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282213 states to 282213 states and 413981 transitions. [2019-10-02 15:13:44,997 INFO L78 Accepts]: Start accepts. Automaton has 282213 states and 413981 transitions. Word has length 175 [2019-10-02 15:13:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:13:44,997 INFO L475 AbstractCegarLoop]: Abstraction has 282213 states and 413981 transitions. [2019-10-02 15:13:44,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:13:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 282213 states and 413981 transitions. [2019-10-02 15:13:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 15:13:45,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:13:45,011 INFO L411 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] [2019-10-02 15:13:45,011 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:13:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:13:45,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1914602502, now seen corresponding path program 1 times [2019-10-02 15:13:45,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:13:45,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:13:45,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:45,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:13:45,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:13:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:13:45,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:13:45,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:13:45,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:13:45,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:13:45,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:13:45,236 INFO L87 Difference]: Start difference. First operand 282213 states and 413981 transitions. Second operand 8 states. [2019-10-02 15:14:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:14:52,936 INFO L93 Difference]: Finished difference Result 1084234 states and 1579767 transitions. [2019-10-02 15:14:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:14:52,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-10-02 15:14:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:14:54,405 INFO L225 Difference]: With dead ends: 1084234 [2019-10-02 15:14:54,405 INFO L226 Difference]: Without dead ends: 816891 [2019-10-02 15:14:54,662 INFO L640 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-10-02 15:14:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816891 states. [2019-10-02 15:15:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816891 to 335749. [2019-10-02 15:15:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335749 states. [2019-10-02 15:15:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335749 states to 335749 states and 490297 transitions. [2019-10-02 15:15:41,455 INFO L78 Accepts]: Start accepts. Automaton has 335749 states and 490297 transitions. Word has length 175 [2019-10-02 15:15:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:15:41,456 INFO L475 AbstractCegarLoop]: Abstraction has 335749 states and 490297 transitions. [2019-10-02 15:15:41,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:15:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 335749 states and 490297 transitions. [2019-10-02 15:15:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 15:15:41,473 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:15:41,473 INFO L411 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] [2019-10-02 15:15:41,473 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:15:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:15:41,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1561548205, now seen corresponding path program 1 times [2019-10-02 15:15:41,474 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:15:41,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:15:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:41,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:15:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:15:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:15:41,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:15:41,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:15:41,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:15:41,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:15:41,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:15:41,580 INFO L87 Difference]: Start difference. First operand 335749 states and 490297 transitions. Second operand 4 states. [2019-10-02 15:16:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:16:29,327 INFO L93 Difference]: Finished difference Result 686435 states and 1007087 transitions. [2019-10-02 15:16:29,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:16:29,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-10-02 15:16:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:16:30,195 INFO L225 Difference]: With dead ends: 686435 [2019-10-02 15:16:30,196 INFO L226 Difference]: Without dead ends: 514407 [2019-10-02 15:16:30,362 INFO L640 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-10-02 15:16:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514407 states. [2019-10-02 15:17:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514407 to 333761. [2019-10-02 15:17:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333761 states. [2019-10-02 15:17:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333761 states to 333761 states and 487869 transitions. [2019-10-02 15:17:10,856 INFO L78 Accepts]: Start accepts. Automaton has 333761 states and 487869 transitions. Word has length 175 [2019-10-02 15:17:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:17:10,857 INFO L475 AbstractCegarLoop]: Abstraction has 333761 states and 487869 transitions. [2019-10-02 15:17:10,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:17:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 333761 states and 487869 transitions. [2019-10-02 15:17:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 15:17:10,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:17:10,873 INFO L411 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] [2019-10-02 15:17:10,873 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:17:10,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:17:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash -611823378, now seen corresponding path program 1 times [2019-10-02 15:17:10,874 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:17:10,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:17:10,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:17:10,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:17:10,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:17:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:17:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:17:11,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:17:11,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:17:11,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:17:11,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:17:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:17:11,079 INFO L87 Difference]: Start difference. First operand 333761 states and 487869 transitions. Second operand 4 states. [2019-10-02 15:17:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:17:39,064 INFO L93 Difference]: Finished difference Result 574720 states and 838968 transitions. [2019-10-02 15:17:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:17:39,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-10-02 15:17:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:17:39,505 INFO L225 Difference]: With dead ends: 574720 [2019-10-02 15:17:39,505 INFO L226 Difference]: Without dead ends: 311086 [2019-10-02 15:17:39,676 INFO L640 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-10-02 15:17:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311086 states. [2019-10-02 15:18:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311086 to 311044. [2019-10-02 15:18:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311044 states. [2019-10-02 15:18:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311044 states to 311044 states and 454481 transitions. [2019-10-02 15:18:14,226 INFO L78 Accepts]: Start accepts. Automaton has 311044 states and 454481 transitions. Word has length 175 [2019-10-02 15:18:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:18:14,226 INFO L475 AbstractCegarLoop]: Abstraction has 311044 states and 454481 transitions. [2019-10-02 15:18:14,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:18:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 311044 states and 454481 transitions. [2019-10-02 15:18:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 15:18:14,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:18:14,239 INFO L411 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-10-02 15:18:14,239 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:18:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:18:14,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1485366488, now seen corresponding path program 1 times [2019-10-02 15:18:14,240 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:18:14,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:18:14,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:18:14,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:18:14,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:18:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:18:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:18:14,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:18:14,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:18:14,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:18:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:18:14,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:18:14,436 INFO L87 Difference]: Start difference. First operand 311044 states and 454481 transitions. Second operand 4 states. [2019-10-02 15:18:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:18:49,934 INFO L93 Difference]: Finished difference Result 622093 states and 908969 transitions. [2019-10-02 15:18:49,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:18:49,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-10-02 15:18:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:18:50,364 INFO L225 Difference]: With dead ends: 622093 [2019-10-02 15:18:50,364 INFO L226 Difference]: Without dead ends: 311208 [2019-10-02 15:18:50,530 INFO L640 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-10-02 15:18:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311208 states. [2019-10-02 15:19:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311208 to 311146. [2019-10-02 15:19:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311146 states. [2019-10-02 15:19:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311146 states to 311146 states and 454584 transitions. [2019-10-02 15:19:18,816 INFO L78 Accepts]: Start accepts. Automaton has 311146 states and 454584 transitions. Word has length 177 [2019-10-02 15:19:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:19:18,817 INFO L475 AbstractCegarLoop]: Abstraction has 311146 states and 454584 transitions. [2019-10-02 15:19:18,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:19:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 311146 states and 454584 transitions. [2019-10-02 15:19:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 15:19:18,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:19:18,830 INFO L411 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, 1] [2019-10-02 15:19:18,830 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:19:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:19:18,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2040593584, now seen corresponding path program 1 times [2019-10-02 15:19:18,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:19:18,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:19:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:19:18,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:19:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:19:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:19:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:19:18,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:19:18,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:19:18,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:19:18,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:19:18,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:19:18,885 INFO L87 Difference]: Start difference. First operand 311146 states and 454584 transitions. Second operand 3 states. [2019-10-02 15:20:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:20:19,463 INFO L93 Difference]: Finished difference Result 870601 states and 1271846 transitions. [2019-10-02 15:20:19,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:20:19,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-02 15:20:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:20:20,422 INFO L225 Difference]: With dead ends: 870601 [2019-10-02 15:20:20,422 INFO L226 Difference]: Without dead ends: 622081 [2019-10-02 15:20:20,614 INFO L640 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-10-02 15:20:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622081 states. [2019-10-02 15:21:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622081 to 311156. [2019-10-02 15:21:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311156 states. [2019-10-02 15:21:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311156 states to 311156 states and 454594 transitions. [2019-10-02 15:21:03,156 INFO L78 Accepts]: Start accepts. Automaton has 311156 states and 454594 transitions. Word has length 178 [2019-10-02 15:21:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:21:03,156 INFO L475 AbstractCegarLoop]: Abstraction has 311156 states and 454594 transitions. [2019-10-02 15:21:03,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:21:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 311156 states and 454594 transitions. [2019-10-02 15:21:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:21:03,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:21:03,170 INFO L411 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, 1, 1] [2019-10-02 15:21:03,170 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:21:03,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:21:03,170 INFO L82 PathProgramCache]: Analyzing trace with hash 65679431, now seen corresponding path program 1 times [2019-10-02 15:21:03,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:21:03,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:21:03,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:21:03,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:21:03,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:21:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:21:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:21:03,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:21:03,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:21:03,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:21:03,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:21:03,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:21:03,909 INFO L87 Difference]: Start difference. First operand 311156 states and 454594 transitions. Second operand 4 states.