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.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:59:11,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:59:11,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:59:11,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:59:11,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:59:11,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:59:11,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:59:11,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:59:11,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:59:11,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:59:11,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:59:11,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:59:11,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:59:11,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:59:11,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:59:11,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:59:11,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:59:11,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:59:11,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:59:11,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:59:11,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:59:11,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:59:11,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:59:11,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:59:11,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:59:11,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:59:11,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:59:11,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:59:11,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:59:11,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:59:11,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:59:11,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:59:11,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:59:11,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:59:11,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:59:11,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:59:11,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:59:11,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:59:11,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:59:11,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:59:11,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:59:11,893 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 10:59:11,919 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:59:11,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:59:11,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:59:11,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:59:11,922 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:59:11,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:59:11,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:59:11,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:59:11,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:59:11,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:59:11,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:59:11,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:59:11,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:59:11,925 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:59:11,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:59:11,926 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:59:11,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:59:11,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:59:11,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:59:11,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:59:11,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:59:11,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:59:11,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:59:11,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:59:11,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:59:11,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:59:11,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:59:11,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:59:11,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:59:11,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:59:11,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:59:11,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:59:12,000 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:59:12,000 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:59:12,001 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.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:59:12,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7997c6db5/b6ba297451bc4888a5522f673bc91260/FLAG9f253c251 [2019-09-08 10:59:12,527 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:59:12,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:59:12,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7997c6db5/b6ba297451bc4888a5522f673bc91260/FLAG9f253c251 [2019-09-08 10:59:12,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7997c6db5/b6ba297451bc4888a5522f673bc91260 [2019-09-08 10:59:12,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:59:12,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:59:12,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:59:12,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:59:12,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:59:12,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:59:12" (1/1) ... [2019-09-08 10:59:12,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:12, skipping insertion in model container [2019-09-08 10:59:12,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:59:12" (1/1) ... [2019-09-08 10:59:12,921 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:59:12,968 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:59:13,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:59:13,374 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:59:13,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:59:13,495 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:59:13,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13 WrapperNode [2019-09-08 10:59:13,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:59:13,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:59:13,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:59:13,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:59:13,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13" (1/1) ... [2019-09-08 10:59:13,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13" (1/1) ... [2019-09-08 10:59:13,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13" (1/1) ... [2019-09-08 10:59:13,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13" (1/1) ... [2019-09-08 10:59:13,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13" (1/1) ... [2019-09-08 10:59:13,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13" (1/1) ... [2019-09-08 10:59:13,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13" (1/1) ... [2019-09-08 10:59:13,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:59:13,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:59:13,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:59:13,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:59:13,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13" (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 10:59:13,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:59:13,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:59:13,620 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:59:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:59:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:59:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:59:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:59:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:59:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:59:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:59:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:59:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:59:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:59:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:59:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:59:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:59:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:59:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:59:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:59:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:59:14,413 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:59:14,413 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:59:14,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:59:14 BoogieIcfgContainer [2019-09-08 10:59:14,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:59:14,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:59:14,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:59:14,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:59:14,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:59:12" (1/3) ... [2019-09-08 10:59:14,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b17c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:59:14, skipping insertion in model container [2019-09-08 10:59:14,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:59:13" (2/3) ... [2019-09-08 10:59:14,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b17c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:59:14, skipping insertion in model container [2019-09-08 10:59:14,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:59:14" (3/3) ... [2019-09-08 10:59:14,429 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:59:14,439 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:59:14,446 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:59:14,463 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:59:14,494 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:59:14,495 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:59:14,495 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:59:14,496 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:59:14,496 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:59:14,496 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:59:14,496 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:59:14,496 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:59:14,497 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:59:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-08 10:59:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 10:59:14,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:14,530 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] [2019-09-08 10:59:14,532 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1503365547, now seen corresponding path program 1 times [2019-09-08 10:59:14,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:14,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:14,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:14,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:14,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:15,037 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 10:59:15,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:15,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:59:15,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:59:15,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:59:15,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:59:15,066 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-09-08 10:59:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:15,181 INFO L93 Difference]: Finished difference Result 329 states and 529 transitions. [2019-09-08 10:59:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:59:15,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 10:59:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:15,209 INFO L225 Difference]: With dead ends: 329 [2019-09-08 10:59:15,210 INFO L226 Difference]: Without dead ends: 219 [2019-09-08 10:59:15,218 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 10:59:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-08 10:59:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-09-08 10:59:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-08 10:59:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 323 transitions. [2019-09-08 10:59:15,335 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 323 transitions. Word has length 64 [2019-09-08 10:59:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:15,336 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 323 transitions. [2019-09-08 10:59:15,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:59:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 323 transitions. [2019-09-08 10:59:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:59:15,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:15,339 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 10:59:15,339 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:15,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:15,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1067938911, now seen corresponding path program 1 times [2019-09-08 10:59:15,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:15,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:15,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:15,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:15,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:15,460 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 10:59:15,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:15,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:59:15,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:59:15,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:59:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:59:15,465 INFO L87 Difference]: Start difference. First operand 217 states and 323 transitions. Second operand 3 states. [2019-09-08 10:59:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:15,555 INFO L93 Difference]: Finished difference Result 541 states and 839 transitions. [2019-09-08 10:59:15,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:59:15,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 10:59:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:15,560 INFO L225 Difference]: With dead ends: 541 [2019-09-08 10:59:15,561 INFO L226 Difference]: Without dead ends: 363 [2019-09-08 10:59:15,563 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 10:59:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-08 10:59:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-09-08 10:59:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-08 10:59:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 552 transitions. [2019-09-08 10:59:15,611 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 552 transitions. Word has length 65 [2019-09-08 10:59:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:15,612 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 552 transitions. [2019-09-08 10:59:15,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:59:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2019-09-08 10:59:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:59:15,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:15,615 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 10:59:15,615 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:15,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2132718422, now seen corresponding path program 1 times [2019-09-08 10:59:15,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:15,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:15,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:15,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:15,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:15,719 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 10:59:15,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:15,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:59:15,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:59:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:59:15,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:59:15,721 INFO L87 Difference]: Start difference. First operand 361 states and 552 transitions. Second operand 3 states. [2019-09-08 10:59:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:15,779 INFO L93 Difference]: Finished difference Result 941 states and 1474 transitions. [2019-09-08 10:59:15,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:59:15,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:59:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:15,784 INFO L225 Difference]: With dead ends: 941 [2019-09-08 10:59:15,784 INFO L226 Difference]: Without dead ends: 619 [2019-09-08 10:59:15,787 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 10:59:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-09-08 10:59:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2019-09-08 10:59:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 10:59:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 956 transitions. [2019-09-08 10:59:15,824 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 956 transitions. Word has length 66 [2019-09-08 10:59:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:15,825 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 956 transitions. [2019-09-08 10:59:15,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:59:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 956 transitions. [2019-09-08 10:59:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:59:15,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:15,827 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 10:59:15,827 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash -523046956, now seen corresponding path program 1 times [2019-09-08 10:59:15,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:15,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:15,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:15,901 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 10:59:15,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:15,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:59:15,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:59:15,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:59:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:59:15,903 INFO L87 Difference]: Start difference. First operand 617 states and 956 transitions. Second operand 3 states. [2019-09-08 10:59:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:15,960 INFO L93 Difference]: Finished difference Result 1645 states and 2582 transitions. [2019-09-08 10:59:15,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:59:15,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:59:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:15,967 INFO L225 Difference]: With dead ends: 1645 [2019-09-08 10:59:15,968 INFO L226 Difference]: Without dead ends: 1067 [2019-09-08 10:59:15,970 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 10:59:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-09-08 10:59:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2019-09-08 10:59:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-09-08 10:59:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1656 transitions. [2019-09-08 10:59:16,031 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1656 transitions. Word has length 67 [2019-09-08 10:59:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:16,032 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1656 transitions. [2019-09-08 10:59:16,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:59:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1656 transitions. [2019-09-08 10:59:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:59:16,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:16,034 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 10:59:16,035 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1868074219, now seen corresponding path program 1 times [2019-09-08 10:59:16,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:16,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:16,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:16,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:16,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:16,148 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 10:59:16,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:16,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:59:16,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:59:16,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:59:16,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:59:16,150 INFO L87 Difference]: Start difference. First operand 1065 states and 1656 transitions. Second operand 3 states. [2019-09-08 10:59:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:16,242 INFO L93 Difference]: Finished difference Result 2861 states and 4474 transitions. [2019-09-08 10:59:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:59:16,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 10:59:16,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:16,254 INFO L225 Difference]: With dead ends: 2861 [2019-09-08 10:59:16,256 INFO L226 Difference]: Without dead ends: 1835 [2019-09-08 10:59:16,259 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 10:59:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-09-08 10:59:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1833. [2019-09-08 10:59:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2019-09-08 10:59:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2840 transitions. [2019-09-08 10:59:16,344 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2840 transitions. Word has length 68 [2019-09-08 10:59:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:16,344 INFO L475 AbstractCegarLoop]: Abstraction has 1833 states and 2840 transitions. [2019-09-08 10:59:16,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:59:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2840 transitions. [2019-09-08 10:59:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:59:16,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:16,349 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 10:59:16,350 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:16,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1423874723, now seen corresponding path program 1 times [2019-09-08 10:59:16,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:16,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:16,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:16,586 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 10:59:16,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:16,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:59:16,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:59:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:59:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:59:16,588 INFO L87 Difference]: Start difference. First operand 1833 states and 2840 transitions. Second operand 7 states. [2019-09-08 10:59:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:17,307 INFO L93 Difference]: Finished difference Result 9443 states and 14605 transitions. [2019-09-08 10:59:17,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:59:17,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-08 10:59:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:17,352 INFO L225 Difference]: With dead ends: 9443 [2019-09-08 10:59:17,352 INFO L226 Difference]: Without dead ends: 7649 [2019-09-08 10:59:17,360 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 10:59:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2019-09-08 10:59:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 7641. [2019-09-08 10:59:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7641 states. [2019-09-08 10:59:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7641 states to 7641 states and 11768 transitions. [2019-09-08 10:59:17,868 INFO L78 Accepts]: Start accepts. Automaton has 7641 states and 11768 transitions. Word has length 69 [2019-09-08 10:59:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:17,869 INFO L475 AbstractCegarLoop]: Abstraction has 7641 states and 11768 transitions. [2019-09-08 10:59:17,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:59:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 7641 states and 11768 transitions. [2019-09-08 10:59:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:59:17,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:17,871 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 10:59:17,871 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:17,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash -500644588, now seen corresponding path program 1 times [2019-09-08 10:59:17,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:17,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:17,949 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 10:59:17,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:17,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:59:17,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:59:17,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:59:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:59:17,951 INFO L87 Difference]: Start difference. First operand 7641 states and 11768 transitions. Second operand 5 states. [2019-09-08 10:59:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:19,150 INFO L93 Difference]: Finished difference Result 22845 states and 35226 transitions. [2019-09-08 10:59:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:59:19,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:59:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:19,252 INFO L225 Difference]: With dead ends: 22845 [2019-09-08 10:59:19,253 INFO L226 Difference]: Without dead ends: 15243 [2019-09-08 10:59:19,273 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 10:59:19,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15243 states. [2019-09-08 10:59:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15243 to 15241. [2019-09-08 10:59:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15241 states. [2019-09-08 10:59:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15241 states to 15241 states and 23352 transitions. [2019-09-08 10:59:20,361 INFO L78 Accepts]: Start accepts. Automaton has 15241 states and 23352 transitions. Word has length 71 [2019-09-08 10:59:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:20,362 INFO L475 AbstractCegarLoop]: Abstraction has 15241 states and 23352 transitions. [2019-09-08 10:59:20,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:59:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 15241 states and 23352 transitions. [2019-09-08 10:59:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:59:20,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:20,363 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 10:59:20,364 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:20,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1116860303, now seen corresponding path program 1 times [2019-09-08 10:59:20,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:20,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:20,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:20,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:20,584 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 10:59:20,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:20,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:59:20,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:59:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:59:20,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:59:20,585 INFO L87 Difference]: Start difference. First operand 15241 states and 23352 transitions. Second operand 7 states. [2019-09-08 10:59:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:23,456 INFO L93 Difference]: Finished difference Result 77973 states and 119646 transitions. [2019-09-08 10:59:23,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:59:23,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 10:59:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:23,621 INFO L225 Difference]: With dead ends: 77973 [2019-09-08 10:59:23,621 INFO L226 Difference]: Without dead ends: 62771 [2019-09-08 10:59:23,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:59:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62771 states. [2019-09-08 10:59:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62771 to 30441. [2019-09-08 10:59:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30441 states. [2019-09-08 10:59:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30441 states to 30441 states and 46024 transitions. [2019-09-08 10:59:25,370 INFO L78 Accepts]: Start accepts. Automaton has 30441 states and 46024 transitions. Word has length 71 [2019-09-08 10:59:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:25,370 INFO L475 AbstractCegarLoop]: Abstraction has 30441 states and 46024 transitions. [2019-09-08 10:59:25,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:59:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 30441 states and 46024 transitions. [2019-09-08 10:59:25,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:59:25,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:25,371 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 10:59:25,371 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:25,372 INFO L82 PathProgramCache]: Analyzing trace with hash 244398304, now seen corresponding path program 1 times [2019-09-08 10:59:25,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:25,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:25,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:25,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:25,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:25,474 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 10:59:25,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:25,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:59:25,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:59:25,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:59:25,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:59:25,476 INFO L87 Difference]: Start difference. First operand 30441 states and 46024 transitions. Second operand 5 states. [2019-09-08 10:59:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:28,207 INFO L93 Difference]: Finished difference Result 62123 states and 93289 transitions. [2019-09-08 10:59:28,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:59:28,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 10:59:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:28,335 INFO L225 Difference]: With dead ends: 62123 [2019-09-08 10:59:28,336 INFO L226 Difference]: Without dead ends: 62121 [2019-09-08 10:59:28,360 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 10:59:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62121 states. [2019-09-08 10:59:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62121 to 31721. [2019-09-08 10:59:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31721 states. [2019-09-08 10:59:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31721 states to 31721 states and 47304 transitions. [2019-09-08 10:59:30,070 INFO L78 Accepts]: Start accepts. Automaton has 31721 states and 47304 transitions. Word has length 72 [2019-09-08 10:59:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:30,071 INFO L475 AbstractCegarLoop]: Abstraction has 31721 states and 47304 transitions. [2019-09-08 10:59:30,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:59:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 31721 states and 47304 transitions. [2019-09-08 10:59:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:59:30,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:30,072 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 10:59:30,072 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:30,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:30,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1003967394, now seen corresponding path program 1 times [2019-09-08 10:59:30,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:30,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:30,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:30,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:30,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:30,150 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 10:59:30,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:30,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:59:30,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:59:30,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:59:30,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:59:30,152 INFO L87 Difference]: Start difference. First operand 31721 states and 47304 transitions. Second operand 3 states. [2019-09-08 10:59:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:32,826 INFO L93 Difference]: Finished difference Result 70719 states and 105276 transitions. [2019-09-08 10:59:32,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:59:32,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:59:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:32,882 INFO L225 Difference]: With dead ends: 70719 [2019-09-08 10:59:32,883 INFO L226 Difference]: Without dead ends: 39037 [2019-09-08 10:59:32,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 10:59:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39037 states. [2019-09-08 10:59:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39037 to 39035. [2019-09-08 10:59:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39035 states. [2019-09-08 10:59:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39035 states to 39035 states and 57866 transitions. [2019-09-08 10:59:34,796 INFO L78 Accepts]: Start accepts. Automaton has 39035 states and 57866 transitions. Word has length 73 [2019-09-08 10:59:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:34,797 INFO L475 AbstractCegarLoop]: Abstraction has 39035 states and 57866 transitions. [2019-09-08 10:59:34,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:59:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 39035 states and 57866 transitions. [2019-09-08 10:59:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:59:34,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:34,815 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] [2019-09-08 10:59:34,815 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:34,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2145575447, now seen corresponding path program 1 times [2019-09-08 10:59:34,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:34,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:34,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:34,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:34,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:34,917 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 10:59:34,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:59:34,918 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 10:59:34,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:35,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 10:59:35,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:59:35,353 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 10:59:35,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:59:35,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 11 [2019-09-08 10:59:35,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:59:35,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:59:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=60, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:59:35,361 INFO L87 Difference]: Start difference. First operand 39035 states and 57866 transitions. Second operand 11 states. [2019-09-08 10:59:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:42,021 INFO L93 Difference]: Finished difference Result 104612 states and 155181 transitions. [2019-09-08 10:59:42,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:59:42,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 10:59:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:42,362 INFO L225 Difference]: With dead ends: 104612 [2019-09-08 10:59:42,363 INFO L226 Difference]: Without dead ends: 72930 [2019-09-08 10:59:42,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=60, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:59:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72930 states. [2019-09-08 10:59:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72930 to 67435. [2019-09-08 10:59:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67435 states. [2019-09-08 10:59:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67435 states to 67435 states and 99290 transitions. [2019-09-08 10:59:46,520 INFO L78 Accepts]: Start accepts. Automaton has 67435 states and 99290 transitions. Word has length 98 [2019-09-08 10:59:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:46,521 INFO L475 AbstractCegarLoop]: Abstraction has 67435 states and 99290 transitions. [2019-09-08 10:59:46,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:59:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 67435 states and 99290 transitions. [2019-09-08 10:59:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 10:59:46,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:46,543 INFO L399 BasicCegarLoop]: trace histogram [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 10:59:46,543 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1615048955, now seen corresponding path program 1 times [2019-09-08 10:59:46,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:46,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:46,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:46,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:46,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:46,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:59:46,678 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 10:59:46,692 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 10:59:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:46,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:59:46,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:59:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 10:59:46,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:59:46,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:59:46,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:59:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:59:46,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:59:46,996 INFO L87 Difference]: Start difference. First operand 67435 states and 99290 transitions. Second operand 11 states. [2019-09-08 10:59:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:54,490 INFO L93 Difference]: Finished difference Result 154067 states and 225026 transitions. [2019-09-08 10:59:54,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:59:54,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-08 10:59:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:54,656 INFO L225 Difference]: With dead ends: 154067 [2019-09-08 10:59:54,656 INFO L226 Difference]: Without dead ends: 108265 [2019-09-08 10:59:54,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:59:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108265 states. [2019-09-08 10:59:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108265 to 70523. [2019-09-08 10:59:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70523 states. [2019-09-08 10:59:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70523 states to 70523 states and 102902 transitions. [2019-09-08 10:59:59,180 INFO L78 Accepts]: Start accepts. Automaton has 70523 states and 102902 transitions. Word has length 99 [2019-09-08 10:59:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:59,180 INFO L475 AbstractCegarLoop]: Abstraction has 70523 states and 102902 transitions. [2019-09-08 10:59:59,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:59:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 70523 states and 102902 transitions. [2019-09-08 10:59:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 10:59:59,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:59,197 INFO L399 BasicCegarLoop]: trace histogram [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 10:59:59,197 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash -298429788, now seen corresponding path program 1 times [2019-09-08 10:59:59,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:59,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:59,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:59,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:59,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:59,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:59:59,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:59:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:59:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:59:59,276 INFO L87 Difference]: Start difference. First operand 70523 states and 102902 transitions. Second operand 3 states. [2019-09-08 11:00:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:05,453 INFO L93 Difference]: Finished difference Result 124229 states and 181626 transitions. [2019-09-08 11:00:05,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:00:05,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:00:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:05,584 INFO L225 Difference]: With dead ends: 124229 [2019-09-08 11:00:05,584 INFO L226 Difference]: Without dead ends: 92995 [2019-09-08 11:00:05,638 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:00:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92995 states. [2019-09-08 11:00:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92995 to 87001. [2019-09-08 11:00:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87001 states. [2019-09-08 11:00:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87001 states to 87001 states and 125824 transitions. [2019-09-08 11:00:13,059 INFO L78 Accepts]: Start accepts. Automaton has 87001 states and 125824 transitions. Word has length 99 [2019-09-08 11:00:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:13,060 INFO L475 AbstractCegarLoop]: Abstraction has 87001 states and 125824 transitions. [2019-09-08 11:00:13,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:00:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 87001 states and 125824 transitions. [2019-09-08 11:00:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:00:13,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:13,077 INFO L399 BasicCegarLoop]: trace histogram [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 11:00:13,077 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash -785265619, now seen corresponding path program 1 times [2019-09-08 11:00:13,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:13,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:13,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:13,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:00:13,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:00:13,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:00:13,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:13,141 INFO L87 Difference]: Start difference. First operand 87001 states and 125824 transitions. Second operand 3 states. [2019-09-08 11:00:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:18,898 INFO L93 Difference]: Finished difference Result 127553 states and 184337 transitions. [2019-09-08 11:00:18,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:00:18,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:00:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:18,996 INFO L225 Difference]: With dead ends: 127553 [2019-09-08 11:00:18,996 INFO L226 Difference]: Without dead ends: 90946 [2019-09-08 11:00:19,030 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:00:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90946 states. [2019-09-08 11:00:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90946 to 87909. [2019-09-08 11:00:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87909 states. [2019-09-08 11:00:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87909 states to 87909 states and 125370 transitions. [2019-09-08 11:00:24,801 INFO L78 Accepts]: Start accepts. Automaton has 87909 states and 125370 transitions. Word has length 99 [2019-09-08 11:00:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:24,802 INFO L475 AbstractCegarLoop]: Abstraction has 87909 states and 125370 transitions. [2019-09-08 11:00:24,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:00:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 87909 states and 125370 transitions. [2019-09-08 11:00:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:00:24,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:24,814 INFO L399 BasicCegarLoop]: trace histogram [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 11:00:24,814 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:24,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1180021061, now seen corresponding path program 1 times [2019-09-08 11:00:24,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:24,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:24,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:24,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:24,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:24,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:24,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:00:24,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:00:24,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:00:24,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:24,890 INFO L87 Difference]: Start difference. First operand 87909 states and 125370 transitions. Second operand 3 states. [2019-09-08 11:00:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:34,431 INFO L93 Difference]: Finished difference Result 199680 states and 285295 transitions. [2019-09-08 11:00:34,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:00:34,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:00:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:34,592 INFO L225 Difference]: With dead ends: 199680 [2019-09-08 11:00:34,592 INFO L226 Difference]: Without dead ends: 135077 [2019-09-08 11:00:34,651 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:00:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135077 states. [2019-09-08 11:00:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135077 to 132962. [2019-09-08 11:00:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132962 states. [2019-09-08 11:00:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132962 states to 132962 states and 187996 transitions. [2019-09-08 11:00:43,481 INFO L78 Accepts]: Start accepts. Automaton has 132962 states and 187996 transitions. Word has length 99 [2019-09-08 11:00:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:43,481 INFO L475 AbstractCegarLoop]: Abstraction has 132962 states and 187996 transitions. [2019-09-08 11:00:43,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:00:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 132962 states and 187996 transitions. [2019-09-08 11:00:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:00:43,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:43,498 INFO L399 BasicCegarLoop]: trace histogram [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 11:00:43,498 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:43,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2074205712, now seen corresponding path program 1 times [2019-09-08 11:00:43,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:43,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:43,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:43,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:43,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:43,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:43,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:00:43,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:00:43,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:00:43,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:43,566 INFO L87 Difference]: Start difference. First operand 132962 states and 187996 transitions. Second operand 3 states. [2019-09-08 11:00:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:59,662 INFO L93 Difference]: Finished difference Result 352594 states and 497387 transitions. [2019-09-08 11:00:59,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:00:59,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:00:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:59,988 INFO L225 Difference]: With dead ends: 352594 [2019-09-08 11:00:59,988 INFO L226 Difference]: Without dead ends: 229771 [2019-09-08 11:01:00,094 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:01:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229771 states. [2019-09-08 11:01:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229771 to 227864. [2019-09-08 11:01:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227864 states. [2019-09-08 11:01:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227864 states to 227864 states and 318248 transitions. [2019-09-08 11:01:19,237 INFO L78 Accepts]: Start accepts. Automaton has 227864 states and 318248 transitions. Word has length 99 [2019-09-08 11:01:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:19,238 INFO L475 AbstractCegarLoop]: Abstraction has 227864 states and 318248 transitions. [2019-09-08 11:01:19,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:01:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 227864 states and 318248 transitions. [2019-09-08 11:01:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:01:19,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:19,267 INFO L399 BasicCegarLoop]: trace histogram [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 11:01:19,267 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:19,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1732651124, now seen corresponding path program 1 times [2019-09-08 11:01:19,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:19,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:19,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:19,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:19,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:19,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:01:19,398 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 11:01:19,415 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 11:01:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:19,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:01:19,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:01:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:19,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:01:19,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:01:19,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:01:19,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:01:19,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:01:19,674 INFO L87 Difference]: Start difference. First operand 227864 states and 318248 transitions. Second operand 11 states. [2019-09-08 11:02:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:11,353 INFO L93 Difference]: Finished difference Result 805289 states and 1123769 transitions. [2019-09-08 11:02:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:02:11,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-08 11:02:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:12,348 INFO L225 Difference]: With dead ends: 805289 [2019-09-08 11:02:12,348 INFO L226 Difference]: Without dead ends: 591069 [2019-09-08 11:02:12,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 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:02:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591069 states. [2019-09-08 11:02:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591069 to 262611. [2019-09-08 11:02:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262611 states. [2019-09-08 11:02:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262611 states to 262611 states and 367301 transitions. [2019-09-08 11:02:41,035 INFO L78 Accepts]: Start accepts. Automaton has 262611 states and 367301 transitions. Word has length 99 [2019-09-08 11:02:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:41,036 INFO L475 AbstractCegarLoop]: Abstraction has 262611 states and 367301 transitions. [2019-09-08 11:02:41,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:02:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 262611 states and 367301 transitions. [2019-09-08 11:02:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:02:41,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:41,060 INFO L399 BasicCegarLoop]: trace histogram [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 11:02:41,060 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180918, now seen corresponding path program 1 times [2019-09-08 11:02:41,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:41,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:41,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 11:02:41,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:41,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:41,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:41,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:41,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:41,183 INFO L87 Difference]: Start difference. First operand 262611 states and 367301 transitions. Second operand 5 states. [2019-09-08 11:03:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:18,633 INFO L93 Difference]: Finished difference Result 657208 states and 917526 transitions. [2019-09-08 11:03:18,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:03:18,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:03:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:19,747 INFO L225 Difference]: With dead ends: 657208 [2019-09-08 11:03:19,747 INFO L226 Difference]: Without dead ends: 394712 [2019-09-08 11:03:19,940 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:03:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394712 states. [2019-09-08 11:03:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394712 to 393310. [2019-09-08 11:03:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393310 states. [2019-09-08 11:03:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393310 states to 393310 states and 546314 transitions. [2019-09-08 11:03:59,994 INFO L78 Accepts]: Start accepts. Automaton has 393310 states and 546314 transitions. Word has length 99 [2019-09-08 11:03:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:59,994 INFO L475 AbstractCegarLoop]: Abstraction has 393310 states and 546314 transitions. [2019-09-08 11:03:59,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:03:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 393310 states and 546314 transitions. [2019-09-08 11:04:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:04:00,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:00,019 INFO L399 BasicCegarLoop]: trace histogram [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 11:04:00,020 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:00,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash -343746299, now seen corresponding path program 1 times [2019-09-08 11:04:00,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:00,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:00,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:00,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:06,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:04:06,322 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) [2019-09-08 11:04:06,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:04:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:06,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:04:06,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:04:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:06,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:04:06,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:04:06,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:04:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:04:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:04:06,565 INFO L87 Difference]: Start difference. First operand 393310 states and 546314 transitions. Second operand 11 states. [2019-09-08 11:05:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:23,737 INFO L93 Difference]: Finished difference Result 1089075 states and 1510347 transitions. [2019-09-08 11:05:23,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:05:23,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-08 11:05:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:25,012 INFO L225 Difference]: With dead ends: 1089075 [2019-09-08 11:05:25,013 INFO L226 Difference]: Without dead ends: 770794 [2019-09-08 11:05:26,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:05:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770794 states. [2019-09-08 11:06:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770794 to 418607. [2019-09-08 11:06:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418607 states. [2019-09-08 11:06:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418607 states to 418607 states and 581708 transitions. [2019-09-08 11:06:18,470 INFO L78 Accepts]: Start accepts. Automaton has 418607 states and 581708 transitions. Word has length 99 [2019-09-08 11:06:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:18,470 INFO L475 AbstractCegarLoop]: Abstraction has 418607 states and 581708 transitions. [2019-09-08 11:06:18,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:06:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 418607 states and 581708 transitions. [2019-09-08 11:06:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:06:18,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:18,502 INFO L399 BasicCegarLoop]: trace histogram [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 11:06:18,502 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:18,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:18,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1410724101, now seen corresponding path program 1 times [2019-09-08 11:06:18,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:18,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:18,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:06:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:18,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:06:18,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:18,584 INFO L87 Difference]: Start difference. First operand 418607 states and 581708 transitions. Second operand 5 states. [2019-09-08 11:07:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:34,970 INFO L93 Difference]: Finished difference Result 1053866 states and 1461805 transitions. [2019-09-08 11:07:34,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:07:34,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:07:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:36,008 INFO L225 Difference]: With dead ends: 1053866 [2019-09-08 11:07:36,009 INFO L226 Difference]: Without dead ends: 635467 [2019-09-08 11:07:37,461 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:07:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635467 states. [2019-09-08 11:08:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635467 to 633378. [2019-09-08 11:08:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633378 states. [2019-09-08 11:08:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633378 states to 633378 states and 874251 transitions. [2019-09-08 11:08:51,957 INFO L78 Accepts]: Start accepts. Automaton has 633378 states and 874251 transitions. Word has length 99 [2019-09-08 11:08:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:51,957 INFO L475 AbstractCegarLoop]: Abstraction has 633378 states and 874251 transitions. [2019-09-08 11:08:51,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:08:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 633378 states and 874251 transitions. [2019-09-08 11:08:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:08:51,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:51,989 INFO L399 BasicCegarLoop]: trace histogram [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 11:08:51,989 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash -423295904, now seen corresponding path program 1 times [2019-09-08 11:08:51,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:51,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:51,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:51,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:51,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:08:52,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:08:52,088 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 11:08:52,103 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 11:08:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:52,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:08:52,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:08:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 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 11:08:52,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:08:52,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:08:52,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:08:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:08:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:08:52,307 INFO L87 Difference]: Start difference. First operand 633378 states and 874251 transitions. Second operand 11 states.