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/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:18:51,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:18:51,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:18:51,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:18:51,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:18:51,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:18:51,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:18:51,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:18:51,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:18:51,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:18:51,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:18:51,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:18:51,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:18:51,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:18:51,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:18:51,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:18:51,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:18:51,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:18:51,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:18:51,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:18:51,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:18:51,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:18:51,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:18:51,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:18:51,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:18:51,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:18:51,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:18:51,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:18:51,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:18:51,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:18:51,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:18:51,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:18:51,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:18:51,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:18:51,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:18:51,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:18:51,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:18:51,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:18:51,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:18:51,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:18:51,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:18:51,475 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 08:18:51,499 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:18:51,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:18:51,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:18:51,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:18:51,506 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:18:51,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:18:51,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:18:51,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:18:51,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:18:51,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:18:51,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:18:51,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:18:51,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:18:51,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:18:51,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:18:51,510 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:18:51,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:18:51,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:18:51,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:18:51,511 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:18:51,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:18:51,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:18:51,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:18:51,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:18:51,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:18:51,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:18:51,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:18:51,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:18:51,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:18:51,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:18:51,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:18:51,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:18:51,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:18:51,571 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:18:51,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2019-09-08 08:18:51,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/682882836/2562378614ed487f8bbc9204e4acb743/FLAG3f4985478 [2019-09-08 08:18:52,191 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:18:52,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2019-09-08 08:18:52,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/682882836/2562378614ed487f8bbc9204e4acb743/FLAG3f4985478 [2019-09-08 08:18:52,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/682882836/2562378614ed487f8bbc9204e4acb743 [2019-09-08 08:18:52,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:18:52,470 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:18:52,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:18:52,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:18:52,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:18:52,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:18:52" (1/1) ... [2019-09-08 08:18:52,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40945f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:52, skipping insertion in model container [2019-09-08 08:18:52,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:18:52" (1/1) ... [2019-09-08 08:18:52,487 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:18:52,549 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:18:53,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:18:53,016 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:18:53,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:18:53,130 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:18:53,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53 WrapperNode [2019-09-08 08:18:53,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:18:53,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:18:53,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:18:53,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:18:53,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53" (1/1) ... [2019-09-08 08:18:53,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53" (1/1) ... [2019-09-08 08:18:53,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53" (1/1) ... [2019-09-08 08:18:53,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53" (1/1) ... [2019-09-08 08:18:53,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53" (1/1) ... [2019-09-08 08:18:53,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53" (1/1) ... [2019-09-08 08:18:53,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53" (1/1) ... [2019-09-08 08:18:53,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:18:53,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:18:53,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:18:53,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:18:53,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:18:53,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:18:53,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:18:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:18:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:18:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:18:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:18:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:18:53,364 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:18:53,364 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:18:53,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:18:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:18:53,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:18:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:18:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:18:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:18:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:18:53,365 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:18:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:18:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:18:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:18:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:18:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:18:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:18:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:18:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:18:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:18:55,023 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:18:55,024 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:18:55,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:18:55 BoogieIcfgContainer [2019-09-08 08:18:55,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:18:55,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:18:55,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:18:55,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:18:55,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:18:52" (1/3) ... [2019-09-08 08:18:55,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152ec069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:18:55, skipping insertion in model container [2019-09-08 08:18:55,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:53" (2/3) ... [2019-09-08 08:18:55,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152ec069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:18:55, skipping insertion in model container [2019-09-08 08:18:55,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:18:55" (3/3) ... [2019-09-08 08:18:55,042 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2019-09-08 08:18:55,053 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:18:55,064 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:18:55,082 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:18:55,119 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:18:55,120 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:18:55,120 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:18:55,120 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:18:55,120 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:18:55,120 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:18:55,121 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:18:55,121 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:18:55,121 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:18:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states. [2019-09-08 08:18:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 08:18:55,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:55,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:18:55,170 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2107138659, now seen corresponding path program 1 times [2019-09-08 08:18:55,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:55,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:55,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:55,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:55,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:18:55,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:55,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:55,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:55,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:55,788 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 5 states. [2019-09-08 08:18:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:55,997 INFO L93 Difference]: Finished difference Result 506 states and 855 transitions. [2019-09-08 08:18:55,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:18:55,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 08:18:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:56,018 INFO L225 Difference]: With dead ends: 506 [2019-09-08 08:18:56,018 INFO L226 Difference]: Without dead ends: 347 [2019-09-08 08:18:56,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:18:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-08 08:18:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-09-08 08:18:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-08 08:18:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 556 transitions. [2019-09-08 08:18:56,100 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 556 transitions. Word has length 102 [2019-09-08 08:18:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:56,101 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 556 transitions. [2019-09-08 08:18:56,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 556 transitions. [2019-09-08 08:18:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 08:18:56,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:56,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:18:56,109 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:56,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:56,109 INFO L82 PathProgramCache]: Analyzing trace with hash 149921471, now seen corresponding path program 1 times [2019-09-08 08:18:56,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:56,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:56,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:56,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:56,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:56,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-09-08 08:18:56,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:56,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:56,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:56,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:56,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:56,429 INFO L87 Difference]: Start difference. First operand 347 states and 556 transitions. Second operand 5 states. [2019-09-08 08:18:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:57,842 INFO L93 Difference]: Finished difference Result 636 states and 1020 transitions. [2019-09-08 08:18:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:18:57,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-08 08:18:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:57,851 INFO L225 Difference]: With dead ends: 636 [2019-09-08 08:18:57,851 INFO L226 Difference]: Without dead ends: 491 [2019-09-08 08:18:57,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:18:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-08 08:18:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 483. [2019-09-08 08:18:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-08 08:18:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 768 transitions. [2019-09-08 08:18:57,900 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 768 transitions. Word has length 147 [2019-09-08 08:18:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:57,901 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 768 transitions. [2019-09-08 08:18:57,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 768 transitions. [2019-09-08 08:18:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 08:18:57,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:57,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:18:57,908 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:57,909 INFO L82 PathProgramCache]: Analyzing trace with hash -849632732, now seen corresponding path program 1 times [2019-09-08 08:18:57,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:57,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:57,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:57,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:57,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:18:58,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:58,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:58,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:58,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:58,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:58,059 INFO L87 Difference]: Start difference. First operand 483 states and 768 transitions. Second operand 5 states. [2019-09-08 08:18:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:59,321 INFO L93 Difference]: Finished difference Result 1035 states and 1638 transitions. [2019-09-08 08:18:59,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:18:59,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-08 08:18:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:59,328 INFO L225 Difference]: With dead ends: 1035 [2019-09-08 08:18:59,329 INFO L226 Difference]: Without dead ends: 754 [2019-09-08 08:18:59,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:18:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-08 08:18:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 746. [2019-09-08 08:18:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-08 08:18:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1181 transitions. [2019-09-08 08:18:59,379 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1181 transitions. Word has length 150 [2019-09-08 08:18:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:59,380 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1181 transitions. [2019-09-08 08:18:59,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1181 transitions. [2019-09-08 08:18:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 08:18:59,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:59,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:18:59,387 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1519039157, now seen corresponding path program 1 times [2019-09-08 08:18:59,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:59,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:59,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:18:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:59,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:59,568 INFO L87 Difference]: Start difference. First operand 746 states and 1181 transitions. Second operand 5 states. [2019-09-08 08:19:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:00,775 INFO L93 Difference]: Finished difference Result 1814 states and 2855 transitions. [2019-09-08 08:19:00,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:19:00,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-08 08:19:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:00,793 INFO L225 Difference]: With dead ends: 1814 [2019-09-08 08:19:00,793 INFO L226 Difference]: Without dead ends: 1270 [2019-09-08 08:19:00,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:19:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-09-08 08:19:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1256. [2019-09-08 08:19:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-08 08:19:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1975 transitions. [2019-09-08 08:19:00,912 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1975 transitions. Word has length 153 [2019-09-08 08:19:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:00,912 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1975 transitions. [2019-09-08 08:19:00,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:19:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1975 transitions. [2019-09-08 08:19:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 08:19:00,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:00,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:00,917 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash -409144026, now seen corresponding path program 1 times [2019-09-08 08:19:00,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:00,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:00,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:19:01,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:01,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:19:01,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:19:01,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:19:01,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:19:01,143 INFO L87 Difference]: Start difference. First operand 1256 states and 1975 transitions. Second operand 5 states. [2019-09-08 08:19:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:02,373 INFO L93 Difference]: Finished difference Result 3324 states and 5193 transitions. [2019-09-08 08:19:02,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:19:02,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-08 08:19:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:02,387 INFO L225 Difference]: With dead ends: 3324 [2019-09-08 08:19:02,387 INFO L226 Difference]: Without dead ends: 2270 [2019-09-08 08:19:02,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-09-08 08:19:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2244. [2019-09-08 08:19:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-09-08 08:19:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3499 transitions. [2019-09-08 08:19:02,499 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3499 transitions. Word has length 156 [2019-09-08 08:19:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:02,499 INFO L475 AbstractCegarLoop]: Abstraction has 2244 states and 3499 transitions. [2019-09-08 08:19:02,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:19:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3499 transitions. [2019-09-08 08:19:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 08:19:02,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:02,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:02,505 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1622684031, now seen corresponding path program 1 times [2019-09-08 08:19:02,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:02,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:02,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:19:02,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:02,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:19:02,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:19:02,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:19:02,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:19:02,843 INFO L87 Difference]: Start difference. First operand 2244 states and 3499 transitions. Second operand 11 states. [2019-09-08 08:19:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:09,281 INFO L93 Difference]: Finished difference Result 12261 states and 19497 transitions. [2019-09-08 08:19:09,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 08:19:09,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2019-09-08 08:19:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:09,354 INFO L225 Difference]: With dead ends: 12261 [2019-09-08 08:19:09,355 INFO L226 Difference]: Without dead ends: 10219 [2019-09-08 08:19:09,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 08:19:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10219 states. [2019-09-08 08:19:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10219 to 8745. [2019-09-08 08:19:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8745 states. [2019-09-08 08:19:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8745 states to 8745 states and 13789 transitions. [2019-09-08 08:19:09,931 INFO L78 Accepts]: Start accepts. Automaton has 8745 states and 13789 transitions. Word has length 159 [2019-09-08 08:19:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:09,932 INFO L475 AbstractCegarLoop]: Abstraction has 8745 states and 13789 transitions. [2019-09-08 08:19:09,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:19:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 8745 states and 13789 transitions. [2019-09-08 08:19:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 08:19:09,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:09,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:09,946 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1757376658, now seen corresponding path program 1 times [2019-09-08 08:19:09,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:09,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:09,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:09,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:19:10,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:10,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:19:10,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:19:10,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:19:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:10,144 INFO L87 Difference]: Start difference. First operand 8745 states and 13789 transitions. Second operand 6 states. [2019-09-08 08:19:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:12,906 INFO L93 Difference]: Finished difference Result 25917 states and 41022 transitions. [2019-09-08 08:19:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:19:12,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-08 08:19:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:12,985 INFO L225 Difference]: With dead ends: 25917 [2019-09-08 08:19:12,985 INFO L226 Difference]: Without dead ends: 17374 [2019-09-08 08:19:13,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:19:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17374 states. [2019-09-08 08:19:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17374 to 17218. [2019-09-08 08:19:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17218 states. [2019-09-08 08:19:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17218 states to 17218 states and 27183 transitions. [2019-09-08 08:19:14,216 INFO L78 Accepts]: Start accepts. Automaton has 17218 states and 27183 transitions. Word has length 160 [2019-09-08 08:19:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:14,216 INFO L475 AbstractCegarLoop]: Abstraction has 17218 states and 27183 transitions. [2019-09-08 08:19:14,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:19:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 17218 states and 27183 transitions. [2019-09-08 08:19:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:14,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:14,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:14,228 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2069872805, now seen corresponding path program 1 times [2019-09-08 08:19:14,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:14,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:14,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:14,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:19:14,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:14,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:19:14,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:19:14,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:19:14,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:19:14,478 INFO L87 Difference]: Start difference. First operand 17218 states and 27183 transitions. Second operand 11 states. [2019-09-08 08:19:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:22,193 INFO L93 Difference]: Finished difference Result 30844 states and 49135 transitions. [2019-09-08 08:19:22,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 08:19:22,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-08 08:19:22,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:22,325 INFO L225 Difference]: With dead ends: 30844 [2019-09-08 08:19:22,325 INFO L226 Difference]: Without dead ends: 28770 [2019-09-08 08:19:22,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 08:19:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-09-08 08:19:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 25974. [2019-09-08 08:19:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25974 states. [2019-09-08 08:19:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25974 states to 25974 states and 41015 transitions. [2019-09-08 08:19:23,293 INFO L78 Accepts]: Start accepts. Automaton has 25974 states and 41015 transitions. Word has length 161 [2019-09-08 08:19:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:23,294 INFO L475 AbstractCegarLoop]: Abstraction has 25974 states and 41015 transitions. [2019-09-08 08:19:23,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:19:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states and 41015 transitions. [2019-09-08 08:19:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:23,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:23,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:23,306 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash -671538649, now seen corresponding path program 1 times [2019-09-08 08:19:23,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:23,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:23,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:19:23,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:23,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:19:23,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:19:23,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:19:23,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:19:23,536 INFO L87 Difference]: Start difference. First operand 25974 states and 41015 transitions. Second operand 11 states. [2019-09-08 08:19:26,400 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-09-08 08:19:33,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:33,032 INFO L93 Difference]: Finished difference Result 47398 states and 75585 transitions. [2019-09-08 08:19:33,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 08:19:33,032 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-08 08:19:33,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:33,217 INFO L225 Difference]: With dead ends: 47398 [2019-09-08 08:19:33,217 INFO L226 Difference]: Without dead ends: 40876 [2019-09-08 08:19:33,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 08:19:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-09-08 08:19:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 35896. [2019-09-08 08:19:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35896 states. [2019-09-08 08:19:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35896 states to 35896 states and 56891 transitions. [2019-09-08 08:19:35,323 INFO L78 Accepts]: Start accepts. Automaton has 35896 states and 56891 transitions. Word has length 161 [2019-09-08 08:19:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:35,324 INFO L475 AbstractCegarLoop]: Abstraction has 35896 states and 56891 transitions. [2019-09-08 08:19:35,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:19:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35896 states and 56891 transitions. [2019-09-08 08:19:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:35,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:35,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:35,335 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:35,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1699484185, now seen corresponding path program 1 times [2019-09-08 08:19:35,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:35,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:35,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:35,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:19:35,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:35,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:19:35,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:19:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:19:35,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:19:35,561 INFO L87 Difference]: Start difference. First operand 35896 states and 56891 transitions. Second operand 11 states. [2019-09-08 08:19:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:44,157 INFO L93 Difference]: Finished difference Result 64688 states and 103204 transitions. [2019-09-08 08:19:44,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 08:19:44,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-08 08:19:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:44,333 INFO L225 Difference]: With dead ends: 64688 [2019-09-08 08:19:44,333 INFO L226 Difference]: Without dead ends: 51464 [2019-09-08 08:19:44,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=625, Invalid=2567, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 08:19:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51464 states. [2019-09-08 08:19:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51464 to 46484. [2019-09-08 08:19:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46484 states. [2019-09-08 08:19:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46484 states to 46484 states and 73741 transitions. [2019-09-08 08:19:46,498 INFO L78 Accepts]: Start accepts. Automaton has 46484 states and 73741 transitions. Word has length 161 [2019-09-08 08:19:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:46,498 INFO L475 AbstractCegarLoop]: Abstraction has 46484 states and 73741 transitions. [2019-09-08 08:19:46,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:19:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 46484 states and 73741 transitions. [2019-09-08 08:19:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:46,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:46,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:46,511 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1689565736, now seen corresponding path program 1 times [2019-09-08 08:19:46,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:46,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:46,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:46,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:46,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:19:46,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:46,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:19:46,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:19:46,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:19:46,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:46,672 INFO L87 Difference]: Start difference. First operand 46484 states and 73741 transitions. Second operand 6 states. [2019-09-08 08:19:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:51,298 INFO L93 Difference]: Finished difference Result 138838 states and 220646 transitions. [2019-09-08 08:19:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:19:51,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-08 08:19:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:51,608 INFO L225 Difference]: With dead ends: 138838 [2019-09-08 08:19:51,608 INFO L226 Difference]: Without dead ends: 92556 [2019-09-08 08:19:51,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:19:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92556 states. [2019-09-08 08:19:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92556 to 91932. [2019-09-08 08:19:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91932 states. [2019-09-08 08:19:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91932 states to 91932 states and 145795 transitions. [2019-09-08 08:19:53,851 INFO L78 Accepts]: Start accepts. Automaton has 91932 states and 145795 transitions. Word has length 161 [2019-09-08 08:19:53,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:53,851 INFO L475 AbstractCegarLoop]: Abstraction has 91932 states and 145795 transitions. [2019-09-08 08:19:53,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:19:53,852 INFO L276 IsEmpty]: Start isEmpty. Operand 91932 states and 145795 transitions. [2019-09-08 08:19:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:53,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:53,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:53,866 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:53,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1523949593, now seen corresponding path program 1 times [2019-09-08 08:19:53,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:53,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:53,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:53,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:53,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:19:54,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:54,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:19:54,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:19:54,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:19:54,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:54,049 INFO L87 Difference]: Start difference. First operand 91932 states and 145795 transitions. Second operand 6 states. [2019-09-08 08:19:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:57,137 INFO L93 Difference]: Finished difference Result 159516 states and 254101 transitions. [2019-09-08 08:19:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:19:57,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-08 08:19:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:57,673 INFO L225 Difference]: With dead ends: 159516 [2019-09-08 08:19:57,673 INFO L226 Difference]: Without dead ends: 97374 [2019-09-08 08:19:57,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:19:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97374 states. [2019-09-08 08:20:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97374 to 92164. [2019-09-08 08:20:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92164 states. [2019-09-08 08:20:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92164 states to 92164 states and 145795 transitions. [2019-09-08 08:20:02,494 INFO L78 Accepts]: Start accepts. Automaton has 92164 states and 145795 transitions. Word has length 161 [2019-09-08 08:20:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:20:02,495 INFO L475 AbstractCegarLoop]: Abstraction has 92164 states and 145795 transitions. [2019-09-08 08:20:02,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:20:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 92164 states and 145795 transitions. [2019-09-08 08:20:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 08:20:02,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:20:02,509 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:20:02,510 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:20:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:20:02,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1042735562, now seen corresponding path program 1 times [2019-09-08 08:20:02,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:20:02,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:20:02,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:02,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:20:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:20:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:20:02,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:20:02,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 08:20:02,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 08:20:02,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 08:20:02,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:20:02,773 INFO L87 Difference]: Start difference. First operand 92164 states and 145795 transitions. Second operand 12 states. [2019-09-08 08:20:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:20:16,529 INFO L93 Difference]: Finished difference Result 242195 states and 391367 transitions. [2019-09-08 08:20:16,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 08:20:16,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 162 [2019-09-08 08:20:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:17,633 INFO L225 Difference]: With dead ends: 242195 [2019-09-08 08:20:17,634 INFO L226 Difference]: Without dead ends: 210911 [2019-09-08 08:20:17,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 08:20:17,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210911 states. [2019-09-08 08:20:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210911 to 197653. [2019-09-08 08:20:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197653 states. [2019-09-08 08:20:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197653 states to 197653 states and 318002 transitions. [2019-09-08 08:20:25,042 INFO L78 Accepts]: Start accepts. Automaton has 197653 states and 318002 transitions. Word has length 162 [2019-09-08 08:20:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:20:25,042 INFO L475 AbstractCegarLoop]: Abstraction has 197653 states and 318002 transitions. [2019-09-08 08:20:25,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 08:20:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 197653 states and 318002 transitions. [2019-09-08 08:20:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 08:20:25,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:20:25,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:20:25,052 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:20:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:20:25,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1395823944, now seen corresponding path program 1 times [2019-09-08 08:20:25,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:20:25,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:20:25,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:25,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:20:25,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:20:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:20:25,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:20:25,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:20:25,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:20:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:20:25,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:20:25,200 INFO L87 Difference]: Start difference. First operand 197653 states and 318002 transitions. Second operand 7 states. [2019-09-08 08:20:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:20:34,556 INFO L93 Difference]: Finished difference Result 353068 states and 569546 transitions. [2019-09-08 08:20:34,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:20:34,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 162 [2019-09-08 08:20:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:35,094 INFO L225 Difference]: With dead ends: 353068 [2019-09-08 08:20:35,095 INFO L226 Difference]: Without dead ends: 201112 [2019-09-08 08:20:35,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:20:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201112 states. [2019-09-08 08:20:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201112 to 200682. [2019-09-08 08:20:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200682 states. [2019-09-08 08:20:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200682 states to 200682 states and 323223 transitions. [2019-09-08 08:20:40,609 INFO L78 Accepts]: Start accepts. Automaton has 200682 states and 323223 transitions. Word has length 162 [2019-09-08 08:20:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:20:40,610 INFO L475 AbstractCegarLoop]: Abstraction has 200682 states and 323223 transitions. [2019-09-08 08:20:40,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:20:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 200682 states and 323223 transitions. [2019-09-08 08:20:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 08:20:40,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:20:40,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:20:40,619 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:20:40,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:20:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 360887909, now seen corresponding path program 1 times [2019-09-08 08:20:40,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:20:40,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:20:40,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:40,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:20:40,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:20:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:20:40,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:20:40,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:20:40,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:20:40,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:20:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:20:40,760 INFO L87 Difference]: Start difference. First operand 200682 states and 323223 transitions. Second operand 6 states. [2019-09-08 08:20:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:20:53,394 INFO L93 Difference]: Finished difference Result 600319 states and 968296 transitions. [2019-09-08 08:20:53,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:20:53,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-08 08:20:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:54,607 INFO L225 Difference]: With dead ends: 600319 [2019-09-08 08:20:54,607 INFO L226 Difference]: Without dead ends: 400795 [2019-09-08 08:20:54,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:20:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400795 states. [2019-09-08 08:21:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400795 to 398140. [2019-09-08 08:21:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398140 states. [2019-09-08 08:21:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398140 states to 398140 states and 641235 transitions. [2019-09-08 08:21:16,679 INFO L78 Accepts]: Start accepts. Automaton has 398140 states and 641235 transitions. Word has length 162 [2019-09-08 08:21:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:16,680 INFO L475 AbstractCegarLoop]: Abstraction has 398140 states and 641235 transitions. [2019-09-08 08:21:16,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:21:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 398140 states and 641235 transitions. [2019-09-08 08:21:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 08:21:16,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:16,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:21:16,691 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash 232594251, now seen corresponding path program 1 times [2019-09-08 08:21:16,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:16,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:16,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:16,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:16,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:21:17,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:17,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:21:17,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:21:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:21:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:17,676 INFO L87 Difference]: Start difference. First operand 398140 states and 641235 transitions. Second operand 6 states. [2019-09-08 08:21:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:39,865 INFO L93 Difference]: Finished difference Result 749049 states and 1237352 transitions. [2019-09-08 08:21:39,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:21:39,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-08 08:21:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:41,667 INFO L225 Difference]: With dead ends: 749049 [2019-09-08 08:21:41,667 INFO L226 Difference]: Without dead ends: 435765 [2019-09-08 08:21:42,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:21:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435765 states. [2019-09-08 08:21:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435765 to 363529. [2019-09-08 08:21:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363529 states. [2019-09-08 08:21:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363529 states to 363529 states and 585177 transitions. [2019-09-08 08:21:59,851 INFO L78 Accepts]: Start accepts. Automaton has 363529 states and 585177 transitions. Word has length 163 [2019-09-08 08:21:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:59,852 INFO L475 AbstractCegarLoop]: Abstraction has 363529 states and 585177 transitions. [2019-09-08 08:21:59,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:21:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 363529 states and 585177 transitions. [2019-09-08 08:21:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 08:21:59,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:59,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:21:59,860 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1818161165, now seen corresponding path program 1 times [2019-09-08 08:21:59,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:59,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:59,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:00,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:00,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:22:00,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:22:00,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:22:00,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:22:00,111 INFO L87 Difference]: Start difference. First operand 363529 states and 585177 transitions. Second operand 6 states. [2019-09-08 08:22:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:21,079 INFO L93 Difference]: Finished difference Result 669379 states and 1103708 transitions. [2019-09-08 08:22:21,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:22:21,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-08 08:22:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:22,639 INFO L225 Difference]: With dead ends: 669379 [2019-09-08 08:22:22,639 INFO L226 Difference]: Without dead ends: 397273 [2019-09-08 08:22:28,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:22:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397273 states. [2019-09-08 08:22:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397273 to 366387. [2019-09-08 08:22:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366387 states. [2019-09-08 08:22:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366387 states to 366387 states and 589279 transitions. [2019-09-08 08:22:44,047 INFO L78 Accepts]: Start accepts. Automaton has 366387 states and 589279 transitions. Word has length 163 [2019-09-08 08:22:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:44,048 INFO L475 AbstractCegarLoop]: Abstraction has 366387 states and 589279 transitions. [2019-09-08 08:22:44,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:22:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 366387 states and 589279 transitions. [2019-09-08 08:22:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 08:22:44,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:44,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:22:44,053 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash -551243473, now seen corresponding path program 1 times [2019-09-08 08:22:44,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:44,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:44,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:44,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:44,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:44,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:44,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:22:44,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:22:44,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:22:44,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:22:44,217 INFO L87 Difference]: Start difference. First operand 366387 states and 589279 transitions. Second operand 6 states. [2019-09-08 08:23:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:23:16,524 INFO L93 Difference]: Finished difference Result 1259618 states and 2032210 transitions. [2019-09-08 08:23:16,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:23:16,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-08 08:23:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:23:27,863 INFO L225 Difference]: With dead ends: 1259618 [2019-09-08 08:23:27,863 INFO L226 Difference]: Without dead ends: 894020 [2019-09-08 08:23:28,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:23:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894020 states. [2019-09-08 08:24:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894020 to 684916. [2019-09-08 08:24:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684916 states. [2019-09-08 08:24:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684916 states to 684916 states and 1106365 transitions. [2019-09-08 08:24:07,669 INFO L78 Accepts]: Start accepts. Automaton has 684916 states and 1106365 transitions. Word has length 163 [2019-09-08 08:24:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:24:07,670 INFO L475 AbstractCegarLoop]: Abstraction has 684916 states and 1106365 transitions. [2019-09-08 08:24:07,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:24:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 684916 states and 1106365 transitions. [2019-09-08 08:24:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 08:24:07,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:24:07,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:24:07,673 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:24:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:24:07,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1283695039, now seen corresponding path program 1 times [2019-09-08 08:24:07,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:24:07,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:24:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:07,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:24:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:24:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:24:07,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:24:07,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:24:07,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:24:07,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:24:07,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:24:07,775 INFO L87 Difference]: Start difference. First operand 684916 states and 1106365 transitions. Second operand 5 states. [2019-09-08 08:24:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:24:59,920 INFO L93 Difference]: Finished difference Result 1731763 states and 2816919 transitions. [2019-09-08 08:24:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:24:59,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-09-08 08:24:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:25:04,255 INFO L225 Difference]: With dead ends: 1731763 [2019-09-08 08:25:04,255 INFO L226 Difference]: Without dead ends: 1190718 [2019-09-08 08:25:04,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:25:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190718 states. [2019-09-08 08:26:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190718 to 1182730. [2019-09-08 08:26:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182730 states. [2019-09-08 08:26:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182730 states to 1182730 states and 1919450 transitions. [2019-09-08 08:26:30,351 INFO L78 Accepts]: Start accepts. Automaton has 1182730 states and 1919450 transitions. Word has length 164 [2019-09-08 08:26:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:26:30,352 INFO L475 AbstractCegarLoop]: Abstraction has 1182730 states and 1919450 transitions. [2019-09-08 08:26:30,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:26:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1182730 states and 1919450 transitions. [2019-09-08 08:26:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 08:26:30,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:26:30,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:26:30,355 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:26:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:26:30,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1625068863, now seen corresponding path program 1 times [2019-09-08 08:26:30,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:26:30,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:26:30,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:26:30,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:26:30,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:26:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:26:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:26:30,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:26:30,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 08:26:30,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 08:26:30,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 08:26:30,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:26:30,587 INFO L87 Difference]: Start difference. First operand 1182730 states and 1919450 transitions. Second operand 12 states.