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.2.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:18:40,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:18:40,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:18:40,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:18:40,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:18:40,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:18:40,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:18:40,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:18:40,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:18:40,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:18:40,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:18:40,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:18:40,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:18:40,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:18:40,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:18:40,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:18:40,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:18:40,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:18:40,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:18:40,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:18:40,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:18:40,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:18:40,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:18:40,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:18:40,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:18:40,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:18:40,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:18:40,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:18:40,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:18:40,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:18:40,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:18:40,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:18:40,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:18:40,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:18:40,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:18:40,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:18:40,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:18:40,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:18:40,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:18:40,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:18:40,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:18:40,294 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:40,308 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:18:40,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:18:40,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:18:40,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:18:40,310 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:18:40,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:18:40,311 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:18:40,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:18:40,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:18:40,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:18:40,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:18:40,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:18:40,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:18:40,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:18:40,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:18:40,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:18:40,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:18:40,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:18:40,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:18:40,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:18:40,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:18:40,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:18:40,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:18:40,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:18:40,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:18:40,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:18:40,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:18:40,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:18:40,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:18:40,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:18:40,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:18:40,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:18:40,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:18:40,364 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:18:40,365 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.2.ufo.BOUNDED-8.pals.c [2019-09-08 08:18:40,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f74e3a15/5660b6551f834f09a18d304d958a391c/FLAG14b93cdae [2019-09-08 08:18:41,054 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:18:41,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-09-08 08:18:41,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f74e3a15/5660b6551f834f09a18d304d958a391c/FLAG14b93cdae [2019-09-08 08:18:41,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f74e3a15/5660b6551f834f09a18d304d958a391c [2019-09-08 08:18:41,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:18:41,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:18:41,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:18:41,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:18:41,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:18:41,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:18:41" (1/1) ... [2019-09-08 08:18:41,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349f85a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:41, skipping insertion in model container [2019-09-08 08:18:41,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:18:41" (1/1) ... [2019-09-08 08:18:41,410 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:18:41,478 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:18:41,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:18:41,922 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:18:42,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:18:42,075 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:18:42,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:42 WrapperNode [2019-09-08 08:18:42,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:18:42,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:18:42,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:18:42,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:18:42,087 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:42" (1/1) ... [2019-09-08 08:18:42,087 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:42" (1/1) ... [2019-09-08 08:18:42,104 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:42" (1/1) ... [2019-09-08 08:18:42,105 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:42" (1/1) ... [2019-09-08 08:18:42,134 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:42" (1/1) ... [2019-09-08 08:18:42,165 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:42" (1/1) ... [2019-09-08 08:18:42,170 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:42" (1/1) ... [2019-09-08 08:18:42,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:18:42,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:18:42,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:18:42,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:18:42,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:42" (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:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:18:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:18:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:18:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:18:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:18:42,265 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:18:42,265 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:18:42,265 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:18:42,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:18:42,265 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:18:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:18:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:18:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:18:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:18:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:18:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:18:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:18:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:18:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:18:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:18:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:18:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:18:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:18:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:18:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:18:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:18:43,806 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:18:43,807 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:18:43,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:18:43 BoogieIcfgContainer [2019-09-08 08:18:43,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:18:43,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:18:43,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:18:43,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:18:43,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:18:41" (1/3) ... [2019-09-08 08:18:43,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2323e1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:18:43, skipping insertion in model container [2019-09-08 08:18:43,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:18:42" (2/3) ... [2019-09-08 08:18:43,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2323e1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:18:43, skipping insertion in model container [2019-09-08 08:18:43,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:18:43" (3/3) ... [2019-09-08 08:18:43,821 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-09-08 08:18:43,833 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:18:43,842 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:18:43,860 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:18:43,901 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:18:43,902 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:18:43,903 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:18:43,903 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:18:43,903 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:18:43,903 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:18:43,903 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:18:43,903 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:18:43,904 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:18:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states. [2019-09-08 08:18:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 08:18:43,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:43,954 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:43,956 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:43,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2107138659, now seen corresponding path program 1 times [2019-09-08 08:18:43,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:43,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:44,631 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:44,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:44,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:44,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:44,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:44,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:44,658 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 5 states. [2019-09-08 08:18:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:44,851 INFO L93 Difference]: Finished difference Result 506 states and 855 transitions. [2019-09-08 08:18:44,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:18:44,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 08:18:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:44,875 INFO L225 Difference]: With dead ends: 506 [2019-09-08 08:18:44,875 INFO L226 Difference]: Without dead ends: 347 [2019-09-08 08:18:44,880 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:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-08 08:18:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-09-08 08:18:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-08 08:18:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 556 transitions. [2019-09-08 08:18:44,957 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 556 transitions. Word has length 102 [2019-09-08 08:18:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:44,958 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 556 transitions. [2019-09-08 08:18:44,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 556 transitions. [2019-09-08 08:18:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 08:18:44,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:44,969 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:44,969 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:44,970 INFO L82 PathProgramCache]: Analyzing trace with hash 149921471, now seen corresponding path program 1 times [2019-09-08 08:18:44,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:44,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:44,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:44,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:44,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:45,281 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:45,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:45,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:45,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:45,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:45,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:45,286 INFO L87 Difference]: Start difference. First operand 347 states and 556 transitions. Second operand 5 states. [2019-09-08 08:18:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:46,633 INFO L93 Difference]: Finished difference Result 636 states and 1020 transitions. [2019-09-08 08:18:46,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:18:46,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-08 08:18:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:46,641 INFO L225 Difference]: With dead ends: 636 [2019-09-08 08:18:46,641 INFO L226 Difference]: Without dead ends: 491 [2019-09-08 08:18:46,643 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:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-08 08:18:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 483. [2019-09-08 08:18:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-08 08:18:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 768 transitions. [2019-09-08 08:18:46,682 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 768 transitions. Word has length 147 [2019-09-08 08:18:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:46,683 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 768 transitions. [2019-09-08 08:18:46,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 768 transitions. [2019-09-08 08:18:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 08:18:46,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:46,693 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:46,693 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:46,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:46,694 INFO L82 PathProgramCache]: Analyzing trace with hash -849632732, now seen corresponding path program 1 times [2019-09-08 08:18:46,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:46,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:46,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:46,925 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:46,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:46,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:46,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:46,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:46,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:46,932 INFO L87 Difference]: Start difference. First operand 483 states and 768 transitions. Second operand 5 states. [2019-09-08 08:18:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:48,060 INFO L93 Difference]: Finished difference Result 1035 states and 1638 transitions. [2019-09-08 08:18:48,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:18:48,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-08 08:18:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:48,067 INFO L225 Difference]: With dead ends: 1035 [2019-09-08 08:18:48,067 INFO L226 Difference]: Without dead ends: 754 [2019-09-08 08:18:48,069 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:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-08 08:18:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 746. [2019-09-08 08:18:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-08 08:18:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1181 transitions. [2019-09-08 08:18:48,158 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1181 transitions. Word has length 150 [2019-09-08 08:18:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:48,159 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1181 transitions. [2019-09-08 08:18:48,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1181 transitions. [2019-09-08 08:18:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 08:18:48,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:48,165 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:48,165 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:48,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:48,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1519039157, now seen corresponding path program 1 times [2019-09-08 08:18:48,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:48,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:48,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:48,294 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:48,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:48,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:48,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:48,296 INFO L87 Difference]: Start difference. First operand 746 states and 1181 transitions. Second operand 5 states. [2019-09-08 08:18:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:49,532 INFO L93 Difference]: Finished difference Result 1814 states and 2855 transitions. [2019-09-08 08:18:49,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:18:49,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-08 08:18:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:49,543 INFO L225 Difference]: With dead ends: 1814 [2019-09-08 08:18:49,543 INFO L226 Difference]: Without dead ends: 1270 [2019-09-08 08:18:49,546 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:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-09-08 08:18:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1256. [2019-09-08 08:18:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-08 08:18:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1975 transitions. [2019-09-08 08:18:49,629 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1975 transitions. Word has length 153 [2019-09-08 08:18:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:49,630 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1975 transitions. [2019-09-08 08:18:49,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1975 transitions. [2019-09-08 08:18:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 08:18:49,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:49,636 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:18:49,637 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash -409144026, now seen corresponding path program 1 times [2019-09-08 08:18:49,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:49,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:49,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:49,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:49,800 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:49,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:49,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:49,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:49,803 INFO L87 Difference]: Start difference. First operand 1256 states and 1975 transitions. Second operand 5 states. [2019-09-08 08:18:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:50,994 INFO L93 Difference]: Finished difference Result 3324 states and 5193 transitions. [2019-09-08 08:18:50,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:18:50,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-08 08:18:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:51,011 INFO L225 Difference]: With dead ends: 3324 [2019-09-08 08:18:51,011 INFO L226 Difference]: Without dead ends: 2270 [2019-09-08 08:18:51,015 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:18:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-09-08 08:18:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2244. [2019-09-08 08:18:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-09-08 08:18:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3499 transitions. [2019-09-08 08:18:51,179 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3499 transitions. Word has length 156 [2019-09-08 08:18:51,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:51,179 INFO L475 AbstractCegarLoop]: Abstraction has 2244 states and 3499 transitions. [2019-09-08 08:18:51,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:51,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3499 transitions. [2019-09-08 08:18:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 08:18:51,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:51,186 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:18:51,187 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1622684031, now seen corresponding path program 1 times [2019-09-08 08:18:51,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:51,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:51,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:51,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:51,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:51,583 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:51,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:51,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:18:51,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:18:51,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:18:51,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:18:51,586 INFO L87 Difference]: Start difference. First operand 2244 states and 3499 transitions. Second operand 11 states. [2019-09-08 08:18:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:58,017 INFO L93 Difference]: Finished difference Result 12261 states and 19497 transitions. [2019-09-08 08:18:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 08:18:58,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2019-09-08 08:18:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:58,091 INFO L225 Difference]: With dead ends: 12261 [2019-09-08 08:18:58,092 INFO L226 Difference]: Without dead ends: 10219 [2019-09-08 08:18:58,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 08:18:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10219 states. [2019-09-08 08:18:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10219 to 8745. [2019-09-08 08:18:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8745 states. [2019-09-08 08:18:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8745 states to 8745 states and 13789 transitions. [2019-09-08 08:18:58,614 INFO L78 Accepts]: Start accepts. Automaton has 8745 states and 13789 transitions. Word has length 159 [2019-09-08 08:18:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:58,615 INFO L475 AbstractCegarLoop]: Abstraction has 8745 states and 13789 transitions. [2019-09-08 08:18:58,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:18:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8745 states and 13789 transitions. [2019-09-08 08:18:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 08:18:58,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:58,632 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:18:58,633 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1757376658, now seen corresponding path program 1 times [2019-09-08 08:18:58,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:58,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:58,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:18:58,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:58,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:18:58,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:18:58,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:18:58,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:18:58,836 INFO L87 Difference]: Start difference. First operand 8745 states and 13789 transitions. Second operand 6 states. [2019-09-08 08:19:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:01,453 INFO L93 Difference]: Finished difference Result 25917 states and 41022 transitions. [2019-09-08 08:19:01,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:19:01,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-08 08:19:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:01,582 INFO L225 Difference]: With dead ends: 25917 [2019-09-08 08:19:01,583 INFO L226 Difference]: Without dead ends: 17374 [2019-09-08 08:19:01,619 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:19:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17374 states. [2019-09-08 08:19:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17374 to 17218. [2019-09-08 08:19:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17218 states. [2019-09-08 08:19:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17218 states to 17218 states and 27183 transitions. [2019-09-08 08:19:02,385 INFO L78 Accepts]: Start accepts. Automaton has 17218 states and 27183 transitions. Word has length 160 [2019-09-08 08:19:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:02,386 INFO L475 AbstractCegarLoop]: Abstraction has 17218 states and 27183 transitions. [2019-09-08 08:19:02,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:19:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 17218 states and 27183 transitions. [2019-09-08 08:19:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:02,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:02,399 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:02,399 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:02,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash 141600103, now seen corresponding path program 1 times [2019-09-08 08:19:02,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:02,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:02,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:02,660 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,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:02,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:19:02,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:19:02,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:19:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:19:02,662 INFO L87 Difference]: Start difference. First operand 17218 states and 27183 transitions. Second operand 11 states. [2019-09-08 08:19:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:10,451 INFO L93 Difference]: Finished difference Result 30844 states and 49135 transitions. [2019-09-08 08:19:10,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 08:19:10,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-08 08:19:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:10,584 INFO L225 Difference]: With dead ends: 30844 [2019-09-08 08:19:10,584 INFO L226 Difference]: Without dead ends: 28770 [2019-09-08 08:19:10,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 08:19:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-09-08 08:19:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 25974. [2019-09-08 08:19:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25974 states. [2019-09-08 08:19:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25974 states to 25974 states and 41015 transitions. [2019-09-08 08:19:11,735 INFO L78 Accepts]: Start accepts. Automaton has 25974 states and 41015 transitions. Word has length 161 [2019-09-08 08:19:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:11,736 INFO L475 AbstractCegarLoop]: Abstraction has 25974 states and 41015 transitions. [2019-09-08 08:19:11,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:19:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states and 41015 transitions. [2019-09-08 08:19:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:11,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:11,748 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:11,748 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:11,749 INFO L82 PathProgramCache]: Analyzing trace with hash -671538649, now seen corresponding path program 1 times [2019-09-08 08:19:11,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:11,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:11,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:11,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:11,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:11,993 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:11,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:11,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:19:11,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:19:11,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:19:11,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:19:11,994 INFO L87 Difference]: Start difference. First operand 25974 states and 41015 transitions. Second operand 11 states. [2019-09-08 08:19:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:21,235 INFO L93 Difference]: Finished difference Result 47398 states and 75585 transitions. [2019-09-08 08:19:21,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 08:19:21,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-08 08:19:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:21,535 INFO L225 Difference]: With dead ends: 47398 [2019-09-08 08:19:21,535 INFO L226 Difference]: Without dead ends: 40876 [2019-09-08 08:19:21,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 08:19:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-09-08 08:19:22,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 35896. [2019-09-08 08:19:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35896 states. [2019-09-08 08:19:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35896 states to 35896 states and 56891 transitions. [2019-09-08 08:19:22,727 INFO L78 Accepts]: Start accepts. Automaton has 35896 states and 56891 transitions. Word has length 161 [2019-09-08 08:19:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:22,728 INFO L475 AbstractCegarLoop]: Abstraction has 35896 states and 56891 transitions. [2019-09-08 08:19:22,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:19:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 35896 states and 56891 transitions. [2019-09-08 08:19:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:22,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:22,743 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:22,743 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1699484185, now seen corresponding path program 1 times [2019-09-08 08:19:22,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:22,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:22,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:23,003 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,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:23,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:19:23,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:19:23,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:19:23,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:19:23,005 INFO L87 Difference]: Start difference. First operand 35896 states and 56891 transitions. Second operand 11 states. [2019-09-08 08:19:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:31,709 INFO L93 Difference]: Finished difference Result 64688 states and 103204 transitions. [2019-09-08 08:19:31,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 08:19:31,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-08 08:19:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:31,924 INFO L225 Difference]: With dead ends: 64688 [2019-09-08 08:19:31,924 INFO L226 Difference]: Without dead ends: 51464 [2019-09-08 08:19:31,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=625, Invalid=2567, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 08:19:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51464 states. [2019-09-08 08:19:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51464 to 46484. [2019-09-08 08:19:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46484 states. [2019-09-08 08:19:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46484 states to 46484 states and 73741 transitions. [2019-09-08 08:19:34,674 INFO L78 Accepts]: Start accepts. Automaton has 46484 states and 73741 transitions. Word has length 161 [2019-09-08 08:19:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:34,675 INFO L475 AbstractCegarLoop]: Abstraction has 46484 states and 73741 transitions. [2019-09-08 08:19:34,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:19:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 46484 states and 73741 transitions. [2019-09-08 08:19:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:34,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:34,687 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:34,687 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:34,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1689565736, now seen corresponding path program 1 times [2019-09-08 08:19:34,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:34,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:34,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:34,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:34,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:34,828 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:34,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:34,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:19:34,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:19:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:19:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:34,829 INFO L87 Difference]: Start difference. First operand 46484 states and 73741 transitions. Second operand 6 states. [2019-09-08 08:19:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:39,958 INFO L93 Difference]: Finished difference Result 138838 states and 220646 transitions. [2019-09-08 08:19:39,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:19:39,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-08 08:19:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:40,273 INFO L225 Difference]: With dead ends: 138838 [2019-09-08 08:19:40,273 INFO L226 Difference]: Without dead ends: 92556 [2019-09-08 08:19:40,391 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:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92556 states. [2019-09-08 08:19:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92556 to 91932. [2019-09-08 08:19:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91932 states. [2019-09-08 08:19:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91932 states to 91932 states and 145795 transitions. [2019-09-08 08:19:42,675 INFO L78 Accepts]: Start accepts. Automaton has 91932 states and 145795 transitions. Word has length 161 [2019-09-08 08:19:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:42,675 INFO L475 AbstractCegarLoop]: Abstraction has 91932 states and 145795 transitions. [2019-09-08 08:19:42,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:19:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 91932 states and 145795 transitions. [2019-09-08 08:19:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 08:19:42,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:42,689 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:42,690 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:42,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1523949593, now seen corresponding path program 1 times [2019-09-08 08:19:42,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:42,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:42,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:42,868 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:42,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:42,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:19:42,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:19:42,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:19:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:19:42,870 INFO L87 Difference]: Start difference. First operand 91932 states and 145795 transitions. Second operand 6 states. [2019-09-08 08:19:45,975 WARN L188 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 9 [2019-09-08 08:19:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:46,997 INFO L93 Difference]: Finished difference Result 159516 states and 254101 transitions. [2019-09-08 08:19:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:19:46,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-08 08:19:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:47,384 INFO L225 Difference]: With dead ends: 159516 [2019-09-08 08:19:47,384 INFO L226 Difference]: Without dead ends: 97374 [2019-09-08 08:19:47,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:19:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97374 states. [2019-09-08 08:19:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97374 to 92164. [2019-09-08 08:19:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92164 states. [2019-09-08 08:19:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92164 states to 92164 states and 145795 transitions. [2019-09-08 08:19:49,925 INFO L78 Accepts]: Start accepts. Automaton has 92164 states and 145795 transitions. Word has length 161 [2019-09-08 08:19:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:49,925 INFO L475 AbstractCegarLoop]: Abstraction has 92164 states and 145795 transitions. [2019-09-08 08:19:49,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:19:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 92164 states and 145795 transitions. [2019-09-08 08:19:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 08:19:49,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:49,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:19:49,939 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:49,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1042735562, now seen corresponding path program 1 times [2019-09-08 08:19:49,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:49,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:49,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:49,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:49,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:50,092 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:50,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:50,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:19:50,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:19:50,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:19:50,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:19:50,094 INFO L87 Difference]: Start difference. First operand 92164 states and 145795 transitions. Second operand 7 states. [2019-09-08 08:19:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:53,984 INFO L93 Difference]: Finished difference Result 160980 states and 255689 transitions. [2019-09-08 08:19:53,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:19:53,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 162 [2019-09-08 08:19:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:54,333 INFO L225 Difference]: With dead ends: 160980 [2019-09-08 08:19:54,333 INFO L226 Difference]: Without dead ends: 96692 [2019-09-08 08:19:56,593 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:19:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96692 states. [2019-09-08 08:19:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96692 to 78362. [2019-09-08 08:19:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78362 states. [2019-09-08 08:19:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78362 states to 78362 states and 123947 transitions. [2019-09-08 08:19:58,254 INFO L78 Accepts]: Start accepts. Automaton has 78362 states and 123947 transitions. Word has length 162 [2019-09-08 08:19:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:58,254 INFO L475 AbstractCegarLoop]: Abstraction has 78362 states and 123947 transitions. [2019-09-08 08:19:58,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:19:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 78362 states and 123947 transitions. [2019-09-08 08:19:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 08:19:58,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:58,266 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:19:58,266 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1395823944, now seen corresponding path program 1 times [2019-09-08 08:19:58,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:58,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:58,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:58,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:58,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:58,504 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:58,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:58,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 08:19:58,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 08:19:58,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 08:19:58,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:19:58,506 INFO L87 Difference]: Start difference. First operand 78362 states and 123947 transitions. Second operand 12 states. [2019-09-08 08:20:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:20:12,814 INFO L93 Difference]: Finished difference Result 208284 states and 336231 transitions. [2019-09-08 08:20:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 08:20:12,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 162 [2019-09-08 08:20:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:13,325 INFO L225 Difference]: With dead ends: 208284 [2019-09-08 08:20:13,325 INFO L226 Difference]: Without dead ends: 177000 [2019-09-08 08:20:13,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 08:20:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177000 states. [2019-09-08 08:20:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177000 to 166722. [2019-09-08 08:20:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166722 states. [2019-09-08 08:20:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166722 states to 166722 states and 267964 transitions. [2019-09-08 08:20:20,058 INFO L78 Accepts]: Start accepts. Automaton has 166722 states and 267964 transitions. Word has length 162 [2019-09-08 08:20:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:20:20,058 INFO L475 AbstractCegarLoop]: Abstraction has 166722 states and 267964 transitions. [2019-09-08 08:20:20,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 08:20:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 166722 states and 267964 transitions. [2019-09-08 08:20:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 08:20:20,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:20:20,065 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:20,065 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:20:20,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:20:20,065 INFO L82 PathProgramCache]: Analyzing trace with hash 360887909, now seen corresponding path program 1 times [2019-09-08 08:20:20,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:20:20,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:20:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:20,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:20:20,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:20:20,202 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:20,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:20:20,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:20:20,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:20:20,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:20:20,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:20:20,204 INFO L87 Difference]: Start difference. First operand 166722 states and 267964 transitions. Second operand 6 states. [2019-09-08 08:20:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:20:32,696 INFO L93 Difference]: Finished difference Result 498769 states and 802835 transitions. [2019-09-08 08:20:32,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:20:32,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-08 08:20:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:33,505 INFO L225 Difference]: With dead ends: 498769 [2019-09-08 08:20:33,505 INFO L226 Difference]: Without dead ends: 333205 [2019-09-08 08:20:33,696 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:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333205 states. [2019-09-08 08:20:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333205 to 330994. [2019-09-08 08:20:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330994 states. [2019-09-08 08:20:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330994 states to 330994 states and 532040 transitions. [2019-09-08 08:20:47,043 INFO L78 Accepts]: Start accepts. Automaton has 330994 states and 532040 transitions. Word has length 162 [2019-09-08 08:20:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:20:47,043 INFO L475 AbstractCegarLoop]: Abstraction has 330994 states and 532040 transitions. [2019-09-08 08:20:47,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:20:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 330994 states and 532040 transitions. [2019-09-08 08:20:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 08:20:47,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:20:47,053 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:20:47,053 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:20:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:20:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1706567795, now seen corresponding path program 1 times [2019-09-08 08:20:47,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:20:47,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:20:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:47,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:20:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:20:47,286 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:47,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:20:47,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:20:47,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:20:47,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:20:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:20:47,288 INFO L87 Difference]: Start difference. First operand 330994 states and 532040 transitions. Second operand 6 states. [2019-09-08 08:21:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:01,638 INFO L93 Difference]: Finished difference Result 584493 states and 941481 transitions. [2019-09-08 08:21:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:21:01,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-08 08:21:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:02,565 INFO L225 Difference]: With dead ends: 584493 [2019-09-08 08:21:02,566 INFO L226 Difference]: Without dead ends: 338355 [2019-09-08 08:21:02,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:21:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338355 states. [2019-09-08 08:21:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338355 to 330737. [2019-09-08 08:21:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330737 states. [2019-09-08 08:21:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330737 states to 330737 states and 530990 transitions. [2019-09-08 08:21:13,260 INFO L78 Accepts]: Start accepts. Automaton has 330737 states and 530990 transitions. Word has length 163 [2019-09-08 08:21:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:13,260 INFO L475 AbstractCegarLoop]: Abstraction has 330737 states and 530990 transitions. [2019-09-08 08:21:13,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:21:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 330737 states and 530990 transitions. [2019-09-08 08:21:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 08:21:13,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:13,266 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:13,266 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:13,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1818161165, now seen corresponding path program 1 times [2019-09-08 08:21:13,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:13,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:13,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:13,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:13,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:13,507 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:13,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:13,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:21:13,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:21:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:21:13,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:13,509 INFO L87 Difference]: Start difference. First operand 330737 states and 530990 transitions. Second operand 6 states. [2019-09-08 08:21:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:30,173 INFO L93 Difference]: Finished difference Result 612363 states and 1007113 transitions. [2019-09-08 08:21:30,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:21:30,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-08 08:21:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:31,348 INFO L225 Difference]: With dead ends: 612363 [2019-09-08 08:21:31,349 INFO L226 Difference]: Without dead ends: 361457 [2019-09-08 08:21:31,649 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:21:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361457 states. [2019-09-08 08:21:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361457 to 333235. [2019-09-08 08:21:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333235 states. [2019-09-08 08:21:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333235 states to 333235 states and 534572 transitions. [2019-09-08 08:21:48,862 INFO L78 Accepts]: Start accepts. Automaton has 333235 states and 534572 transitions. Word has length 163 [2019-09-08 08:21:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:48,863 INFO L475 AbstractCegarLoop]: Abstraction has 333235 states and 534572 transitions. [2019-09-08 08:21:48,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:21:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 333235 states and 534572 transitions. [2019-09-08 08:21:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 08:21:48,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:48,868 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:48,868 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash -551243473, now seen corresponding path program 1 times [2019-09-08 08:21:48,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:48,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:48,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:48,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:48,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:49,024 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:49,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:49,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:21:49,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:21:49,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:21:49,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:49,025 INFO L87 Difference]: Start difference. First operand 333235 states and 534572 transitions. Second operand 6 states. [2019-09-08 08:22:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:18,171 INFO L93 Difference]: Finished difference Result 1138361 states and 1831644 transitions. [2019-09-08 08:22:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:22:18,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-08 08:22:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:21,158 INFO L225 Difference]: With dead ends: 1138361 [2019-09-08 08:22:21,158 INFO L226 Difference]: Without dead ends: 805915 [2019-09-08 08:22:21,632 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:22:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805915 states. [2019-09-08 08:23:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805915 to 613848. [2019-09-08 08:23:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613848 states. [2019-09-08 08:23:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613848 states to 613848 states and 988714 transitions. [2019-09-08 08:23:03,154 INFO L78 Accepts]: Start accepts. Automaton has 613848 states and 988714 transitions. Word has length 163 [2019-09-08 08:23:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:23:03,155 INFO L475 AbstractCegarLoop]: Abstraction has 613848 states and 988714 transitions. [2019-09-08 08:23:03,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:23:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 613848 states and 988714 transitions. [2019-09-08 08:23:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 08:23:03,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:23:03,158 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:23:03,158 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:23:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:23:03,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1283695039, now seen corresponding path program 1 times [2019-09-08 08:23:03,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:23:03,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:23:03,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:03,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:23:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:23:03,263 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:23:03,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:23:03,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:23:03,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:23:03,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:23:03,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:23:03,265 INFO L87 Difference]: Start difference. First operand 613848 states and 988714 transitions. Second operand 5 states. [2019-09-08 08:23:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:23:49,389 INFO L93 Difference]: Finished difference Result 1568092 states and 2543979 transitions. [2019-09-08 08:23:49,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:23:49,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-09-08 08:23:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:23:53,665 INFO L225 Difference]: With dead ends: 1568092 [2019-09-08 08:23:53,665 INFO L226 Difference]: Without dead ends: 1077134 [2019-09-08 08:23:54,301 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:23:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077134 states. [2019-09-08 08:24:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077134 to 1070091. [2019-09-08 08:24:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070091 states. [2019-09-08 08:25:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070091 states to 1070091 states and 1731988 transitions. [2019-09-08 08:25:03,498 INFO L78 Accepts]: Start accepts. Automaton has 1070091 states and 1731988 transitions. Word has length 164 [2019-09-08 08:25:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:25:03,499 INFO L475 AbstractCegarLoop]: Abstraction has 1070091 states and 1731988 transitions. [2019-09-08 08:25:03,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:25:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1070091 states and 1731988 transitions. [2019-09-08 08:25:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 08:25:03,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:25:03,502 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:25:03,503 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:25:03,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:25:03,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1625068863, now seen corresponding path program 1 times [2019-09-08 08:25:03,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:25:03,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:25:03,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:03,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:25:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:25:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:25:03,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:25:03,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 08:25:03,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 08:25:03,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 08:25:03,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:25:03,747 INFO L87 Difference]: Start difference. First operand 1070091 states and 1731988 transitions. Second operand 12 states. [2019-09-08 08:26:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:26:30,601 INFO L93 Difference]: Finished difference Result 2433425 states and 3950055 transitions. [2019-09-08 08:26:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 08:26:30,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-09-08 08:26:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:26:37,189 INFO L225 Difference]: With dead ends: 2433425 [2019-09-08 08:26:37,190 INFO L226 Difference]: Without dead ends: 1740145 [2019-09-08 08:26:39,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 08:26:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740145 states.