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.4.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:35:13,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:35:13,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:35:13,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:35:13,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:35:13,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:35:13,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:35:13,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:35:13,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:35:13,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:35:13,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:35:13,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:35:13,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:35:13,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:35:13,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:35:13,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:35:13,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:35:13,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:35:13,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:35:13,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:35:13,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:35:13,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:35:13,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:35:13,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:35:13,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:35:13,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:35:13,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:35:13,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:35:13,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:35:13,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:35:13,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:35:13,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:35:13,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:35:13,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:35:13,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:35:13,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:35:13,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:35:13,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:35:13,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:35:13,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:35:13,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:35:13,564 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:35:13,593 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:35:13,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:35:13,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:35:13,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:35:13,597 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:35:13,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:35:13,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:35:13,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:35:13,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:35:13,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:35:13,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:35:13,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:35:13,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:35:13,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:35:13,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:35:13,600 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:35:13,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:35:13,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:35:13,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:35:13,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:35:13,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:35:13,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:35:13,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:35:13,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:35:13,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:35:13,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:35:13,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:35:13,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:35:13,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:35:13,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:35:13,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:35:13,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:35:13,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:35:13,652 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:35:13,652 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.4.1.ufo.UNBOUNDED.pals.c [2019-09-08 07:35:13,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49604097c/b1e2e76d77a148ddb12001ae74aa37eb/FLAGbe1b552c9 [2019-09-08 07:35:14,192 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:35:14,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2019-09-08 07:35:14,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49604097c/b1e2e76d77a148ddb12001ae74aa37eb/FLAGbe1b552c9 [2019-09-08 07:35:14,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49604097c/b1e2e76d77a148ddb12001ae74aa37eb [2019-09-08 07:35:14,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:35:14,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:35:14,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:35:14,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:35:14,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:35:14,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:35:14" (1/1) ... [2019-09-08 07:35:14,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d0047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:14, skipping insertion in model container [2019-09-08 07:35:14,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:35:14" (1/1) ... [2019-09-08 07:35:14,547 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:35:14,587 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:35:14,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:35:14,924 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:35:14,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:35:15,005 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:35:15,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15 WrapperNode [2019-09-08 07:35:15,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:35:15,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:35:15,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:35:15,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:35:15,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15" (1/1) ... [2019-09-08 07:35:15,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15" (1/1) ... [2019-09-08 07:35:15,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15" (1/1) ... [2019-09-08 07:35:15,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15" (1/1) ... [2019-09-08 07:35:15,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15" (1/1) ... [2019-09-08 07:35:15,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15" (1/1) ... [2019-09-08 07:35:15,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15" (1/1) ... [2019-09-08 07:35:15,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:35:15,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:35:15,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:35:15,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:35:15,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15" (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:35:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:35:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:35:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:35:15,118 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:35:15,118 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:35:15,118 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:35:15,118 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:35:15,118 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:35:15,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:35:15,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:35:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:35:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:35:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:35:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:35:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:35:15,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:35:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:35:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:35:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:35:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:35:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:35:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:35:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:35:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:35:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:35:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:35:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:35:15,740 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:35:15,740 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:35:15,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:35:15 BoogieIcfgContainer [2019-09-08 07:35:15,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:35:15,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:35:15,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:35:15,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:35:15,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:35:14" (1/3) ... [2019-09-08 07:35:15,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404968f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:35:15, skipping insertion in model container [2019-09-08 07:35:15,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:35:15" (2/3) ... [2019-09-08 07:35:15,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404968f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:35:15, skipping insertion in model container [2019-09-08 07:35:15,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:35:15" (3/3) ... [2019-09-08 07:35:15,753 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2019-09-08 07:35:15,763 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:35:15,772 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:35:15,790 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:35:15,828 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:35:15,828 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:35:15,828 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:35:15,829 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:35:15,829 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:35:15,829 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:35:15,829 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:35:15,829 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:35:15,829 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:35:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-09-08 07:35:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 07:35:15,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:15,858 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] [2019-09-08 07:35:15,860 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:15,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:15,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1030169634, now seen corresponding path program 1 times [2019-09-08 07:35:15,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:15,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:15,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:15,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:15,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:16,232 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:35:16,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:35:16,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:35:16,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:35:16,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:35:16,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:35:16,264 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 5 states. [2019-09-08 07:35:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:16,431 INFO L93 Difference]: Finished difference Result 221 states and 331 transitions. [2019-09-08 07:35:16,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:35:16,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-08 07:35:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:16,452 INFO L225 Difference]: With dead ends: 221 [2019-09-08 07:35:16,452 INFO L226 Difference]: Without dead ends: 124 [2019-09-08 07:35:16,459 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:35:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-08 07:35:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-09-08 07:35:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-08 07:35:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2019-09-08 07:35:16,519 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 164 transitions. Word has length 55 [2019-09-08 07:35:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:16,520 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 164 transitions. [2019-09-08 07:35:16,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:35:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2019-09-08 07:35:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 07:35:16,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:16,524 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] [2019-09-08 07:35:16,525 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:16,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1622226367, now seen corresponding path program 1 times [2019-09-08 07:35:16,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:16,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:16,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:16,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:16,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:16,909 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:35:16,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:35:16,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:35:16,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:35:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:35:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:35:16,913 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. Second operand 11 states. [2019-09-08 07:35:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:19,768 INFO L93 Difference]: Finished difference Result 963 states and 1412 transitions. [2019-09-08 07:35:19,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:35:19,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-09-08 07:35:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:19,781 INFO L225 Difference]: With dead ends: 963 [2019-09-08 07:35:19,781 INFO L226 Difference]: Without dead ends: 875 [2019-09-08 07:35:19,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=1007, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 07:35:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-09-08 07:35:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 746. [2019-09-08 07:35:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-08 07:35:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1089 transitions. [2019-09-08 07:35:19,909 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1089 transitions. Word has length 78 [2019-09-08 07:35:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:19,909 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1089 transitions. [2019-09-08 07:35:19,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:35:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1089 transitions. [2019-09-08 07:35:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 07:35:19,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:19,916 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] [2019-09-08 07:35:19,917 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1436725880, now seen corresponding path program 1 times [2019-09-08 07:35:19,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:19,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:19,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:19,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:35:20,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:35:20,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:35:20,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:35:20,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:35:20,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:35:20,147 INFO L87 Difference]: Start difference. First operand 746 states and 1089 transitions. Second operand 11 states. [2019-09-08 07:35:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:20,298 INFO L93 Difference]: Finished difference Result 858 states and 1266 transitions. [2019-09-08 07:35:20,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:35:20,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2019-09-08 07:35:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:20,305 INFO L225 Difference]: With dead ends: 858 [2019-09-08 07:35:20,306 INFO L226 Difference]: Without dead ends: 856 [2019-09-08 07:35:20,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:35:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-09-08 07:35:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 800. [2019-09-08 07:35:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-09-08 07:35:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1143 transitions. [2019-09-08 07:35:20,361 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1143 transitions. Word has length 79 [2019-09-08 07:35:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:20,361 INFO L475 AbstractCegarLoop]: Abstraction has 800 states and 1143 transitions. [2019-09-08 07:35:20,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:35:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1143 transitions. [2019-09-08 07:35:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 07:35:20,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:20,366 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] [2019-09-08 07:35:20,366 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -194979657, now seen corresponding path program 1 times [2019-09-08 07:35:20,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:20,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:20,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:20,522 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:35:20,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:35:20,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:35:20,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:35:20,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:35:20,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:35:20,525 INFO L87 Difference]: Start difference. First operand 800 states and 1143 transitions. Second operand 5 states. [2019-09-08 07:35:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:21,142 INFO L93 Difference]: Finished difference Result 2842 states and 4154 transitions. [2019-09-08 07:35:21,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:35:21,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 07:35:21,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:21,154 INFO L225 Difference]: With dead ends: 2842 [2019-09-08 07:35:21,154 INFO L226 Difference]: Without dead ends: 2078 [2019-09-08 07:35:21,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:35:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2019-09-08 07:35:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2043. [2019-09-08 07:35:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2019-09-08 07:35:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 2959 transitions. [2019-09-08 07:35:21,261 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 2959 transitions. Word has length 80 [2019-09-08 07:35:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:21,262 INFO L475 AbstractCegarLoop]: Abstraction has 2043 states and 2959 transitions. [2019-09-08 07:35:21,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:35:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2959 transitions. [2019-09-08 07:35:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 07:35:21,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:21,265 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] [2019-09-08 07:35:21,265 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2093302216, now seen corresponding path program 1 times [2019-09-08 07:35:21,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:21,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:21,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:21,361 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:35:21,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:35:21,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:35:21,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:35:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:35:21,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:35:21,362 INFO L87 Difference]: Start difference. First operand 2043 states and 2959 transitions. Second operand 5 states. [2019-09-08 07:35:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:21,935 INFO L93 Difference]: Finished difference Result 4194 states and 6082 transitions. [2019-09-08 07:35:21,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:35:21,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 07:35:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:21,953 INFO L225 Difference]: With dead ends: 4194 [2019-09-08 07:35:21,953 INFO L226 Difference]: Without dead ends: 2764 [2019-09-08 07:35:21,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:35:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2019-09-08 07:35:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2762. [2019-09-08 07:35:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2019-09-08 07:35:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 3953 transitions. [2019-09-08 07:35:22,135 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 3953 transitions. Word has length 81 [2019-09-08 07:35:22,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:22,136 INFO L475 AbstractCegarLoop]: Abstraction has 2762 states and 3953 transitions. [2019-09-08 07:35:22,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:35:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 3953 transitions. [2019-09-08 07:35:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 07:35:22,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:22,138 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] [2019-09-08 07:35:22,138 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:22,138 INFO L82 PathProgramCache]: Analyzing trace with hash -303376197, now seen corresponding path program 1 times [2019-09-08 07:35:22,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:22,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:22,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:22,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:22,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:22,258 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:35:22,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:35:22,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:35:22,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:35:22,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:35:22,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:35:22,260 INFO L87 Difference]: Start difference. First operand 2762 states and 3953 transitions. Second operand 9 states. [2019-09-08 07:35:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:23,017 INFO L93 Difference]: Finished difference Result 6805 states and 9791 transitions. [2019-09-08 07:35:23,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:35:23,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 07:35:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:23,041 INFO L225 Difference]: With dead ends: 6805 [2019-09-08 07:35:23,042 INFO L226 Difference]: Without dead ends: 4083 [2019-09-08 07:35:23,050 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:35:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2019-09-08 07:35:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 2786. [2019-09-08 07:35:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2019-09-08 07:35:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 3986 transitions. [2019-09-08 07:35:23,343 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 3986 transitions. Word has length 81 [2019-09-08 07:35:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:23,344 INFO L475 AbstractCegarLoop]: Abstraction has 2786 states and 3986 transitions. [2019-09-08 07:35:23,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:35:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 3986 transitions. [2019-09-08 07:35:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 07:35:23,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:23,346 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] [2019-09-08 07:35:23,346 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:23,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:23,346 INFO L82 PathProgramCache]: Analyzing trace with hash -42357815, now seen corresponding path program 1 times [2019-09-08 07:35:23,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:23,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:23,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:23,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:23,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:23,443 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:35:23,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:35:23,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:35:23,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:35:23,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:35:23,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:35:23,445 INFO L87 Difference]: Start difference. First operand 2786 states and 3986 transitions. Second operand 9 states. [2019-09-08 07:35:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:24,167 INFO L93 Difference]: Finished difference Result 5754 states and 8170 transitions. [2019-09-08 07:35:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:35:24,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 07:35:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:24,187 INFO L225 Difference]: With dead ends: 5754 [2019-09-08 07:35:24,188 INFO L226 Difference]: Without dead ends: 3023 [2019-09-08 07:35:24,199 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:35:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2019-09-08 07:35:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2838. [2019-09-08 07:35:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2019-09-08 07:35:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 4060 transitions. [2019-09-08 07:35:24,372 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 4060 transitions. Word has length 81 [2019-09-08 07:35:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:24,372 INFO L475 AbstractCegarLoop]: Abstraction has 2838 states and 4060 transitions. [2019-09-08 07:35:24,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:35:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 4060 transitions. [2019-09-08 07:35:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 07:35:24,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:24,374 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] [2019-09-08 07:35:24,374 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:24,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2048679951, now seen corresponding path program 1 times [2019-09-08 07:35:24,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:24,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:24,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:24,518 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:35:24,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:35:24,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:35:24,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:35:24,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:35:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:35:24,520 INFO L87 Difference]: Start difference. First operand 2838 states and 4060 transitions. Second operand 9 states. [2019-09-08 07:35:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:25,238 INFO L93 Difference]: Finished difference Result 6338 states and 9051 transitions. [2019-09-08 07:35:25,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:35:25,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 07:35:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:25,257 INFO L225 Difference]: With dead ends: 6338 [2019-09-08 07:35:25,258 INFO L226 Difference]: Without dead ends: 3580 [2019-09-08 07:35:25,266 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:35:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2019-09-08 07:35:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 2880. [2019-09-08 07:35:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2019-09-08 07:35:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4123 transitions. [2019-09-08 07:35:25,464 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4123 transitions. Word has length 81 [2019-09-08 07:35:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:25,464 INFO L475 AbstractCegarLoop]: Abstraction has 2880 states and 4123 transitions. [2019-09-08 07:35:25,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:35:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4123 transitions. [2019-09-08 07:35:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 07:35:25,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:25,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:25,471 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:25,472 INFO L82 PathProgramCache]: Analyzing trace with hash 712770964, now seen corresponding path program 1 times [2019-09-08 07:35:25,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:25,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:25,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:25,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:25,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 07:35:25,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:35:25,612 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) [2019-09-08 07:35:25,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:35:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:25,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 07:35:25,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:35:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:35:25,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:35:25,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 07:35:25,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 07:35:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 07:35:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:35:25,948 INFO L87 Difference]: Start difference. First operand 2880 states and 4123 transitions. Second operand 8 states. [2019-09-08 07:35:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:26,847 INFO L93 Difference]: Finished difference Result 8314 states and 11950 transitions. [2019-09-08 07:35:26,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:35:26,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2019-09-08 07:35:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:26,884 INFO L225 Difference]: With dead ends: 8314 [2019-09-08 07:35:26,884 INFO L226 Difference]: Without dead ends: 5493 [2019-09-08 07:35:26,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 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:35:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5493 states. [2019-09-08 07:35:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5493 to 5211. [2019-09-08 07:35:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2019-09-08 07:35:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 7370 transitions. [2019-09-08 07:35:27,438 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 7370 transitions. Word has length 125 [2019-09-08 07:35:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:27,439 INFO L475 AbstractCegarLoop]: Abstraction has 5211 states and 7370 transitions. [2019-09-08 07:35:27,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 07:35:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 7370 transitions. [2019-09-08 07:35:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 07:35:27,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:27,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:27,445 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:27,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:27,445 INFO L82 PathProgramCache]: Analyzing trace with hash 486171996, now seen corresponding path program 1 times [2019-09-08 07:35:27,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:27,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:27,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 07:35:27,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:35:27,555 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:35:27,578 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:35:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:27,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 07:35:27,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:35:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 07:35:27,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:35:27,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 07:35:27,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 07:35:27,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 07:35:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:35:27,762 INFO L87 Difference]: Start difference. First operand 5211 states and 7370 transitions. Second operand 8 states. [2019-09-08 07:35:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:28,698 INFO L93 Difference]: Finished difference Result 14999 states and 21275 transitions. [2019-09-08 07:35:28,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:35:28,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 126 [2019-09-08 07:35:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:28,766 INFO L225 Difference]: With dead ends: 14999 [2019-09-08 07:35:28,766 INFO L226 Difference]: Without dead ends: 9853 [2019-09-08 07:35:28,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 127 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:35:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9853 states. [2019-09-08 07:35:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9853 to 9412. [2019-09-08 07:35:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9412 states. [2019-09-08 07:35:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9412 states to 9412 states and 13114 transitions. [2019-09-08 07:35:29,366 INFO L78 Accepts]: Start accepts. Automaton has 9412 states and 13114 transitions. Word has length 126 [2019-09-08 07:35:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:29,366 INFO L475 AbstractCegarLoop]: Abstraction has 9412 states and 13114 transitions. [2019-09-08 07:35:29,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 07:35:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9412 states and 13114 transitions. [2019-09-08 07:35:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 07:35:29,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:29,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:29,372 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:29,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:29,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1390983992, now seen corresponding path program 1 times [2019-09-08 07:35:29,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:29,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:29,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 07:35:29,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:35:29,542 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) [2019-09-08 07:35:29,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:35:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:29,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 07:35:29,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:35:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 12 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:35:29,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:35:29,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 07:35:29,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 07:35:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 07:35:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:35:29,795 INFO L87 Difference]: Start difference. First operand 9412 states and 13114 transitions. Second operand 8 states. [2019-09-08 07:35:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:30,892 INFO L93 Difference]: Finished difference Result 27294 states and 38162 transitions. [2019-09-08 07:35:30,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:35:30,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2019-09-08 07:35:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:30,973 INFO L225 Difference]: With dead ends: 27294 [2019-09-08 07:35:30,973 INFO L226 Difference]: Without dead ends: 17965 [2019-09-08 07:35:31,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 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:35:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17965 states. [2019-09-08 07:35:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17965 to 17095. [2019-09-08 07:35:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17095 states. [2019-09-08 07:35:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17095 states to 17095 states and 23422 transitions. [2019-09-08 07:35:31,990 INFO L78 Accepts]: Start accepts. Automaton has 17095 states and 23422 transitions. Word has length 127 [2019-09-08 07:35:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:31,990 INFO L475 AbstractCegarLoop]: Abstraction has 17095 states and 23422 transitions. [2019-09-08 07:35:31,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 07:35:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17095 states and 23422 transitions. [2019-09-08 07:35:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 07:35:31,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:31,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:31,997 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:31,997 INFO L82 PathProgramCache]: Analyzing trace with hash 542939306, now seen corresponding path program 1 times [2019-09-08 07:35:31,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:31,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:31,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:32,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:32,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 07:35:32,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:35:32,183 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:35:32,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:32,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 07:35:32,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:35:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 07:35:32,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:35:32,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2019-09-08 07:35:32,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:35:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:35:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:35:32,547 INFO L87 Difference]: Start difference. First operand 17095 states and 23422 transitions. Second operand 13 states. [2019-09-08 07:35:33,124 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-09-08 07:35:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:41,850 INFO L93 Difference]: Finished difference Result 198862 states and 285130 transitions. [2019-09-08 07:35:41,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 07:35:41,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2019-09-08 07:35:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:42,565 INFO L225 Difference]: With dead ends: 198862 [2019-09-08 07:35:42,566 INFO L226 Difference]: Without dead ends: 181846 [2019-09-08 07:35:42,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:35:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181846 states. [2019-09-08 07:35:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181846 to 181818. [2019-09-08 07:35:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181818 states. [2019-09-08 07:35:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181818 states to 181818 states and 238470 transitions. [2019-09-08 07:35:54,399 INFO L78 Accepts]: Start accepts. Automaton has 181818 states and 238470 transitions. Word has length 128 [2019-09-08 07:35:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:35:54,400 INFO L475 AbstractCegarLoop]: Abstraction has 181818 states and 238470 transitions. [2019-09-08 07:35:54,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:35:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 181818 states and 238470 transitions. [2019-09-08 07:35:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 07:35:54,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:35:54,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,438 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:35:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:35:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1580676339, now seen corresponding path program 1 times [2019-09-08 07:35:54,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:35:54,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:35:54,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:54,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:54,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:35:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 07:35:54,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:35:54,842 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:35:54,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:35:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:35:54,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 07:35:54,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:35:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 07:35:55,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:35:55,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6] total 25 [2019-09-08 07:35:55,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 07:35:55,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 07:35:55,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:35:55,198 INFO L87 Difference]: Start difference. First operand 181818 states and 238470 transitions. Second operand 25 states. [2019-09-08 07:36:10,904 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-08 07:36:18,434 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-09-08 07:36:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:36:46,232 INFO L93 Difference]: Finished difference Result 845414 states and 1132609 transitions. [2019-09-08 07:36:46,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-08 07:36:46,232 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2019-09-08 07:36:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:36:48,462 INFO L225 Difference]: With dead ends: 845414 [2019-09-08 07:36:48,462 INFO L226 Difference]: Without dead ends: 699876 [2019-09-08 07:36:48,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11714 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=3830, Invalid=26620, Unknown=0, NotChecked=0, Total=30450 [2019-09-08 07:36:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699876 states. [2019-09-08 07:37:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699876 to 557298. [2019-09-08 07:37:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557298 states. [2019-09-08 07:37:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557298 states to 557298 states and 739198 transitions. [2019-09-08 07:37:43,596 INFO L78 Accepts]: Start accepts. Automaton has 557298 states and 739198 transitions. Word has length 129 [2019-09-08 07:37:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:37:43,597 INFO L475 AbstractCegarLoop]: Abstraction has 557298 states and 739198 transitions. [2019-09-08 07:37:43,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 07:37:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 557298 states and 739198 transitions. [2019-09-08 07:37:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 07:37:43,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:37:43,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:43,653 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:37:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:37:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash 470268062, now seen corresponding path program 1 times [2019-09-08 07:37:43,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:37:43,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:37:43,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:37:43,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:37:43,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:37:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:37:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 07:37:43,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:37:43,760 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) [2019-09-08 07:37:43,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:37:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:37:43,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:37:43,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:37:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:37:44,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:37:44,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 07:37:44,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:37:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:37:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:37:44,086 INFO L87 Difference]: Start difference. First operand 557298 states and 739198 transitions. Second operand 13 states. [2019-09-08 07:38:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:38:22,730 INFO L93 Difference]: Finished difference Result 1068350 states and 1415349 transitions. [2019-09-08 07:38:22,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 07:38:22,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-08 07:38:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:38:25,113 INFO L225 Difference]: With dead ends: 1068350 [2019-09-08 07:38:25,113 INFO L226 Difference]: Without dead ends: 511088 [2019-09-08 07:38:25,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=580, Invalid=1772, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 07:38:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511088 states. [2019-09-08 07:39:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511088 to 476530. [2019-09-08 07:39:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476530 states. [2019-09-08 07:39:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476530 states to 476530 states and 609853 transitions. [2019-09-08 07:39:16,820 INFO L78 Accepts]: Start accepts. Automaton has 476530 states and 609853 transitions. Word has length 129 [2019-09-08 07:39:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:39:16,821 INFO L475 AbstractCegarLoop]: Abstraction has 476530 states and 609853 transitions. [2019-09-08 07:39:16,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:39:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 476530 states and 609853 transitions. [2019-09-08 07:39:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 07:39:16,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:39:16,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:16,855 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:39:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:39:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1655292203, now seen corresponding path program 1 times [2019-09-08 07:39:16,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:39:16,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:39:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:39:16,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:39:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:39:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:39:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 07:39:16,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:39:16,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:39:17,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:39:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:39:17,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:39:17,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:39:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:39:17,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:39:17,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-09-08 07:39:17,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 07:39:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 07:39:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:39:17,295 INFO L87 Difference]: Start difference. First operand 476530 states and 609853 transitions. Second operand 18 states. [2019-09-08 07:40:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:40:12,084 INFO L93 Difference]: Finished difference Result 1139028 states and 1468591 transitions. [2019-09-08 07:40:12,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 07:40:12,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 130 [2019-09-08 07:40:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:40:14,052 INFO L225 Difference]: With dead ends: 1139028 [2019-09-08 07:40:14,052 INFO L226 Difference]: Without dead ends: 749974 [2019-09-08 07:40:14,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:40:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749974 states. [2019-09-08 07:41:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749974 to 647153. [2019-09-08 07:41:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647153 states. [2019-09-08 07:41:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647153 states to 647153 states and 830226 transitions. [2019-09-08 07:41:19,891 INFO L78 Accepts]: Start accepts. Automaton has 647153 states and 830226 transitions. Word has length 130 [2019-09-08 07:41:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:41:19,891 INFO L475 AbstractCegarLoop]: Abstraction has 647153 states and 830226 transitions. [2019-09-08 07:41:19,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 07:41:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 647153 states and 830226 transitions. [2019-09-08 07:41:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 07:41:19,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:41:19,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:19,926 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:41:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:41:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash 793074173, now seen corresponding path program 1 times [2019-09-08 07:41:19,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:41:19,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:41:19,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:41:19,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:41:19,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:41:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:41:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 07:41:20,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:41:20,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:41:20,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:41:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:41:20,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:41:20,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:41:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:41:20,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:41:20,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-09-08 07:41:20,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 07:41:20,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 07:41:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:41:20,408 INFO L87 Difference]: Start difference. First operand 647153 states and 830226 transitions. Second operand 18 states. [2019-09-08 07:42:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:42:26,691 INFO L93 Difference]: Finished difference Result 1443838 states and 1857950 transitions. [2019-09-08 07:42:26,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 07:42:26,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 130 [2019-09-08 07:42:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:42:28,971 INFO L225 Difference]: With dead ends: 1443838 [2019-09-08 07:42:28,972 INFO L226 Difference]: Without dead ends: 878826 [2019-09-08 07:42:30,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2019-09-08 07:42:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878826 states. [2019-09-08 07:43:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878826 to 842017. [2019-09-08 07:43:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842017 states. [2019-09-08 07:43:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842017 states to 842017 states and 1077945 transitions. [2019-09-08 07:43:52,905 INFO L78 Accepts]: Start accepts. Automaton has 842017 states and 1077945 transitions. Word has length 130 [2019-09-08 07:43:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:43:52,906 INFO L475 AbstractCegarLoop]: Abstraction has 842017 states and 1077945 transitions. [2019-09-08 07:43:52,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 07:43:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 842017 states and 1077945 transitions. [2019-09-08 07:43:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 07:43:52,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:43:52,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:52,943 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:43:52,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:43:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1364267533, now seen corresponding path program 1 times [2019-09-08 07:43:52,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:43:52,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:43:52,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:43:52,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:43:52,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:43:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:43:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 07:43:53,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:43:53,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:43:53,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:43:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:43:53,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:43:53,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:43:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:43:53,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:43:53,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-09-08 07:43:53,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 07:43:53,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 07:43:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:43:53,428 INFO L87 Difference]: Start difference. First operand 842017 states and 1077945 transitions. Second operand 18 states.