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.5_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:58:07,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:58:07,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:58:07,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:58:07,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:58:07,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:58:07,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:58:07,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:58:07,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:58:07,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:58:07,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:58:07,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:58:07,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:58:07,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:58:07,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:58:07,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:58:07,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:58:07,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:58:07,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:58:07,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:58:07,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:58:07,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:58:07,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:58:07,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:58:07,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:58:07,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:58:07,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:58:07,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:58:07,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:58:07,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:58:07,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:58:07,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:58:07,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:58:07,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:58:07,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:58:07,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:58:07,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:58:07,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:58:07,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:58:07,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:58:07,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:58:07,619 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:58:07,634 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:58:07,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:58:07,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:58:07,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:58:07,636 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:58:07,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:58:07,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:58:07,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:58:07,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:58:07,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:58:07,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:58:07,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:58:07,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:58:07,638 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:58:07,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:58:07,638 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:58:07,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:58:07,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:58:07,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:58:07,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:58:07,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:58:07,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:58:07,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:58:07,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:58:07,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:58:07,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:58:07,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:58:07,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:58:07,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:58:07,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:58:07,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:58:07,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:58:07,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:58:07,689 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:58:07,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 07:58:07,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a4b09fa/a3f54b7501db4b4486d8997be9b674b2/FLAG437b98b4f [2019-09-08 07:58:08,330 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:58:08,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 07:58:08,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a4b09fa/a3f54b7501db4b4486d8997be9b674b2/FLAG437b98b4f [2019-09-08 07:58:08,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a4b09fa/a3f54b7501db4b4486d8997be9b674b2 [2019-09-08 07:58:08,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:58:08,640 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:58:08,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:58:08,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:58:08,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:58:08,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:58:08" (1/1) ... [2019-09-08 07:58:08,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2369f5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:08, skipping insertion in model container [2019-09-08 07:58:08,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:58:08" (1/1) ... [2019-09-08 07:58:08,664 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:58:08,718 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:58:09,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:58:09,081 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:58:09,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:58:09,157 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:58:09,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09 WrapperNode [2019-09-08 07:58:09,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:58:09,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:58:09,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:58:09,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:58:09,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09" (1/1) ... [2019-09-08 07:58:09,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09" (1/1) ... [2019-09-08 07:58:09,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09" (1/1) ... [2019-09-08 07:58:09,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09" (1/1) ... [2019-09-08 07:58:09,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09" (1/1) ... [2019-09-08 07:58:09,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09" (1/1) ... [2019-09-08 07:58:09,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09" (1/1) ... [2019-09-08 07:58:09,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:58:09,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:58:09,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:58:09,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:58:09,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09" (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:58:09,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:58:09,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:58:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:58:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:58:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:58:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:58:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 07:58:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:58:09,279 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:58:09,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:58:09,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:58:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:58:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:58:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:58:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:58:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:58:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:58:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:58:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:58:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:58:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:58:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:58:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:58:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 07:58:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:58:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:58:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:58:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:58:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:58:09,977 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:58:09,977 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:58:09,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:58:09 BoogieIcfgContainer [2019-09-08 07:58:09,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:58:09,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:58:09,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:58:09,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:58:09,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:58:08" (1/3) ... [2019-09-08 07:58:09,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d61bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:58:09, skipping insertion in model container [2019-09-08 07:58:09,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:58:09" (2/3) ... [2019-09-08 07:58:09,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d61bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:58:09, skipping insertion in model container [2019-09-08 07:58:09,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:58:09" (3/3) ... [2019-09-08 07:58:09,987 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 07:58:09,997 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:58:10,005 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:58:10,022 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:58:10,055 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:58:10,056 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:58:10,056 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:58:10,056 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:58:10,056 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:58:10,057 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:58:10,057 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:58:10,057 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:58:10,057 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:58:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-09-08 07:58:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 07:58:10,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:10,098 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] [2019-09-08 07:58:10,100 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:10,105 INFO L82 PathProgramCache]: Analyzing trace with hash 506263939, now seen corresponding path program 1 times [2019-09-08 07:58:10,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:10,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:10,500 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:58:10,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:10,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:58:10,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:58:10,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:58:10,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:58:10,526 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 5 states. [2019-09-08 07:58:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:10,689 INFO L93 Difference]: Finished difference Result 202 states and 299 transitions. [2019-09-08 07:58:10,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:58:10,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-08 07:58:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:10,712 INFO L225 Difference]: With dead ends: 202 [2019-09-08 07:58:10,712 INFO L226 Difference]: Without dead ends: 118 [2019-09-08 07:58:10,721 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:58:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-08 07:58:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-08 07:58:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 07:58:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2019-09-08 07:58:10,773 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 61 [2019-09-08 07:58:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:10,774 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2019-09-08 07:58:10,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:58:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2019-09-08 07:58:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 07:58:10,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:10,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:10,779 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:10,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1395599750, now seen corresponding path program 1 times [2019-09-08 07:58:10,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:10,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:10,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:10,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:10,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:11,278 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:58:11,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:11,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:58:11,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:58:11,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:58:11,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:58:11,282 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand 13 states. [2019-09-08 07:58:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:15,785 INFO L93 Difference]: Finished difference Result 1149 states and 1648 transitions. [2019-09-08 07:58:15,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 07:58:15,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-08 07:58:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:15,801 INFO L225 Difference]: With dead ends: 1149 [2019-09-08 07:58:15,801 INFO L226 Difference]: Without dead ends: 1074 [2019-09-08 07:58:15,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 07:58:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-09-08 07:58:15,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 506. [2019-09-08 07:58:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-08 07:58:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 704 transitions. [2019-09-08 07:58:15,898 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 704 transitions. Word has length 91 [2019-09-08 07:58:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:15,899 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 704 transitions. [2019-09-08 07:58:15,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:58:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 704 transitions. [2019-09-08 07:58:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:58:15,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:15,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:15,905 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:15,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:15,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1262243146, now seen corresponding path program 1 times [2019-09-08 07:58:15,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:15,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:15,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:15,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:15,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:58:16,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:16,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:58:16,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:58:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:58:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:58:16,026 INFO L87 Difference]: Start difference. First operand 506 states and 704 transitions. Second operand 3 states. [2019-09-08 07:58:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:16,100 INFO L93 Difference]: Finished difference Result 1391 states and 1981 transitions. [2019-09-08 07:58:16,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:58:16,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 07:58:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:16,112 INFO L225 Difference]: With dead ends: 1391 [2019-09-08 07:58:16,112 INFO L226 Difference]: Without dead ends: 928 [2019-09-08 07:58:16,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:58:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-08 07:58:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 926. [2019-09-08 07:58:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-09-08 07:58:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1298 transitions. [2019-09-08 07:58:16,216 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1298 transitions. Word has length 93 [2019-09-08 07:58:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:16,217 INFO L475 AbstractCegarLoop]: Abstraction has 926 states and 1298 transitions. [2019-09-08 07:58:16,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:58:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1298 transitions. [2019-09-08 07:58:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:58:16,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:16,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:16,231 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash -25459310, now seen corresponding path program 1 times [2019-09-08 07:58:16,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:16,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:16,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:16,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:16,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:16,399 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:58:16,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:16,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:58:16,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:58:16,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:58:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:58:16,401 INFO L87 Difference]: Start difference. First operand 926 states and 1298 transitions. Second operand 5 states. [2019-09-08 07:58:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:16,977 INFO L93 Difference]: Finished difference Result 2299 states and 3256 transitions. [2019-09-08 07:58:16,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:58:16,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:58:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:16,986 INFO L225 Difference]: With dead ends: 2299 [2019-09-08 07:58:16,986 INFO L226 Difference]: Without dead ends: 1416 [2019-09-08 07:58:16,989 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:58:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-09-08 07:58:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1414. [2019-09-08 07:58:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-09-08 07:58:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1967 transitions. [2019-09-08 07:58:17,084 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1967 transitions. Word has length 93 [2019-09-08 07:58:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:17,085 INFO L475 AbstractCegarLoop]: Abstraction has 1414 states and 1967 transitions. [2019-09-08 07:58:17,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:58:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1967 transitions. [2019-09-08 07:58:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:58:17,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:17,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:17,088 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:17,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1376634744, now seen corresponding path program 1 times [2019-09-08 07:58:17,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:17,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:17,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:17,220 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:58:17,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:17,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:58:17,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:58:17,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:58:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:58:17,222 INFO L87 Difference]: Start difference. First operand 1414 states and 1967 transitions. Second operand 5 states. [2019-09-08 07:58:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:17,844 INFO L93 Difference]: Finished difference Result 4030 states and 5659 transitions. [2019-09-08 07:58:17,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:58:17,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:58:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:17,863 INFO L225 Difference]: With dead ends: 4030 [2019-09-08 07:58:17,863 INFO L226 Difference]: Without dead ends: 2659 [2019-09-08 07:58:17,869 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:58:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2019-09-08 07:58:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2657. [2019-09-08 07:58:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2657 states. [2019-09-08 07:58:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3683 transitions. [2019-09-08 07:58:18,067 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3683 transitions. Word has length 93 [2019-09-08 07:58:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:18,068 INFO L475 AbstractCegarLoop]: Abstraction has 2657 states and 3683 transitions. [2019-09-08 07:58:18,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:58:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3683 transitions. [2019-09-08 07:58:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:58:18,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:18,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:18,071 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -129125890, now seen corresponding path program 1 times [2019-09-08 07:58:18,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:18,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:18,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:18,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:18,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:18,265 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:58:18,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:18,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:58:18,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:58:18,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:58:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:58:18,267 INFO L87 Difference]: Start difference. First operand 2657 states and 3683 transitions. Second operand 5 states. [2019-09-08 07:58:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:19,093 INFO L93 Difference]: Finished difference Result 7633 states and 10651 transitions. [2019-09-08 07:58:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:58:19,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:58:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:19,129 INFO L225 Difference]: With dead ends: 7633 [2019-09-08 07:58:19,130 INFO L226 Difference]: Without dead ends: 5019 [2019-09-08 07:58:19,149 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:58:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2019-09-08 07:58:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 5017. [2019-09-08 07:58:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5017 states. [2019-09-08 07:58:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 6908 transitions. [2019-09-08 07:58:19,531 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 6908 transitions. Word has length 93 [2019-09-08 07:58:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:19,532 INFO L475 AbstractCegarLoop]: Abstraction has 5017 states and 6908 transitions. [2019-09-08 07:58:19,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:58:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 6908 transitions. [2019-09-08 07:58:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:58:19,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:19,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:19,539 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:19,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1767354040, now seen corresponding path program 1 times [2019-09-08 07:58:19,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:19,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:19,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:19,860 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:58:19,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:19,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:58:19,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:58:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:58:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:58:19,863 INFO L87 Difference]: Start difference. First operand 5017 states and 6908 transitions. Second operand 13 states. [2019-09-08 07:58:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:24,881 INFO L93 Difference]: Finished difference Result 17954 states and 25300 transitions. [2019-09-08 07:58:24,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 07:58:24,882 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-08 07:58:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:24,985 INFO L225 Difference]: With dead ends: 17954 [2019-09-08 07:58:24,986 INFO L226 Difference]: Without dead ends: 12980 [2019-09-08 07:58:25,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=634, Invalid=2122, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 07:58:25,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12980 states. [2019-09-08 07:58:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12980 to 10954. [2019-09-08 07:58:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10954 states. [2019-09-08 07:58:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10954 states to 10954 states and 15220 transitions. [2019-09-08 07:58:25,766 INFO L78 Accepts]: Start accepts. Automaton has 10954 states and 15220 transitions. Word has length 93 [2019-09-08 07:58:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:25,767 INFO L475 AbstractCegarLoop]: Abstraction has 10954 states and 15220 transitions. [2019-09-08 07:58:25,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:58:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 10954 states and 15220 transitions. [2019-09-08 07:58:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:58:25,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:25,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:25,769 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:25,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:25,770 INFO L82 PathProgramCache]: Analyzing trace with hash 513197380, now seen corresponding path program 1 times [2019-09-08 07:58:25,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:25,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:25,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:25,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:25,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:26,064 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:58:26,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:26,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:58:26,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:58:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:58:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:58:26,066 INFO L87 Difference]: Start difference. First operand 10954 states and 15220 transitions. Second operand 9 states. [2019-09-08 07:58:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:27,152 INFO L93 Difference]: Finished difference Result 22919 states and 31471 transitions. [2019-09-08 07:58:27,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:58:27,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-08 07:58:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:27,240 INFO L225 Difference]: With dead ends: 22919 [2019-09-08 07:58:27,240 INFO L226 Difference]: Without dead ends: 12008 [2019-09-08 07:58:27,277 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:58:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12008 states. [2019-09-08 07:58:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12008 to 11024. [2019-09-08 07:58:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11024 states. [2019-09-08 07:58:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11024 states to 11024 states and 15306 transitions. [2019-09-08 07:58:28,130 INFO L78 Accepts]: Start accepts. Automaton has 11024 states and 15306 transitions. Word has length 93 [2019-09-08 07:58:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:28,130 INFO L475 AbstractCegarLoop]: Abstraction has 11024 states and 15306 transitions. [2019-09-08 07:58:28,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:58:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 11024 states and 15306 transitions. [2019-09-08 07:58:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:58:28,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:28,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:28,132 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:28,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:28,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1885489220, now seen corresponding path program 1 times [2019-09-08 07:58:28,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:28,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:28,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:28,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:28,251 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:58:28,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:28,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:58:28,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:58:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:58:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:58:28,252 INFO L87 Difference]: Start difference. First operand 11024 states and 15306 transitions. Second operand 9 states. [2019-09-08 07:58:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:29,581 INFO L93 Difference]: Finished difference Result 27602 states and 38158 transitions. [2019-09-08 07:58:29,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:58:29,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-08 07:58:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:29,672 INFO L225 Difference]: With dead ends: 27602 [2019-09-08 07:58:29,673 INFO L226 Difference]: Without dead ends: 16637 [2019-09-08 07:58:29,709 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:58:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16637 states. [2019-09-08 07:58:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16637 to 11507. [2019-09-08 07:58:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11507 states. [2019-09-08 07:58:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11507 states to 11507 states and 15961 transitions. [2019-09-08 07:58:30,631 INFO L78 Accepts]: Start accepts. Automaton has 11507 states and 15961 transitions. Word has length 93 [2019-09-08 07:58:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:30,631 INFO L475 AbstractCegarLoop]: Abstraction has 11507 states and 15961 transitions. [2019-09-08 07:58:30,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:58:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 11507 states and 15961 transitions. [2019-09-08 07:58:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:58:30,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:30,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:30,633 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:30,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1649574105, now seen corresponding path program 1 times [2019-09-08 07:58:30,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:30,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:30,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:30,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:30,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:30,760 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:58:30,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:30,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:58:30,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:58:30,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:58:30,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:58:30,764 INFO L87 Difference]: Start difference. First operand 11507 states and 15961 transitions. Second operand 5 states. [2019-09-08 07:58:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:32,421 INFO L93 Difference]: Finished difference Result 26349 states and 36684 transitions. [2019-09-08 07:58:32,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:58:32,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-08 07:58:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:32,471 INFO L225 Difference]: With dead ends: 26349 [2019-09-08 07:58:32,471 INFO L226 Difference]: Without dead ends: 14925 [2019-09-08 07:58:32,501 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:58:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14925 states. [2019-09-08 07:58:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14925 to 14408. [2019-09-08 07:58:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14408 states. [2019-09-08 07:58:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14408 states to 14408 states and 20005 transitions. [2019-09-08 07:58:33,362 INFO L78 Accepts]: Start accepts. Automaton has 14408 states and 20005 transitions. Word has length 94 [2019-09-08 07:58:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:33,363 INFO L475 AbstractCegarLoop]: Abstraction has 14408 states and 20005 transitions. [2019-09-08 07:58:33,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:58:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 14408 states and 20005 transitions. [2019-09-08 07:58:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:58:33,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:33,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:33,364 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2149144, now seen corresponding path program 1 times [2019-09-08 07:58:33,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:33,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:33,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:33,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:33,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:33,520 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:58:33,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:58:33,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:58:33,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:58:33,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:58:33,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:58:33,522 INFO L87 Difference]: Start difference. First operand 14408 states and 20005 transitions. Second operand 11 states. [2019-09-08 07:58:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:34,533 INFO L93 Difference]: Finished difference Result 16221 states and 23226 transitions. [2019-09-08 07:58:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:58:34,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-09-08 07:58:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:34,594 INFO L225 Difference]: With dead ends: 16221 [2019-09-08 07:58:34,595 INFO L226 Difference]: Without dead ends: 16219 [2019-09-08 07:58:34,605 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:58:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16219 states. [2019-09-08 07:58:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16219 to 15128. [2019-09-08 07:58:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15128 states. [2019-09-08 07:58:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15128 states to 15128 states and 20713 transitions. [2019-09-08 07:58:35,475 INFO L78 Accepts]: Start accepts. Automaton has 15128 states and 20713 transitions. Word has length 94 [2019-09-08 07:58:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:35,476 INFO L475 AbstractCegarLoop]: Abstraction has 15128 states and 20713 transitions. [2019-09-08 07:58:35,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:58:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 15128 states and 20713 transitions. [2019-09-08 07:58:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:58:35,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:35,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:35,484 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:35,485 INFO L82 PathProgramCache]: Analyzing trace with hash -977858734, now seen corresponding path program 1 times [2019-09-08 07:58:35,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:35,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:35,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:35,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:35,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 07:58:35,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:58:35,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:58:35,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:35,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:58:35,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:58:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 07:58:36,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:58:36,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2019-09-08 07:58:36,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:58:36,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:58:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:58:36,166 INFO L87 Difference]: Start difference. First operand 15128 states and 20713 transitions. Second operand 14 states. [2019-09-08 07:58:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:40,468 INFO L93 Difference]: Finished difference Result 41934 states and 57754 transitions. [2019-09-08 07:58:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:58:40,469 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2019-09-08 07:58:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:40,578 INFO L225 Difference]: With dead ends: 41934 [2019-09-08 07:58:40,578 INFO L226 Difference]: Without dead ends: 26883 [2019-09-08 07:58:40,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=352, Invalid=980, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 07:58:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26883 states. [2019-09-08 07:58:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26883 to 26095. [2019-09-08 07:58:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26095 states. [2019-09-08 07:58:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26095 states to 26095 states and 35344 transitions. [2019-09-08 07:58:42,916 INFO L78 Accepts]: Start accepts. Automaton has 26095 states and 35344 transitions. Word has length 145 [2019-09-08 07:58:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:42,917 INFO L475 AbstractCegarLoop]: Abstraction has 26095 states and 35344 transitions. [2019-09-08 07:58:42,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:58:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 26095 states and 35344 transitions. [2019-09-08 07:58:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:58:42,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:42,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:42,929 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1836133942, now seen corresponding path program 1 times [2019-09-08 07:58:42,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:42,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:42,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:42,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:42,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 07:58:43,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:58:43,042 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:58:43,059 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:58:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:43,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:58:43,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:58:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 07:58:43,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:58:43,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 17 [2019-09-08 07:58:43,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 07:58:43,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 07:58:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:58:43,606 INFO L87 Difference]: Start difference. First operand 26095 states and 35344 transitions. Second operand 17 states. [2019-09-08 07:58:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:51,349 INFO L93 Difference]: Finished difference Result 101125 states and 137755 transitions. [2019-09-08 07:58:51,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 07:58:51,349 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 145 [2019-09-08 07:58:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:51,634 INFO L225 Difference]: With dead ends: 101125 [2019-09-08 07:58:51,634 INFO L226 Difference]: Without dead ends: 75140 [2019-09-08 07:58:51,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:58:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75140 states. [2019-09-08 07:58:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75140 to 72701. [2019-09-08 07:58:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72701 states. [2019-09-08 07:58:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72701 states to 72701 states and 97199 transitions. [2019-09-08 07:58:56,239 INFO L78 Accepts]: Start accepts. Automaton has 72701 states and 97199 transitions. Word has length 145 [2019-09-08 07:58:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:58:56,240 INFO L475 AbstractCegarLoop]: Abstraction has 72701 states and 97199 transitions. [2019-09-08 07:58:56,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 07:58:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 72701 states and 97199 transitions. [2019-09-08 07:58:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:58:56,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:58:56,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:58:56,258 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:58:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:58:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash 416497620, now seen corresponding path program 1 times [2019-09-08 07:58:56,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:58:56,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:58:56,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:56,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:58:56,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:58:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 07:58:56,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:58:56,543 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:58:56,571 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:58:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:58:56,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:58:56,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:58:57,029 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:58:57,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:58:57,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 25 [2019-09-08 07:58:57,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 07:58:57,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 07:58:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:58:57,035 INFO L87 Difference]: Start difference. First operand 72701 states and 97199 transitions. Second operand 25 states. [2019-09-08 07:59:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:29,327 INFO L93 Difference]: Finished difference Result 292951 states and 399919 transitions. [2019-09-08 07:59:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-08 07:59:29,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 145 [2019-09-08 07:59:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:30,171 INFO L225 Difference]: With dead ends: 292951 [2019-09-08 07:59:30,172 INFO L226 Difference]: Without dead ends: 242525 [2019-09-08 07:59:30,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9676 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3235, Invalid=21257, Unknown=0, NotChecked=0, Total=24492 [2019-09-08 07:59:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242525 states. [2019-09-08 07:59:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242525 to 240515. [2019-09-08 07:59:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240515 states. [2019-09-08 07:59:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240515 states to 240515 states and 326647 transitions. [2019-09-08 07:59:48,152 INFO L78 Accepts]: Start accepts. Automaton has 240515 states and 326647 transitions. Word has length 145 [2019-09-08 07:59:48,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:48,153 INFO L475 AbstractCegarLoop]: Abstraction has 240515 states and 326647 transitions. [2019-09-08 07:59:48,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 07:59:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 240515 states and 326647 transitions. [2019-09-08 07:59:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:59:48,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:48,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:48,176 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:48,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1546548408, now seen corresponding path program 1 times [2019-09-08 07:59:48,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:48,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:48,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:48,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:48,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 07:59:48,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:59:48,411 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:59:48,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:48,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:59:48,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:59:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 07:59:48,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:59:48,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2019-09-08 07:59:48,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 07:59:48,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 07:59:48,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:59:48,951 INFO L87 Difference]: Start difference. First operand 240515 states and 326647 transitions. Second operand 24 states. [2019-09-08 07:59:50,858 WARN L188 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-09-08 08:00:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:19,505 INFO L93 Difference]: Finished difference Result 561761 states and 764353 transitions. [2019-09-08 08:00:19,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 08:00:19,506 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 145 [2019-09-08 08:00:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:20,713 INFO L225 Difference]: With dead ends: 561761 [2019-09-08 08:00:20,713 INFO L226 Difference]: Without dead ends: 430269 [2019-09-08 08:00:20,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2616 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1353, Invalid=6657, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 08:00:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430269 states. [2019-09-08 08:00:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430269 to 426063. [2019-09-08 08:00:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426063 states. [2019-09-08 08:00:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426063 states to 426063 states and 578943 transitions. [2019-09-08 08:00:55,743 INFO L78 Accepts]: Start accepts. Automaton has 426063 states and 578943 transitions. Word has length 145 [2019-09-08 08:00:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:55,743 INFO L475 AbstractCegarLoop]: Abstraction has 426063 states and 578943 transitions. [2019-09-08 08:00:55,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 08:00:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 426063 states and 578943 transitions. [2019-09-08 08:00:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 08:00:55,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:55,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:00:55,768 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash -184154680, now seen corresponding path program 1 times [2019-09-08 08:00:55,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:55,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:55,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:55,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:55,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 08:00:56,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:00:56,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 08:00:56,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:00:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:56,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 08:00:56,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:00:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 08:00:56,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:00:56,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [14] total 27 [2019-09-08 08:00:56,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 08:00:56,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 08:00:56,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-09-08 08:00:56,556 INFO L87 Difference]: Start difference. First operand 426063 states and 578943 transitions. Second operand 27 states. [2019-09-08 08:01:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:01:44,950 INFO L93 Difference]: Finished difference Result 718851 states and 980997 transitions. [2019-09-08 08:01:44,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 08:01:44,951 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2019-09-08 08:01:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:01:46,991 INFO L225 Difference]: With dead ends: 718851 [2019-09-08 08:01:46,991 INFO L226 Difference]: Without dead ends: 557925 [2019-09-08 08:01:47,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1403, Invalid=6787, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 08:01:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557925 states. [2019-09-08 08:02:36,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557925 to 544355. [2019-09-08 08:02:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544355 states. [2019-09-08 08:02:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544355 states to 544355 states and 741455 transitions. [2019-09-08 08:02:37,361 INFO L78 Accepts]: Start accepts. Automaton has 544355 states and 741455 transitions. Word has length 145 [2019-09-08 08:02:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:02:37,362 INFO L475 AbstractCegarLoop]: Abstraction has 544355 states and 741455 transitions. [2019-09-08 08:02:37,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 08:02:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 544355 states and 741455 transitions. [2019-09-08 08:02:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 08:02:37,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:02:37,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:02:37,384 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:02:37,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:02:37,384 INFO L82 PathProgramCache]: Analyzing trace with hash -909478759, now seen corresponding path program 1 times [2019-09-08 08:02:37,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:02:37,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:02:37,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:02:37,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:02:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:02:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:02:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 08:02:39,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:02:39,593 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 08:02:39,617 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 08:02:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:02:39,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 08:02:39,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:02:39,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 08:02:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:02:40,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 08:02:40,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 33 [2019-09-08 08:02:40,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 08:02:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 08:02:40,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 08:02:40,344 INFO L87 Difference]: Start difference. First operand 544355 states and 741455 transitions. Second operand 33 states. [2019-09-08 08:04:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:28,459 INFO L93 Difference]: Finished difference Result 1936231 states and 2625489 transitions. [2019-09-08 08:04:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 08:04:28,460 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 146 [2019-09-08 08:04:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:33,597 INFO L225 Difference]: With dead ends: 1936231 [2019-09-08 08:04:33,597 INFO L226 Difference]: Without dead ends: 1451055 [2019-09-08 08:04:34,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1307, Invalid=5833, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 08:04:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451055 states.