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-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:15:10,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:15:10,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:15:11,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:15:11,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:15:11,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:15:11,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:15:11,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:15:11,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:15:11,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:15:11,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:15:11,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:15:11,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:15:11,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:15:11,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:15:11,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:15:11,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:15:11,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:15:11,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:15:11,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:15:11,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:15:11,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:15:11,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:15:11,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:15:11,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:15:11,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:15:11,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:15:11,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:15:11,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:15:11,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:15:11,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:15:11,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:15:11,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:15:11,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:15:11,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:15:11,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:15:11,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:15:11,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:15:11,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:15:11,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:15:11,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:15:11,033 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 11:15:11,047 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:15:11,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:15:11,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:15:11,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:15:11,049 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:15:11,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:15:11,049 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:15:11,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:15:11,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:15:11,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:15:11,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:15:11,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:15:11,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:15:11,050 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:15:11,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:15:11,051 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:15:11,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:15:11,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:15:11,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:15:11,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:15:11,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:15:11,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:15:11,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:15:11,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:15:11,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:15:11,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:15:11,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:15:11,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:15:11,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:15:11,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:15:11,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:15:11,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:15:11,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:15:11,099 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:15:11,099 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:15:11,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4d3108c/1053cb4a00a744babe55f1f2c6f06aa3/FLAG25f7e9ac3 [2019-09-08 11:15:11,681 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:15:11,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:15:11,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4d3108c/1053cb4a00a744babe55f1f2c6f06aa3/FLAG25f7e9ac3 [2019-09-08 11:15:12,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4d3108c/1053cb4a00a744babe55f1f2c6f06aa3 [2019-09-08 11:15:12,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:15:12,031 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:15:12,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:15:12,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:15:12,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:15:12,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:15:12" (1/1) ... [2019-09-08 11:15:12,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12, skipping insertion in model container [2019-09-08 11:15:12,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:15:12" (1/1) ... [2019-09-08 11:15:12,049 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:15:12,114 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:15:12,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:15:12,570 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:15:12,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:15:12,698 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:15:12,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12 WrapperNode [2019-09-08 11:15:12,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:15:12,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:15:12,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:15:12,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:15:12,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12" (1/1) ... [2019-09-08 11:15:12,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12" (1/1) ... [2019-09-08 11:15:12,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12" (1/1) ... [2019-09-08 11:15:12,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12" (1/1) ... [2019-09-08 11:15:12,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12" (1/1) ... [2019-09-08 11:15:12,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12" (1/1) ... [2019-09-08 11:15:12,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12" (1/1) ... [2019-09-08 11:15:12,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:15:12,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:15:12,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:15:12,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:15:12,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12" (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 11:15:12,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:15:12,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:15:12,844 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:15:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:15:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:15:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:15:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:15:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:15:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:15:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:15:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:15:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:15:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:15:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:15:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:15:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:15:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:15:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:15:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:15:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:15:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:15:13,605 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:15:13,606 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:15:13,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:15:13 BoogieIcfgContainer [2019-09-08 11:15:13,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:15:13,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:15:13,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:15:13,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:15:13,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:15:12" (1/3) ... [2019-09-08 11:15:13,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78235587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:15:13, skipping insertion in model container [2019-09-08 11:15:13,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:12" (2/3) ... [2019-09-08 11:15:13,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78235587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:15:13, skipping insertion in model container [2019-09-08 11:15:13,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:15:13" (3/3) ... [2019-09-08 11:15:13,615 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:15:13,625 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:15:13,633 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:15:13,650 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:15:13,683 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:15:13,684 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:15:13,684 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:15:13,684 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:15:13,685 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:15:13,685 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:15:13,685 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:15:13,685 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:15:13,685 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:15:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-09-08 11:15:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:15:13,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:13,720 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] [2019-09-08 11:15:13,722 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:13,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash -34788824, now seen corresponding path program 1 times [2019-09-08 11:15:13,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:13,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:13,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:13,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:13,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:14,194 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 11:15:14,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:14,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:14,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:14,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:14,224 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-09-08 11:15:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:14,353 INFO L93 Difference]: Finished difference Result 335 states and 535 transitions. [2019-09-08 11:15:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:14,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 11:15:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:14,369 INFO L225 Difference]: With dead ends: 335 [2019-09-08 11:15:14,369 INFO L226 Difference]: Without dead ends: 223 [2019-09-08 11:15:14,374 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 11:15:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-08 11:15:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-09-08 11:15:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 11:15:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 329 transitions. [2019-09-08 11:15:14,442 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 329 transitions. Word has length 65 [2019-09-08 11:15:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:14,443 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 329 transitions. [2019-09-08 11:15:14,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 329 transitions. [2019-09-08 11:15:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:15:14,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:14,447 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] [2019-09-08 11:15:14,447 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:14,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1987070288, now seen corresponding path program 1 times [2019-09-08 11:15:14,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:14,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:14,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:14,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:14,608 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 11:15:14,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:14,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:14,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:14,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:14,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:14,611 INFO L87 Difference]: Start difference. First operand 221 states and 329 transitions. Second operand 3 states. [2019-09-08 11:15:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:14,684 INFO L93 Difference]: Finished difference Result 553 states and 857 transitions. [2019-09-08 11:15:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:14,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 11:15:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:14,688 INFO L225 Difference]: With dead ends: 553 [2019-09-08 11:15:14,689 INFO L226 Difference]: Without dead ends: 371 [2019-09-08 11:15:14,691 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 11:15:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-08 11:15:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2019-09-08 11:15:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-08 11:15:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 564 transitions. [2019-09-08 11:15:14,730 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 564 transitions. Word has length 66 [2019-09-08 11:15:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:14,730 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 564 transitions. [2019-09-08 11:15:14,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 564 transitions. [2019-09-08 11:15:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:15:14,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:14,733 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] [2019-09-08 11:15:14,734 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 612521917, now seen corresponding path program 1 times [2019-09-08 11:15:14,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:14,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:14,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:14,842 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 11:15:14,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:14,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:14,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:14,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:14,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:14,844 INFO L87 Difference]: Start difference. First operand 369 states and 564 transitions. Second operand 3 states. [2019-09-08 11:15:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:14,891 INFO L93 Difference]: Finished difference Result 965 states and 1510 transitions. [2019-09-08 11:15:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:14,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 11:15:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:14,896 INFO L225 Difference]: With dead ends: 965 [2019-09-08 11:15:14,896 INFO L226 Difference]: Without dead ends: 635 [2019-09-08 11:15:14,899 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 11:15:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-08 11:15:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-09-08 11:15:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 11:15:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 980 transitions. [2019-09-08 11:15:14,947 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 980 transitions. Word has length 67 [2019-09-08 11:15:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:14,947 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 980 transitions. [2019-09-08 11:15:14,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 980 transitions. [2019-09-08 11:15:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:15:14,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:14,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:14,954 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:14,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1025177521, now seen corresponding path program 1 times [2019-09-08 11:15:14,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:14,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:14,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:15,034 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 11:15:15,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:15,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:15,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:15,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:15,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:15,036 INFO L87 Difference]: Start difference. First operand 633 states and 980 transitions. Second operand 3 states. [2019-09-08 11:15:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:15,100 INFO L93 Difference]: Finished difference Result 1693 states and 2654 transitions. [2019-09-08 11:15:15,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:15,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 11:15:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:15,108 INFO L225 Difference]: With dead ends: 1693 [2019-09-08 11:15:15,108 INFO L226 Difference]: Without dead ends: 1099 [2019-09-08 11:15:15,110 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 11:15:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-09-08 11:15:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2019-09-08 11:15:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-09-08 11:15:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1704 transitions. [2019-09-08 11:15:15,174 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1704 transitions. Word has length 68 [2019-09-08 11:15:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:15,175 INFO L475 AbstractCegarLoop]: Abstraction has 1097 states and 1704 transitions. [2019-09-08 11:15:15,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1704 transitions. [2019-09-08 11:15:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:15:15,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:15,177 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] [2019-09-08 11:15:15,177 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:15,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1063880858, now seen corresponding path program 1 times [2019-09-08 11:15:15,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:15,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:15,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:15,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:15,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:15,429 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 11:15:15,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:15,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:15:15,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:15:15,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:15:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:15,432 INFO L87 Difference]: Start difference. First operand 1097 states and 1704 transitions. Second operand 7 states. [2019-09-08 11:15:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:15,883 INFO L93 Difference]: Finished difference Result 5667 states and 8845 transitions. [2019-09-08 11:15:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:15:15,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-08 11:15:15,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:15,912 INFO L225 Difference]: With dead ends: 5667 [2019-09-08 11:15:15,912 INFO L226 Difference]: Without dead ends: 4609 [2019-09-08 11:15:15,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2019-09-08 11:15:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4601. [2019-09-08 11:15:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4601 states. [2019-09-08 11:15:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 7160 transitions. [2019-09-08 11:15:16,249 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 7160 transitions. Word has length 69 [2019-09-08 11:15:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:16,252 INFO L475 AbstractCegarLoop]: Abstraction has 4601 states and 7160 transitions. [2019-09-08 11:15:16,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:15:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 7160 transitions. [2019-09-08 11:15:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:15:16,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:16,258 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] [2019-09-08 11:15:16,259 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1707189843, now seen corresponding path program 1 times [2019-09-08 11:15:16,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:16,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:16,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:16,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:16,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:16,358 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 11:15:16,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:16,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:16,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:16,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:16,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:16,360 INFO L87 Difference]: Start difference. First operand 4601 states and 7160 transitions. Second operand 3 states. [2019-09-08 11:15:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:16,820 INFO L93 Difference]: Finished difference Result 12365 states and 19210 transitions. [2019-09-08 11:15:16,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:16,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 11:15:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:16,872 INFO L225 Difference]: With dead ends: 12365 [2019-09-08 11:15:16,872 INFO L226 Difference]: Without dead ends: 7803 [2019-09-08 11:15:16,884 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 11:15:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2019-09-08 11:15:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 7801. [2019-09-08 11:15:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7801 states. [2019-09-08 11:15:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7801 states to 7801 states and 12008 transitions. [2019-09-08 11:15:17,539 INFO L78 Accepts]: Start accepts. Automaton has 7801 states and 12008 transitions. Word has length 70 [2019-09-08 11:15:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:17,539 INFO L475 AbstractCegarLoop]: Abstraction has 7801 states and 12008 transitions. [2019-09-08 11:15:17,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 12008 transitions. [2019-09-08 11:15:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:15:17,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:17,541 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] [2019-09-08 11:15:17,541 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash -453623555, now seen corresponding path program 1 times [2019-09-08 11:15:17,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:17,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:17,625 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 11:15:17,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:17,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:15:17,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:15:17,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:15:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:15:17,627 INFO L87 Difference]: Start difference. First operand 7801 states and 12008 transitions. Second operand 5 states. [2019-09-08 11:15:18,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:18,691 INFO L93 Difference]: Finished difference Result 21965 states and 33866 transitions. [2019-09-08 11:15:18,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:15:18,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:15:18,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:18,761 INFO L225 Difference]: With dead ends: 21965 [2019-09-08 11:15:18,761 INFO L226 Difference]: Without dead ends: 14203 [2019-09-08 11:15:18,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14203 states. [2019-09-08 11:15:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14203 to 14201. [2019-09-08 11:15:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14201 states. [2019-09-08 11:15:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14201 states to 14201 states and 21752 transitions. [2019-09-08 11:15:19,647 INFO L78 Accepts]: Start accepts. Automaton has 14201 states and 21752 transitions. Word has length 71 [2019-09-08 11:15:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:19,647 INFO L475 AbstractCegarLoop]: Abstraction has 14201 states and 21752 transitions. [2019-09-08 11:15:19,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:15:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 14201 states and 21752 transitions. [2019-09-08 11:15:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:15:19,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:19,649 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] [2019-09-08 11:15:19,649 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1163881336, now seen corresponding path program 1 times [2019-09-08 11:15:19,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:19,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:19,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:19,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:19,853 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 11:15:19,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:19,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:15:19,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:15:19,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:15:19,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:19,856 INFO L87 Difference]: Start difference. First operand 14201 states and 21752 transitions. Second operand 7 states. [2019-09-08 11:15:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:22,643 INFO L93 Difference]: Finished difference Result 75493 states and 115806 transitions. [2019-09-08 11:15:22,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:15:22,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 11:15:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:22,826 INFO L225 Difference]: With dead ends: 75493 [2019-09-08 11:15:22,826 INFO L226 Difference]: Without dead ends: 61331 [2019-09-08 11:15:22,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:15:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61331 states. [2019-09-08 11:15:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61331 to 28361. [2019-09-08 11:15:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28361 states. [2019-09-08 11:15:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28361 states to 28361 states and 42888 transitions. [2019-09-08 11:15:24,717 INFO L78 Accepts]: Start accepts. Automaton has 28361 states and 42888 transitions. Word has length 71 [2019-09-08 11:15:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:24,717 INFO L475 AbstractCegarLoop]: Abstraction has 28361 states and 42888 transitions. [2019-09-08 11:15:24,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:15:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 28361 states and 42888 transitions. [2019-09-08 11:15:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:15:24,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:24,719 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] [2019-09-08 11:15:24,720 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1702050330, now seen corresponding path program 1 times [2019-09-08 11:15:24,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:24,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:24,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:24,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:24,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:24,808 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 11:15:24,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:24,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:15:24,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:15:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:15:24,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:15:24,810 INFO L87 Difference]: Start difference. First operand 28361 states and 42888 transitions. Second operand 5 states. [2019-09-08 11:15:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:27,571 INFO L93 Difference]: Finished difference Result 57835 states and 86889 transitions. [2019-09-08 11:15:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:15:27,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 11:15:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:27,665 INFO L225 Difference]: With dead ends: 57835 [2019-09-08 11:15:27,666 INFO L226 Difference]: Without dead ends: 57833 [2019-09-08 11:15:27,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 11:15:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57833 states. [2019-09-08 11:15:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57833 to 29513. [2019-09-08 11:15:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29513 states. [2019-09-08 11:15:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29513 states to 29513 states and 44040 transitions. [2019-09-08 11:15:29,361 INFO L78 Accepts]: Start accepts. Automaton has 29513 states and 44040 transitions. Word has length 72 [2019-09-08 11:15:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:29,361 INFO L475 AbstractCegarLoop]: Abstraction has 29513 states and 44040 transitions. [2019-09-08 11:15:29,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:15:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 29513 states and 44040 transitions. [2019-09-08 11:15:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:15:29,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:29,362 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] [2019-09-08 11:15:29,362 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1233572455, now seen corresponding path program 1 times [2019-09-08 11:15:29,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:29,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:29,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:29,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:29,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:29,435 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 11:15:29,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:29,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:29,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:29,437 INFO L87 Difference]: Start difference. First operand 29513 states and 44040 transitions. Second operand 3 states. [2019-09-08 11:15:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:31,043 INFO L93 Difference]: Finished difference Result 66591 states and 99180 transitions. [2019-09-08 11:15:31,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:31,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 11:15:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:31,110 INFO L225 Difference]: With dead ends: 66591 [2019-09-08 11:15:31,111 INFO L226 Difference]: Without dead ends: 37117 [2019-09-08 11:15:31,189 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 11:15:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37117 states. [2019-09-08 11:15:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37117 to 36971. [2019-09-08 11:15:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36971 states. [2019-09-08 11:15:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36971 states to 36971 states and 54746 transitions. [2019-09-08 11:15:33,839 INFO L78 Accepts]: Start accepts. Automaton has 36971 states and 54746 transitions. Word has length 73 [2019-09-08 11:15:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:33,840 INFO L475 AbstractCegarLoop]: Abstraction has 36971 states and 54746 transitions. [2019-09-08 11:15:33,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 36971 states and 54746 transitions. [2019-09-08 11:15:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:15:33,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:33,857 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:15:33,857 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash -959843441, now seen corresponding path program 1 times [2019-09-08 11:15:33,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:33,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:33,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:33,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:33,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:33,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:33,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:33,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:33,942 INFO L87 Difference]: Start difference. First operand 36971 states and 54746 transitions. Second operand 3 states. [2019-09-08 11:15:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:36,932 INFO L93 Difference]: Finished difference Result 99824 states and 147998 transitions. [2019-09-08 11:15:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:36,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:15:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:37,020 INFO L225 Difference]: With dead ends: 99824 [2019-09-08 11:15:37,021 INFO L226 Difference]: Without dead ends: 66414 [2019-09-08 11:15:37,070 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 11:15:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66414 states. [2019-09-08 11:15:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66414 to 66412. [2019-09-08 11:15:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66412 states. [2019-09-08 11:15:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66412 states to 66412 states and 97708 transitions. [2019-09-08 11:15:41,386 INFO L78 Accepts]: Start accepts. Automaton has 66412 states and 97708 transitions. Word has length 100 [2019-09-08 11:15:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:41,387 INFO L475 AbstractCegarLoop]: Abstraction has 66412 states and 97708 transitions. [2019-09-08 11:15:41,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 66412 states and 97708 transitions. [2019-09-08 11:15:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:15:41,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:41,407 INFO L399 BasicCegarLoop]: trace histogram [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 11:15:41,407 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1995645960, now seen corresponding path program 1 times [2019-09-08 11:15:41,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:41,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:41,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:41,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:41,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:41,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:15:41,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:15:41,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:15:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:41,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 11:15:41,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:15:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:15:42,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:15:42,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 11:15:42,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:15:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:15:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:15:42,116 INFO L87 Difference]: Start difference. First operand 66412 states and 97708 transitions. Second operand 12 states. [2019-09-08 11:16:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:16,153 INFO L93 Difference]: Finished difference Result 481900 states and 701016 transitions. [2019-09-08 11:16:16,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 11:16:16,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-08 11:16:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:17,123 INFO L225 Difference]: With dead ends: 481900 [2019-09-08 11:16:17,123 INFO L226 Difference]: Without dead ends: 421802 [2019-09-08 11:16:17,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2770 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1359, Invalid=5951, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 11:16:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421802 states. [2019-09-08 11:16:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421802 to 174788. [2019-09-08 11:16:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174788 states. [2019-09-08 11:16:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174788 states to 174788 states and 253816 transitions. [2019-09-08 11:16:35,617 INFO L78 Accepts]: Start accepts. Automaton has 174788 states and 253816 transitions. Word has length 100 [2019-09-08 11:16:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:35,617 INFO L475 AbstractCegarLoop]: Abstraction has 174788 states and 253816 transitions. [2019-09-08 11:16:35,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:16:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 174788 states and 253816 transitions. [2019-09-08 11:16:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:16:35,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:35,664 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:16:35,664 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1839484968, now seen corresponding path program 1 times [2019-09-08 11:16:35,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:35,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:35,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 11:16:35,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:35,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:16:35,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:16:35,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:16:35,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:16:35,759 INFO L87 Difference]: Start difference. First operand 174788 states and 253816 transitions. Second operand 6 states. [2019-09-08 11:17:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:08,998 INFO L93 Difference]: Finished difference Result 667522 states and 966463 transitions. [2019-09-08 11:17:08,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:17:08,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-08 11:17:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:09,786 INFO L225 Difference]: With dead ends: 667522 [2019-09-08 11:17:09,786 INFO L226 Difference]: Without dead ends: 492776 [2019-09-08 11:17:09,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:17:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492776 states. [2019-09-08 11:17:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492776 to 492772. [2019-09-08 11:17:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492772 states. [2019-09-08 11:17:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492772 states to 492772 states and 709504 transitions. [2019-09-08 11:17:56,131 INFO L78 Accepts]: Start accepts. Automaton has 492772 states and 709504 transitions. Word has length 100 [2019-09-08 11:17:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:56,131 INFO L475 AbstractCegarLoop]: Abstraction has 492772 states and 709504 transitions. [2019-09-08 11:17:56,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:17:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 492772 states and 709504 transitions. [2019-09-08 11:17:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:17:56,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:56,164 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:56,165 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:56,165 INFO L82 PathProgramCache]: Analyzing trace with hash -140781229, now seen corresponding path program 1 times [2019-09-08 11:17:56,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:56,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:56,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:56,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:56,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:17:56,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:17:56,276 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:17:56,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:57,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:17:57,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:17:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:17:57,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:17:57,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:17:57,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:17:57,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:17:57,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:17:57,588 INFO L87 Difference]: Start difference. First operand 492772 states and 709504 transitions. Second operand 11 states. [2019-09-08 11:19:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:39,382 INFO L93 Difference]: Finished difference Result 1539061 states and 2218052 transitions. [2019-09-08 11:19:39,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:19:39,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-09-08 11:19:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:41,740 INFO L225 Difference]: With dead ends: 1539061 [2019-09-08 11:19:41,740 INFO L226 Difference]: Without dead ends: 1094571 [2019-09-08 11:19:42,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:19:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094571 states. [2019-09-08 11:20:53,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094571 to 586684. [2019-09-08 11:20:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586684 states. [2019-09-08 11:20:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586684 states to 586684 states and 843224 transitions. [2019-09-08 11:20:54,887 INFO L78 Accepts]: Start accepts. Automaton has 586684 states and 843224 transitions. Word has length 100 [2019-09-08 11:20:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:54,888 INFO L475 AbstractCegarLoop]: Abstraction has 586684 states and 843224 transitions. [2019-09-08 11:20:54,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:20:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 586684 states and 843224 transitions. [2019-09-08 11:20:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:20:54,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:54,917 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:20:54,918 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:54,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1034965880, now seen corresponding path program 1 times [2019-09-08 11:20:54,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:54,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:54,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:54,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:20:54,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:54,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:20:54,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:20:54,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:20:54,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:20:54,982 INFO L87 Difference]: Start difference. First operand 586684 states and 843224 transitions. Second operand 3 states. [2019-09-08 11:22:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:22:25,598 INFO L93 Difference]: Finished difference Result 1352428 states and 1942875 transitions. [2019-09-08 11:22:25,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:22:25,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:22:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:27,052 INFO L225 Difference]: With dead ends: 1352428 [2019-09-08 11:22:27,052 INFO L226 Difference]: Without dead ends: 910874 [2019-09-08 11:22:27,356 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 11:22:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910874 states. [2019-09-08 11:24:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910874 to 870824. [2019-09-08 11:24:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870824 states. [2019-09-08 11:24:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870824 states to 870824 states and 1240753 transitions. [2019-09-08 11:24:08,400 INFO L78 Accepts]: Start accepts. Automaton has 870824 states and 1240753 transitions. Word has length 100 [2019-09-08 11:24:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:08,400 INFO L475 AbstractCegarLoop]: Abstraction has 870824 states and 1240753 transitions. [2019-09-08 11:24:08,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:24:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 870824 states and 1240753 transitions. [2019-09-08 11:24:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:24:08,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:08,430 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:08,431 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1781550567, now seen corresponding path program 1 times [2019-09-08 11:24:08,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:08,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:08,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:08,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:08,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:08,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:08,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:24:08,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:24:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:24:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:08,496 INFO L87 Difference]: Start difference. First operand 870824 states and 1240753 transitions. Second operand 3 states.