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_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:45:02,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:45:02,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:45:02,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:45:02,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:45:02,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:45:02,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:45:02,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:45:02,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:45:02,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:45:02,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:45:02,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:45:02,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:45:02,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:45:02,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:45:02,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:45:02,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:45:02,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:45:02,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:45:02,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:45:02,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:45:02,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:45:02,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:45:02,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:45:02,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:45:02,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:45:02,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:45:02,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:45:02,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:45:02,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:45:02,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:45:02,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:45:02,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:45:02,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:45:02,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:45:02,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:45:02,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:45:02,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:45:02,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:45:02,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:45:02,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:45:02,419 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 07:45:02,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:45:02,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:45:02,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:45:02,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:45:02,437 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:45:02,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:45:02,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:45:02,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:45:02,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:45:02,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:45:02,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:45:02,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:45:02,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:45:02,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:45:02,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:45:02,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:45:02,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:45:02,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:45:02,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:45:02,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:45:02,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:45:02,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:45:02,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:45:02,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:45:02,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:45:02,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:45:02,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:45:02,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:45:02,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:45:02,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:45:02,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:45:02,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:45:02,512 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:45:02,512 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:45:02,513 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2019-09-08 07:45:02,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cfabad95/d6c4c6e42ed24db3a2987107d0a0de27/FLAGb63ec2d58 [2019-09-08 07:45:03,091 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:45:03,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2019-09-08 07:45:03,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cfabad95/d6c4c6e42ed24db3a2987107d0a0de27/FLAGb63ec2d58 [2019-09-08 07:45:03,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cfabad95/d6c4c6e42ed24db3a2987107d0a0de27 [2019-09-08 07:45:03,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:45:03,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:45:03,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:45:03,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:45:03,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:45:03,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:45:03" (1/1) ... [2019-09-08 07:45:03,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b36607d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03, skipping insertion in model container [2019-09-08 07:45:03,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:45:03" (1/1) ... [2019-09-08 07:45:03,433 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:45:03,492 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:45:03,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:45:03,874 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:45:03,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:45:03,983 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:45:03,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03 WrapperNode [2019-09-08 07:45:03,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:45:03,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:45:03,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:45:03,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:45:03,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03" (1/1) ... [2019-09-08 07:45:03,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03" (1/1) ... [2019-09-08 07:45:04,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03" (1/1) ... [2019-09-08 07:45:04,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03" (1/1) ... [2019-09-08 07:45:04,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03" (1/1) ... [2019-09-08 07:45:04,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03" (1/1) ... [2019-09-08 07:45:04,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03" (1/1) ... [2019-09-08 07:45:04,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:45:04,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:45:04,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:45:04,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:45:04,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03" (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 07:45:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:45:04,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:45:04,098 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:45:04,098 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:45:04,098 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:45:04,098 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:45:04,098 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 07:45:04,099 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-08 07:45:04,099 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:45:04,099 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:45:04,099 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:45:04,099 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:45:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:45:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:45:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:45:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:45:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:45:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:45:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:45:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:45:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:45:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:45:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:45:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 07:45:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 07:45:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:45:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:45:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:45:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:45:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:45:04,915 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:45:04,916 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:45:04,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:45:04 BoogieIcfgContainer [2019-09-08 07:45:04,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:45:04,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:45:04,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:45:04,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:45:04,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:45:03" (1/3) ... [2019-09-08 07:45:04,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a040304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:45:04, skipping insertion in model container [2019-09-08 07:45:04,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:45:03" (2/3) ... [2019-09-08 07:45:04,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a040304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:45:04, skipping insertion in model container [2019-09-08 07:45:04,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:45:04" (3/3) ... [2019-09-08 07:45:04,928 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2019-09-08 07:45:04,938 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:45:04,944 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:45:04,960 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:45:04,999 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:45:05,000 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:45:05,000 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:45:05,000 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:45:05,000 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:45:05,000 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:45:05,001 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:45:05,001 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:45:05,001 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:45:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2019-09-08 07:45:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 07:45:05,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:05,032 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] [2019-09-08 07:45:05,034 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1218527924, now seen corresponding path program 1 times [2019-09-08 07:45:05,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:05,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:05,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:05,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:05,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:05,470 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 07:45:05,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:05,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:45:05,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:45:05,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:45:05,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:45:05,495 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 5 states. [2019-09-08 07:45:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:05,685 INFO L93 Difference]: Finished difference Result 309 states and 469 transitions. [2019-09-08 07:45:05,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:45:05,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 07:45:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:05,710 INFO L225 Difference]: With dead ends: 309 [2019-09-08 07:45:05,711 INFO L226 Difference]: Without dead ends: 174 [2019-09-08 07:45:05,718 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 07:45:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-08 07:45:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-09-08 07:45:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-08 07:45:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2019-09-08 07:45:05,768 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 68 [2019-09-08 07:45:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:05,768 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2019-09-08 07:45:05,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:45:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2019-09-08 07:45:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 07:45:05,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:05,774 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] [2019-09-08 07:45:05,774 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1659078954, now seen corresponding path program 1 times [2019-09-08 07:45:05,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:05,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:05,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:05,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:05,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:06,264 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 07:45:06,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:06,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 07:45:06,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 07:45:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 07:45:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:45:06,269 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand 15 states. [2019-09-08 07:45:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:14,498 INFO L93 Difference]: Finished difference Result 1866 states and 2864 transitions. [2019-09-08 07:45:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 07:45:14,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-09-08 07:45:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:14,532 INFO L225 Difference]: With dead ends: 1866 [2019-09-08 07:45:14,532 INFO L226 Difference]: Without dead ends: 1745 [2019-09-08 07:45:14,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1105, Invalid=3865, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 07:45:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-09-08 07:45:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1162. [2019-09-08 07:45:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-09-08 07:45:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1713 transitions. [2019-09-08 07:45:14,733 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1713 transitions. Word has length 108 [2019-09-08 07:45:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:14,737 INFO L475 AbstractCegarLoop]: Abstraction has 1162 states and 1713 transitions. [2019-09-08 07:45:14,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 07:45:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1713 transitions. [2019-09-08 07:45:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 07:45:14,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:14,752 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] [2019-09-08 07:45:14,752 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:14,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1362325190, now seen corresponding path program 1 times [2019-09-08 07:45:14,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:14,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:14,937 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 07:45:14,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:14,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 07:45:14,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 07:45:14,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 07:45:14,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:45:14,945 INFO L87 Difference]: Start difference. First operand 1162 states and 1713 transitions. Second operand 8 states. [2019-09-08 07:45:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:15,089 INFO L93 Difference]: Finished difference Result 1353 states and 2028 transitions. [2019-09-08 07:45:15,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:45:15,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2019-09-08 07:45:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:15,102 INFO L225 Difference]: With dead ends: 1353 [2019-09-08 07:45:15,102 INFO L226 Difference]: Without dead ends: 1351 [2019-09-08 07:45:15,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:45:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-08 07:45:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1243. [2019-09-08 07:45:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-09-08 07:45:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1794 transitions. [2019-09-08 07:45:15,193 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1794 transitions. Word has length 109 [2019-09-08 07:45:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:15,195 INFO L475 AbstractCegarLoop]: Abstraction has 1243 states and 1794 transitions. [2019-09-08 07:45:15,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 07:45:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1794 transitions. [2019-09-08 07:45:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 07:45:15,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:15,199 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] [2019-09-08 07:45:15,199 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:15,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1962088830, now seen corresponding path program 1 times [2019-09-08 07:45:15,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:15,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:15,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:15,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:15,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:15,411 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 07:45:15,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:15,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:45:15,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:45:15,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:45:15,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:45:15,413 INFO L87 Difference]: Start difference. First operand 1243 states and 1794 transitions. Second operand 7 states. [2019-09-08 07:45:16,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:16,358 INFO L93 Difference]: Finished difference Result 5697 states and 8367 transitions. [2019-09-08 07:45:16,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:45:16,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2019-09-08 07:45:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:16,381 INFO L225 Difference]: With dead ends: 5697 [2019-09-08 07:45:16,382 INFO L226 Difference]: Without dead ends: 4507 [2019-09-08 07:45:16,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:45:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-09-08 07:45:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4501. [2019-09-08 07:45:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4501 states. [2019-09-08 07:45:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6556 transitions. [2019-09-08 07:45:16,615 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6556 transitions. Word has length 110 [2019-09-08 07:45:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:16,616 INFO L475 AbstractCegarLoop]: Abstraction has 4501 states and 6556 transitions. [2019-09-08 07:45:16,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:45:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6556 transitions. [2019-09-08 07:45:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 07:45:16,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:16,621 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] [2019-09-08 07:45:16,621 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1490326786, now seen corresponding path program 1 times [2019-09-08 07:45:16,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:16,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:16,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:16,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:16,769 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 07:45:16,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:16,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:45:16,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:45:16,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:45:16,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:45:16,771 INFO L87 Difference]: Start difference. First operand 4501 states and 6556 transitions. Second operand 9 states. [2019-09-08 07:45:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:18,043 INFO L93 Difference]: Finished difference Result 11180 states and 16348 transitions. [2019-09-08 07:45:18,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:45:18,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-08 07:45:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:18,089 INFO L225 Difference]: With dead ends: 11180 [2019-09-08 07:45:18,089 INFO L226 Difference]: Without dead ends: 6732 [2019-09-08 07:45:18,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:45:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2019-09-08 07:45:18,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 4658. [2019-09-08 07:45:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4658 states. [2019-09-08 07:45:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 6779 transitions. [2019-09-08 07:45:18,435 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 6779 transitions. Word has length 111 [2019-09-08 07:45:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:18,436 INFO L475 AbstractCegarLoop]: Abstraction has 4658 states and 6779 transitions. [2019-09-08 07:45:18,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:45:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 6779 transitions. [2019-09-08 07:45:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 07:45:18,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:18,441 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] [2019-09-08 07:45:18,441 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:18,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:18,442 INFO L82 PathProgramCache]: Analyzing trace with hash -630466114, now seen corresponding path program 1 times [2019-09-08 07:45:18,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:18,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:18,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:18,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:18,605 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 07:45:18,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:18,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:45:18,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:45:18,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:45:18,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:45:18,606 INFO L87 Difference]: Start difference. First operand 4658 states and 6779 transitions. Second operand 9 states. [2019-09-08 07:45:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:19,713 INFO L93 Difference]: Finished difference Result 10711 states and 15586 transitions. [2019-09-08 07:45:19,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:45:19,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-08 07:45:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:19,744 INFO L225 Difference]: With dead ends: 10711 [2019-09-08 07:45:19,745 INFO L226 Difference]: Without dead ends: 6225 [2019-09-08 07:45:19,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:45:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6225 states. [2019-09-08 07:45:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6225 to 4745. [2019-09-08 07:45:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2019-09-08 07:45:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 6901 transitions. [2019-09-08 07:45:20,010 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 6901 transitions. Word has length 111 [2019-09-08 07:45:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:20,010 INFO L475 AbstractCegarLoop]: Abstraction has 4745 states and 6901 transitions. [2019-09-08 07:45:20,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:45:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 6901 transitions. [2019-09-08 07:45:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 07:45:20,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:20,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:45:20,015 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:20,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:20,015 INFO L82 PathProgramCache]: Analyzing trace with hash 482955028, now seen corresponding path program 1 times [2019-09-08 07:45:20,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:20,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:20,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:20,145 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 07:45:20,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:20,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:45:20,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:45:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:45:20,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:45:20,147 INFO L87 Difference]: Start difference. First operand 4745 states and 6901 transitions. Second operand 9 states. [2019-09-08 07:45:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:21,277 INFO L93 Difference]: Finished difference Result 10169 states and 14752 transitions. [2019-09-08 07:45:21,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:45:21,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-08 07:45:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:21,325 INFO L225 Difference]: With dead ends: 10169 [2019-09-08 07:45:21,325 INFO L226 Difference]: Without dead ends: 5681 [2019-09-08 07:45:21,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:45:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-09-08 07:45:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 4832. [2019-09-08 07:45:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4832 states. [2019-09-08 07:45:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 7023 transitions. [2019-09-08 07:45:21,625 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 7023 transitions. Word has length 111 [2019-09-08 07:45:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:21,625 INFO L475 AbstractCegarLoop]: Abstraction has 4832 states and 7023 transitions. [2019-09-08 07:45:21,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:45:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 7023 transitions. [2019-09-08 07:45:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 07:45:21,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:21,629 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] [2019-09-08 07:45:21,629 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash -377390433, now seen corresponding path program 1 times [2019-09-08 07:45:21,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:21,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:21,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:21,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:21,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:21,764 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 07:45:21,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:21,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:45:21,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:45:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:45:21,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:45:21,766 INFO L87 Difference]: Start difference. First operand 4832 states and 7023 transitions. Second operand 9 states. [2019-09-08 07:45:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:23,184 INFO L93 Difference]: Finished difference Result 9627 states and 13918 transitions. [2019-09-08 07:45:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:45:23,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-08 07:45:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:23,203 INFO L225 Difference]: With dead ends: 9627 [2019-09-08 07:45:23,203 INFO L226 Difference]: Without dead ends: 5137 [2019-09-08 07:45:23,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:45:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2019-09-08 07:45:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 4917. [2019-09-08 07:45:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4917 states. [2019-09-08 07:45:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4917 states to 4917 states and 7143 transitions. [2019-09-08 07:45:23,436 INFO L78 Accepts]: Start accepts. Automaton has 4917 states and 7143 transitions. Word has length 111 [2019-09-08 07:45:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:23,436 INFO L475 AbstractCegarLoop]: Abstraction has 4917 states and 7143 transitions. [2019-09-08 07:45:23,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:45:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 7143 transitions. [2019-09-08 07:45:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 07:45:23,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:23,440 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] [2019-09-08 07:45:23,440 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:23,440 INFO L82 PathProgramCache]: Analyzing trace with hash 308453418, now seen corresponding path program 1 times [2019-09-08 07:45:23,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:23,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:23,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:23,594 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 07:45:23,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:23,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:45:23,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:45:23,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:45:23,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:45:23,595 INFO L87 Difference]: Start difference. First operand 4917 states and 7143 transitions. Second operand 9 states. [2019-09-08 07:45:24,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:24,617 INFO L93 Difference]: Finished difference Result 12321 states and 18003 transitions. [2019-09-08 07:45:24,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:45:24,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-08 07:45:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:24,703 INFO L225 Difference]: With dead ends: 12321 [2019-09-08 07:45:24,704 INFO L226 Difference]: Without dead ends: 7522 [2019-09-08 07:45:24,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:45:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-09-08 07:45:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 5559. [2019-09-08 07:45:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5559 states. [2019-09-08 07:45:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 8127 transitions. [2019-09-08 07:45:24,971 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 8127 transitions. Word has length 111 [2019-09-08 07:45:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:24,971 INFO L475 AbstractCegarLoop]: Abstraction has 5559 states and 8127 transitions. [2019-09-08 07:45:24,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:45:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 8127 transitions. [2019-09-08 07:45:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 07:45:24,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:24,975 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] [2019-09-08 07:45:24,975 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1893422644, now seen corresponding path program 1 times [2019-09-08 07:45:24,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:24,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:24,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:24,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:24,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:25,099 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 07:45:25,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:45:25,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:45:25,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:45:25,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:45:25,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:45:25,101 INFO L87 Difference]: Start difference. First operand 5559 states and 8127 transitions. Second operand 9 states. [2019-09-08 07:45:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:26,156 INFO L93 Difference]: Finished difference Result 11596 states and 17089 transitions. [2019-09-08 07:45:26,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:45:26,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-08 07:45:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:26,185 INFO L225 Difference]: With dead ends: 11596 [2019-09-08 07:45:26,186 INFO L226 Difference]: Without dead ends: 7583 [2019-09-08 07:45:26,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:45:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2019-09-08 07:45:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 5186. [2019-09-08 07:45:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5186 states. [2019-09-08 07:45:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7579 transitions. [2019-09-08 07:45:26,496 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 7579 transitions. Word has length 111 [2019-09-08 07:45:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:26,497 INFO L475 AbstractCegarLoop]: Abstraction has 5186 states and 7579 transitions. [2019-09-08 07:45:26,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:45:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 7579 transitions. [2019-09-08 07:45:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 07:45:26,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:26,504 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:45:26,504 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:26,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:26,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1557071076, now seen corresponding path program 1 times [2019-09-08 07:45:26,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:26,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:26,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:26,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:26,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 07:45:26,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:45:26,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:45:26,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:26,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 07:45:26,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:45:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 07:45:26,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:45:26,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 07:45:26,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 07:45:26,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 07:45:26,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:45:26,973 INFO L87 Difference]: Start difference. First operand 5186 states and 7579 transitions. Second operand 8 states. [2019-09-08 07:45:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:28,487 INFO L93 Difference]: Finished difference Result 10789 states and 15757 transitions. [2019-09-08 07:45:28,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:45:28,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 168 [2019-09-08 07:45:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:28,528 INFO L225 Difference]: With dead ends: 10789 [2019-09-08 07:45:28,529 INFO L226 Difference]: Without dead ends: 7404 [2019-09-08 07:45:28,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:45:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7404 states. [2019-09-08 07:45:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7404 to 6852. [2019-09-08 07:45:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6852 states. [2019-09-08 07:45:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 9885 transitions. [2019-09-08 07:45:29,051 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 9885 transitions. Word has length 168 [2019-09-08 07:45:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:29,051 INFO L475 AbstractCegarLoop]: Abstraction has 6852 states and 9885 transitions. [2019-09-08 07:45:29,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 07:45:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 9885 transitions. [2019-09-08 07:45:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 07:45:29,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:29,058 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:45:29,058 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:29,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash 17895358, now seen corresponding path program 1 times [2019-09-08 07:45:29,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:29,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:29,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:29,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:29,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 07:45:29,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:45:29,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:45:29,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:45:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:29,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:45:29,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:45:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:45:29,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:45:29,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 07:45:29,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:45:29,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:45:29,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:45:29,698 INFO L87 Difference]: Start difference. First operand 6852 states and 9885 transitions. Second operand 13 states. [2019-09-08 07:45:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:33,235 INFO L93 Difference]: Finished difference Result 38699 states and 56435 transitions. [2019-09-08 07:45:33,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 07:45:33,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 170 [2019-09-08 07:45:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:33,341 INFO L225 Difference]: With dead ends: 38699 [2019-09-08 07:45:33,341 INFO L226 Difference]: Without dead ends: 31998 [2019-09-08 07:45:33,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=498, Invalid=1394, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 07:45:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31998 states. [2019-09-08 07:45:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31998 to 22584. [2019-09-08 07:45:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22584 states. [2019-09-08 07:45:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22584 states to 22584 states and 32204 transitions. [2019-09-08 07:45:34,973 INFO L78 Accepts]: Start accepts. Automaton has 22584 states and 32204 transitions. Word has length 170 [2019-09-08 07:45:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:34,976 INFO L475 AbstractCegarLoop]: Abstraction has 22584 states and 32204 transitions. [2019-09-08 07:45:34,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:45:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 22584 states and 32204 transitions. [2019-09-08 07:45:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 07:45:34,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:34,985 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:45:34,986 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1424558670, now seen corresponding path program 1 times [2019-09-08 07:45:34,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:34,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:34,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 07:45:35,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:45:35,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:45:35,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:35,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:45:35,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:45:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 07:45:35,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:45:35,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 07:45:35,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:45:35,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:45:35,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:45:35,499 INFO L87 Difference]: Start difference. First operand 22584 states and 32204 transitions. Second operand 13 states. [2019-09-08 07:45:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:45:41,163 INFO L93 Difference]: Finished difference Result 116307 states and 167555 transitions. [2019-09-08 07:45:41,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 07:45:41,164 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 171 [2019-09-08 07:45:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:45:41,508 INFO L225 Difference]: With dead ends: 116307 [2019-09-08 07:45:41,509 INFO L226 Difference]: Without dead ends: 94015 [2019-09-08 07:45:41,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=498, Invalid=1394, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 07:45:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94015 states. [2019-09-08 07:45:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94015 to 73000. [2019-09-08 07:45:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73000 states. [2019-09-08 07:45:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73000 states to 73000 states and 102821 transitions. [2019-09-08 07:45:45,288 INFO L78 Accepts]: Start accepts. Automaton has 73000 states and 102821 transitions. Word has length 171 [2019-09-08 07:45:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:45:45,289 INFO L475 AbstractCegarLoop]: Abstraction has 73000 states and 102821 transitions. [2019-09-08 07:45:45,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:45:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 73000 states and 102821 transitions. [2019-09-08 07:45:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 07:45:45,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:45:45,317 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:45:45,318 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:45:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:45:45,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1843635704, now seen corresponding path program 1 times [2019-09-08 07:45:45,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:45:45,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:45:45,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:45,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:45,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:45:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 07:45:46,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:45:46,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:45:46,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:45:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:45:47,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:45:47,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:45:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:45:47,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:45:47,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 07:45:47,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:45:47,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:45:47,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:45:47,221 INFO L87 Difference]: Start difference. First operand 73000 states and 102821 transitions. Second operand 13 states. [2019-09-08 07:46:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:46:01,753 INFO L93 Difference]: Finished difference Result 344437 states and 488726 transitions. [2019-09-08 07:46:01,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 07:46:01,753 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 172 [2019-09-08 07:46:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:46:02,413 INFO L225 Difference]: With dead ends: 344437 [2019-09-08 07:46:02,413 INFO L226 Difference]: Without dead ends: 272050 [2019-09-08 07:46:02,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=498, Invalid=1394, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 07:46:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272050 states. [2019-09-08 07:46:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272050 to 234774. [2019-09-08 07:46:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234774 states. [2019-09-08 07:46:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234774 states to 234774 states and 327172 transitions. [2019-09-08 07:46:18,677 INFO L78 Accepts]: Start accepts. Automaton has 234774 states and 327172 transitions. Word has length 172 [2019-09-08 07:46:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:46:18,678 INFO L475 AbstractCegarLoop]: Abstraction has 234774 states and 327172 transitions. [2019-09-08 07:46:18,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:46:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 234774 states and 327172 transitions. [2019-09-08 07:46:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 07:46:18,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:46:18,724 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:46:18,725 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:46:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:46:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash -527683337, now seen corresponding path program 1 times [2019-09-08 07:46:18,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:46:18,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:46:18,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:46:18,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:46:18,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:46:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:46:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 07:46:18,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:46:18,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:46:18,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:46:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:46:19,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:46:19,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:46:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:46:19,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:46:19,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 07:46:19,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:46:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:46:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:46:19,289 INFO L87 Difference]: Start difference. First operand 234774 states and 327172 transitions. Second operand 13 states. [2019-09-08 07:46:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:46:57,894 INFO L93 Difference]: Finished difference Result 1019427 states and 1424293 transitions. [2019-09-08 07:46:57,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 07:46:57,895 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2019-09-08 07:46:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:47:06,826 INFO L225 Difference]: With dead ends: 1019427 [2019-09-08 07:47:06,826 INFO L226 Difference]: Without dead ends: 785923 [2019-09-08 07:47:07,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=498, Invalid=1394, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 07:47:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785923 states. [2019-09-08 07:48:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785923 to 751420. [2019-09-08 07:48:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751420 states. [2019-09-08 07:48:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751420 states to 751420 states and 1037579 transitions. [2019-09-08 07:48:15,371 INFO L78 Accepts]: Start accepts. Automaton has 751420 states and 1037579 transitions. Word has length 173 [2019-09-08 07:48:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:48:15,372 INFO L475 AbstractCegarLoop]: Abstraction has 751420 states and 1037579 transitions. [2019-09-08 07:48:15,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:48:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 751420 states and 1037579 transitions. [2019-09-08 07:48:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 07:48:15,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:48:15,511 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:48:15,511 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:48:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:48:15,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1009852736, now seen corresponding path program 1 times [2019-09-08 07:48:15,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:48:15,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:48:15,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:48:15,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:48:15,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:48:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:48:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 07:48:15,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:48:15,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:48:15,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:48:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:48:15,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 07:48:15,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:48:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:48:15,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:48:15,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-08 07:48:15,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:48:15,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:48:15,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:48:15,829 INFO L87 Difference]: Start difference. First operand 751420 states and 1037579 transitions. Second operand 4 states. [2019-09-08 07:49:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:49:43,102 INFO L93 Difference]: Finished difference Result 1882250 states and 2606368 transitions. [2019-09-08 07:49:43,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:49:43,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-08 07:49:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:49:47,098 INFO L225 Difference]: With dead ends: 1882250 [2019-09-08 07:49:47,099 INFO L226 Difference]: Without dead ends: 1133153 [2019-09-08 07:49:47,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:49:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133153 states. [2019-09-08 07:51:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133153 to 1129441. [2019-09-08 07:51:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129441 states.