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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:14:52,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:14:52,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:14:52,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:14:52,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:14:52,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:14:52,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:14:52,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:14:52,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:14:52,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:14:52,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:14:52,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:14:52,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:14:52,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:14:52,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:14:52,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:14:52,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:14:52,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:14:52,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:14:52,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:14:52,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:14:52,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:14:52,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:14:52,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:14:52,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:14:52,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:14:52,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:14:52,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:14:52,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:14:52,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:14:52,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:14:52,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:14:52,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:14:52,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:14:52,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:14:52,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:14:52,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:14:52,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:14:52,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:14:52,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:14:52,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:14:52,999 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:14:53,013 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:14:53,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:14:53,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:14:53,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:14:53,015 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:14:53,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:14:53,016 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:14:53,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:14:53,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:14:53,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:14:53,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:14:53,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:14:53,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:14:53,017 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:14:53,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:14:53,017 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:14:53,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:14:53,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:14:53,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:14:53,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:14:53,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:14:53,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:14:53,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:14:53,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:14:53,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:14:53,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:14:53,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:14:53,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:14:53,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:14:53,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:14:53,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:14:53,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:14:53,065 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:14:53,065 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:14:53,066 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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 10:14:53,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ad415fc/c49c1d8816e940c5854b98aad677c037/FLAG95661e6df [2019-09-08 10:14:53,766 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:14:53,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 10:14:53,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ad415fc/c49c1d8816e940c5854b98aad677c037/FLAG95661e6df [2019-09-08 10:14:54,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ad415fc/c49c1d8816e940c5854b98aad677c037 [2019-09-08 10:14:54,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:14:54,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:14:54,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:14:54,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:14:54,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:14:54,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:14:54" (1/1) ... [2019-09-08 10:14:54,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c2cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:54, skipping insertion in model container [2019-09-08 10:14:54,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:14:54" (1/1) ... [2019-09-08 10:14:54,053 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:14:54,141 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:14:54,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:14:54,819 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:14:55,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:14:55,295 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:14:55,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55 WrapperNode [2019-09-08 10:14:55,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:14:55,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:14:55,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:14:55,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:14:55,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55" (1/1) ... [2019-09-08 10:14:55,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55" (1/1) ... [2019-09-08 10:14:55,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55" (1/1) ... [2019-09-08 10:14:55,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55" (1/1) ... [2019-09-08 10:14:55,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55" (1/1) ... [2019-09-08 10:14:55,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55" (1/1) ... [2019-09-08 10:14:55,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55" (1/1) ... [2019-09-08 10:14:55,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:14:55,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:14:55,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:14:55,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:14:55,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55" (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:14:55,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:14:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:14:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:14:55,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:14:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:14:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:14:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:14:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:14:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:14:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:14:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:14:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:14:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:14:55,517 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:14:55,517 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:14:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:14:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:14:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:14:57,629 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:14:57,629 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:14:57,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:14:57 BoogieIcfgContainer [2019-09-08 10:14:57,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:14:57,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:14:57,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:14:57,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:14:57,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:14:54" (1/3) ... [2019-09-08 10:14:57,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45be0dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:14:57, skipping insertion in model container [2019-09-08 10:14:57,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:55" (2/3) ... [2019-09-08 10:14:57,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45be0dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:14:57, skipping insertion in model container [2019-09-08 10:14:57,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:14:57" (3/3) ... [2019-09-08 10:14:57,639 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 10:14:57,648 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:14:57,657 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-08 10:14:57,673 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-08 10:14:57,709 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:14:57,710 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:14:57,710 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:14:57,710 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:14:57,710 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:14:57,711 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:14:57,711 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:14:57,711 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:14:57,711 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:14:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states. [2019-09-08 10:14:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:14:57,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:57,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:57,770 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash 612696190, now seen corresponding path program 1 times [2019-09-08 10:14:57,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:57,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:57,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:57,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:57,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:58,257 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:14:58,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:58,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:14:58,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:14:58,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:14:58,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:14:58,282 INFO L87 Difference]: Start difference. First operand 462 states. Second operand 5 states. [2019-09-08 10:14:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:58,929 INFO L93 Difference]: Finished difference Result 843 states and 1483 transitions. [2019-09-08 10:14:58,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:14:58,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-08 10:14:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:58,948 INFO L225 Difference]: With dead ends: 843 [2019-09-08 10:14:58,948 INFO L226 Difference]: Without dead ends: 490 [2019-09-08 10:14:58,954 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:14:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-08 10:14:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 484. [2019-09-08 10:14:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-08 10:14:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 654 transitions. [2019-09-08 10:14:59,058 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 654 transitions. Word has length 55 [2019-09-08 10:14:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:59,058 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 654 transitions. [2019-09-08 10:14:59,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:14:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 654 transitions. [2019-09-08 10:14:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:14:59,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:59,067 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] [2019-09-08 10:14:59,067 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:59,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1659380668, now seen corresponding path program 1 times [2019-09-08 10:14:59,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:59,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:59,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:59,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:59,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:59,253 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:14:59,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:59,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:59,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:59,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:59,257 INFO L87 Difference]: Start difference. First operand 484 states and 654 transitions. Second operand 3 states. [2019-09-08 10:14:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:59,381 INFO L93 Difference]: Finished difference Result 1035 states and 1443 transitions. [2019-09-08 10:14:59,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:59,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:14:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:59,388 INFO L225 Difference]: With dead ends: 1035 [2019-09-08 10:14:59,388 INFO L226 Difference]: Without dead ends: 766 [2019-09-08 10:14:59,390 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:14:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-09-08 10:14:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 758. [2019-09-08 10:14:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-09-08 10:14:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1033 transitions. [2019-09-08 10:14:59,433 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1033 transitions. Word has length 56 [2019-09-08 10:14:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:59,433 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 1033 transitions. [2019-09-08 10:14:59,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1033 transitions. [2019-09-08 10:14:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:14:59,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:59,436 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] [2019-09-08 10:14:59,437 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash 438922513, now seen corresponding path program 1 times [2019-09-08 10:14:59,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:59,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:59,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:59,512 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:14:59,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:59,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:59,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:59,514 INFO L87 Difference]: Start difference. First operand 758 states and 1033 transitions. Second operand 3 states. [2019-09-08 10:14:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:59,611 INFO L93 Difference]: Finished difference Result 1528 states and 2158 transitions. [2019-09-08 10:14:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:59,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:14:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:59,622 INFO L225 Difference]: With dead ends: 1528 [2019-09-08 10:14:59,623 INFO L226 Difference]: Without dead ends: 1102 [2019-09-08 10:14:59,625 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:14:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-09-08 10:14:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1096. [2019-09-08 10:14:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-09-08 10:14:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1517 transitions. [2019-09-08 10:14:59,686 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1517 transitions. Word has length 56 [2019-09-08 10:14:59,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:59,688 INFO L475 AbstractCegarLoop]: Abstraction has 1096 states and 1517 transitions. [2019-09-08 10:14:59,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1517 transitions. [2019-09-08 10:14:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:14:59,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:59,691 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] [2019-09-08 10:14:59,691 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:59,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2011379690, now seen corresponding path program 1 times [2019-09-08 10:14:59,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:59,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:59,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:59,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:59,807 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:14:59,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:59,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:14:59,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:14:59,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:14:59,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:14:59,808 INFO L87 Difference]: Start difference. First operand 1096 states and 1517 transitions. Second operand 6 states. [2019-09-08 10:15:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:00,322 INFO L93 Difference]: Finished difference Result 2804 states and 3988 transitions. [2019-09-08 10:15:00,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:15:00,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:15:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:00,333 INFO L225 Difference]: With dead ends: 2804 [2019-09-08 10:15:00,333 INFO L226 Difference]: Without dead ends: 1884 [2019-09-08 10:15:00,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:15:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2019-09-08 10:15:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1864. [2019-09-08 10:15:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2019-09-08 10:15:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2655 transitions. [2019-09-08 10:15:00,433 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2655 transitions. Word has length 56 [2019-09-08 10:15:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:00,434 INFO L475 AbstractCegarLoop]: Abstraction has 1864 states and 2655 transitions. [2019-09-08 10:15:00,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:15:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2655 transitions. [2019-09-08 10:15:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:15:00,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:00,437 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] [2019-09-08 10:15:00,437 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:00,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:00,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1500009087, now seen corresponding path program 1 times [2019-09-08 10:15:00,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:00,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:00,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:00,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:00,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:00,569 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:15:00,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:00,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:15:00,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:15:00,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:15:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:15:00,572 INFO L87 Difference]: Start difference. First operand 1864 states and 2655 transitions. Second operand 6 states. [2019-09-08 10:15:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:01,103 INFO L93 Difference]: Finished difference Result 6034 states and 8700 transitions. [2019-09-08 10:15:01,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:15:01,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:15:01,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:01,126 INFO L225 Difference]: With dead ends: 6034 [2019-09-08 10:15:01,126 INFO L226 Difference]: Without dead ends: 4346 [2019-09-08 10:15:01,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:15:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-09-08 10:15:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4331. [2019-09-08 10:15:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2019-09-08 10:15:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 6196 transitions. [2019-09-08 10:15:01,426 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 6196 transitions. Word has length 57 [2019-09-08 10:15:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:01,427 INFO L475 AbstractCegarLoop]: Abstraction has 4331 states and 6196 transitions. [2019-09-08 10:15:01,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:15:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 6196 transitions. [2019-09-08 10:15:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:15:01,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:01,430 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] [2019-09-08 10:15:01,430 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:01,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1393968156, now seen corresponding path program 1 times [2019-09-08 10:15:01,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:01,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:01,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:01,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:01,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:15:01,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:01,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:01,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:01,522 INFO L87 Difference]: Start difference. First operand 4331 states and 6196 transitions. Second operand 3 states. [2019-09-08 10:15:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:01,800 INFO L93 Difference]: Finished difference Result 9879 states and 14281 transitions. [2019-09-08 10:15:01,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:15:01,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-08 10:15:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:01,831 INFO L225 Difference]: With dead ends: 9879 [2019-09-08 10:15:01,832 INFO L226 Difference]: Without dead ends: 6265 [2019-09-08 10:15:01,841 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:15:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6265 states. [2019-09-08 10:15:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6265 to 6218. [2019-09-08 10:15:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2019-09-08 10:15:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 8819 transitions. [2019-09-08 10:15:02,232 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 8819 transitions. Word has length 57 [2019-09-08 10:15:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:02,234 INFO L475 AbstractCegarLoop]: Abstraction has 6218 states and 8819 transitions. [2019-09-08 10:15:02,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:15:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 8819 transitions. [2019-09-08 10:15:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:15:02,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:02,238 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] [2019-09-08 10:15:02,238 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:02,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:02,238 INFO L82 PathProgramCache]: Analyzing trace with hash 605372369, now seen corresponding path program 1 times [2019-09-08 10:15:02,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:02,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:02,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:02,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:02,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:02,367 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:15:02,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:02,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:15:02,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:15:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:15:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:15:02,370 INFO L87 Difference]: Start difference. First operand 6218 states and 8819 transitions. Second operand 7 states. [2019-09-08 10:15:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:04,061 INFO L93 Difference]: Finished difference Result 23316 states and 33458 transitions. [2019-09-08 10:15:04,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:15:04,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:15:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:04,582 INFO L225 Difference]: With dead ends: 23316 [2019-09-08 10:15:04,582 INFO L226 Difference]: Without dead ends: 20805 [2019-09-08 10:15:04,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:15:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20805 states. [2019-09-08 10:15:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20805 to 6240. [2019-09-08 10:15:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6240 states. [2019-09-08 10:15:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6240 states to 6240 states and 8850 transitions. [2019-09-08 10:15:05,102 INFO L78 Accepts]: Start accepts. Automaton has 6240 states and 8850 transitions. Word has length 58 [2019-09-08 10:15:05,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:05,103 INFO L475 AbstractCegarLoop]: Abstraction has 6240 states and 8850 transitions. [2019-09-08 10:15:05,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:15:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6240 states and 8850 transitions. [2019-09-08 10:15:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:15:05,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:05,107 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] [2019-09-08 10:15:05,108 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash -879419620, now seen corresponding path program 1 times [2019-09-08 10:15:05,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:05,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:05,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:05,203 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:15:05,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:05,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:15:05,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:15:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:15:05,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:15:05,205 INFO L87 Difference]: Start difference. First operand 6240 states and 8850 transitions. Second operand 7 states. [2019-09-08 10:15:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:06,712 INFO L93 Difference]: Finished difference Result 20921 states and 29930 transitions. [2019-09-08 10:15:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:15:06,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:15:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:06,754 INFO L225 Difference]: With dead ends: 20921 [2019-09-08 10:15:06,755 INFO L226 Difference]: Without dead ends: 18129 [2019-09-08 10:15:06,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:15:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18129 states. [2019-09-08 10:15:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18129 to 6254. [2019-09-08 10:15:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6254 states. [2019-09-08 10:15:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 8868 transitions. [2019-09-08 10:15:07,276 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 8868 transitions. Word has length 58 [2019-09-08 10:15:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:07,276 INFO L475 AbstractCegarLoop]: Abstraction has 6254 states and 8868 transitions. [2019-09-08 10:15:07,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:15:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 8868 transitions. [2019-09-08 10:15:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:15:07,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:07,280 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] [2019-09-08 10:15:07,281 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:07,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:07,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1079105450, now seen corresponding path program 1 times [2019-09-08 10:15:07,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:07,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:07,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:07,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:07,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:07,374 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:15:07,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:07,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:15:07,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:15:07,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:15:07,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:15:07,376 INFO L87 Difference]: Start difference. First operand 6254 states and 8868 transitions. Second operand 7 states. [2019-09-08 10:15:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:09,932 INFO L93 Difference]: Finished difference Result 30204 states and 43172 transitions. [2019-09-08 10:15:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:15:09,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:15:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:09,986 INFO L225 Difference]: With dead ends: 30204 [2019-09-08 10:15:09,986 INFO L226 Difference]: Without dead ends: 27809 [2019-09-08 10:15:09,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:15:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27809 states. [2019-09-08 10:15:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27809 to 6288. [2019-09-08 10:15:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6288 states. [2019-09-08 10:15:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6288 states to 6288 states and 8912 transitions. [2019-09-08 10:15:10,818 INFO L78 Accepts]: Start accepts. Automaton has 6288 states and 8912 transitions. Word has length 58 [2019-09-08 10:15:10,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:10,819 INFO L475 AbstractCegarLoop]: Abstraction has 6288 states and 8912 transitions. [2019-09-08 10:15:10,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:15:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6288 states and 8912 transitions. [2019-09-08 10:15:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:15:10,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:10,823 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] [2019-09-08 10:15:10,823 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:10,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:10,824 INFO L82 PathProgramCache]: Analyzing trace with hash 184722790, now seen corresponding path program 1 times [2019-09-08 10:15:10,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:10,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:10,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:10,972 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:15:10,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:10,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:15:10,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:15:10,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:15:10,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:15:10,974 INFO L87 Difference]: Start difference. First operand 6288 states and 8912 transitions. Second operand 9 states. [2019-09-08 10:15:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:14,156 INFO L93 Difference]: Finished difference Result 27058 states and 38940 transitions. [2019-09-08 10:15:14,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:15:14,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-08 10:15:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:14,199 INFO L225 Difference]: With dead ends: 27058 [2019-09-08 10:15:14,199 INFO L226 Difference]: Without dead ends: 22597 [2019-09-08 10:15:14,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:15:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22597 states. [2019-09-08 10:15:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22597 to 6254. [2019-09-08 10:15:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6254 states. [2019-09-08 10:15:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 8866 transitions. [2019-09-08 10:15:14,892 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 8866 transitions. Word has length 59 [2019-09-08 10:15:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:14,892 INFO L475 AbstractCegarLoop]: Abstraction has 6254 states and 8866 transitions. [2019-09-08 10:15:14,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:15:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 8866 transitions. [2019-09-08 10:15:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:15:14,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:14,896 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] [2019-09-08 10:15:14,897 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:14,897 INFO L82 PathProgramCache]: Analyzing trace with hash -869337794, now seen corresponding path program 1 times [2019-09-08 10:15:14,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:14,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:14,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:14,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:14,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:15:15,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:15,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:15:15,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:15:15,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:15:15,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:15:15,066 INFO L87 Difference]: Start difference. First operand 6254 states and 8866 transitions. Second operand 9 states. [2019-09-08 10:15:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:18,228 INFO L93 Difference]: Finished difference Result 22536 states and 32819 transitions. [2019-09-08 10:15:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:15:18,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-08 10:15:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:18,253 INFO L225 Difference]: With dead ends: 22536 [2019-09-08 10:15:18,253 INFO L226 Difference]: Without dead ends: 22531 [2019-09-08 10:15:18,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:15:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22531 states. [2019-09-08 10:15:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22531 to 6254. [2019-09-08 10:15:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6254 states. [2019-09-08 10:15:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 8864 transitions. [2019-09-08 10:15:19,038 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 8864 transitions. Word has length 59 [2019-09-08 10:15:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:19,038 INFO L475 AbstractCegarLoop]: Abstraction has 6254 states and 8864 transitions. [2019-09-08 10:15:19,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:15:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 8864 transitions. [2019-09-08 10:15:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:15:19,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:19,041 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] [2019-09-08 10:15:19,041 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:19,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:19,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2011941325, now seen corresponding path program 1 times [2019-09-08 10:15:19,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:19,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:19,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:19,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:19,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:19,170 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:15:19,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:19,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:15:19,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:15:19,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:15:19,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:15:19,171 INFO L87 Difference]: Start difference. First operand 6254 states and 8864 transitions. Second operand 8 states. [2019-09-08 10:15:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:21,861 INFO L93 Difference]: Finished difference Result 22917 states and 33200 transitions. [2019-09-08 10:15:21,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:15:21,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-09-08 10:15:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:21,882 INFO L225 Difference]: With dead ends: 22917 [2019-09-08 10:15:21,882 INFO L226 Difference]: Without dead ends: 18078 [2019-09-08 10:15:21,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:15:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18078 states. [2019-09-08 10:15:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18078 to 6097. [2019-09-08 10:15:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6097 states. [2019-09-08 10:15:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6097 states to 6097 states and 8658 transitions. [2019-09-08 10:15:22,441 INFO L78 Accepts]: Start accepts. Automaton has 6097 states and 8658 transitions. Word has length 59 [2019-09-08 10:15:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:22,442 INFO L475 AbstractCegarLoop]: Abstraction has 6097 states and 8658 transitions. [2019-09-08 10:15:22,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:15:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6097 states and 8658 transitions. [2019-09-08 10:15:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:15:22,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:22,444 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] [2019-09-08 10:15:22,444 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2023106222, now seen corresponding path program 1 times [2019-09-08 10:15:22,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:22,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:22,507 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:15:22,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:22,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:22,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:22,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:22,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:22,509 INFO L87 Difference]: Start difference. First operand 6097 states and 8658 transitions. Second operand 3 states. [2019-09-08 10:15:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:23,096 INFO L93 Difference]: Finished difference Result 8901 states and 12691 transitions. [2019-09-08 10:15:23,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:15:23,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:15:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:23,102 INFO L225 Difference]: With dead ends: 8901 [2019-09-08 10:15:23,102 INFO L226 Difference]: Without dead ends: 6103 [2019-09-08 10:15:23,108 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:15:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2019-09-08 10:15:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 6097. [2019-09-08 10:15:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6097 states. [2019-09-08 10:15:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6097 states to 6097 states and 8566 transitions. [2019-09-08 10:15:23,771 INFO L78 Accepts]: Start accepts. Automaton has 6097 states and 8566 transitions. Word has length 60 [2019-09-08 10:15:23,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:23,772 INFO L475 AbstractCegarLoop]: Abstraction has 6097 states and 8566 transitions. [2019-09-08 10:15:23,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:15:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6097 states and 8566 transitions. [2019-09-08 10:15:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:15:23,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:23,775 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] [2019-09-08 10:15:23,775 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2132862918, now seen corresponding path program 1 times [2019-09-08 10:15:23,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:23,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:23,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:23,839 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:15:23,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:23,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:23,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:23,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:23,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:23,841 INFO L87 Difference]: Start difference. First operand 6097 states and 8566 transitions. Second operand 3 states. [2019-09-08 10:15:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:24,453 INFO L93 Difference]: Finished difference Result 8830 states and 12455 transitions. [2019-09-08 10:15:24,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:15:24,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:15:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:24,459 INFO L225 Difference]: With dead ends: 8830 [2019-09-08 10:15:24,459 INFO L226 Difference]: Without dead ends: 6104 [2019-09-08 10:15:24,463 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:15:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6104 states. [2019-09-08 10:15:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6104 to 6097. [2019-09-08 10:15:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6097 states. [2019-09-08 10:15:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6097 states to 6097 states and 8466 transitions. [2019-09-08 10:15:24,963 INFO L78 Accepts]: Start accepts. Automaton has 6097 states and 8466 transitions. Word has length 60 [2019-09-08 10:15:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:24,963 INFO L475 AbstractCegarLoop]: Abstraction has 6097 states and 8466 transitions. [2019-09-08 10:15:24,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:15:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 6097 states and 8466 transitions. [2019-09-08 10:15:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:15:24,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:24,967 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] [2019-09-08 10:15:24,967 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1598100968, now seen corresponding path program 1 times [2019-09-08 10:15:24,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:24,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:24,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:24,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:24,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:15:25,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:25,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:25,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:25,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:25,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:25,025 INFO L87 Difference]: Start difference. First operand 6097 states and 8466 transitions. Second operand 3 states. [2019-09-08 10:15:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:25,585 INFO L93 Difference]: Finished difference Result 8634 states and 11968 transitions. [2019-09-08 10:15:25,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:15:25,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:15:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:25,591 INFO L225 Difference]: With dead ends: 8634 [2019-09-08 10:15:25,591 INFO L226 Difference]: Without dead ends: 6063 [2019-09-08 10:15:25,595 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:15:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2019-09-08 10:15:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 6057. [2019-09-08 10:15:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6057 states. [2019-09-08 10:15:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6057 states to 6057 states and 8239 transitions. [2019-09-08 10:15:26,141 INFO L78 Accepts]: Start accepts. Automaton has 6057 states and 8239 transitions. Word has length 60 [2019-09-08 10:15:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:26,141 INFO L475 AbstractCegarLoop]: Abstraction has 6057 states and 8239 transitions. [2019-09-08 10:15:26,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:15:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6057 states and 8239 transitions. [2019-09-08 10:15:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:15:26,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:26,144 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:15:26,145 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:26,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1654307287, now seen corresponding path program 1 times [2019-09-08 10:15:26,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:26,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:26,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:26,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:26,203 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:15:26,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:26,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:26,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:26,204 INFO L87 Difference]: Start difference. First operand 6057 states and 8239 transitions. Second operand 3 states. [2019-09-08 10:15:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:26,977 INFO L93 Difference]: Finished difference Result 9785 states and 13395 transitions. [2019-09-08 10:15:26,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:15:26,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:15:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:26,984 INFO L225 Difference]: With dead ends: 9785 [2019-09-08 10:15:26,984 INFO L226 Difference]: Without dead ends: 7053 [2019-09-08 10:15:26,989 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:15:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7053 states. [2019-09-08 10:15:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7053 to 5674. [2019-09-08 10:15:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5674 states. [2019-09-08 10:15:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 7737 transitions. [2019-09-08 10:15:27,479 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 7737 transitions. Word has length 61 [2019-09-08 10:15:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:27,479 INFO L475 AbstractCegarLoop]: Abstraction has 5674 states and 7737 transitions. [2019-09-08 10:15:27,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:15:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 7737 transitions. [2019-09-08 10:15:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:15:27,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:27,482 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] [2019-09-08 10:15:27,483 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1763616113, now seen corresponding path program 1 times [2019-09-08 10:15:27,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:27,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:27,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:27,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:27,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:27,537 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:15:27,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:27,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:27,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:27,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:27,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:27,538 INFO L87 Difference]: Start difference. First operand 5674 states and 7737 transitions. Second operand 3 states. [2019-09-08 10:15:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:28,438 INFO L93 Difference]: Finished difference Result 11094 states and 15292 transitions. [2019-09-08 10:15:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:15:28,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 10:15:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:28,445 INFO L225 Difference]: With dead ends: 11094 [2019-09-08 10:15:28,445 INFO L226 Difference]: Without dead ends: 7962 [2019-09-08 10:15:28,449 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:15:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2019-09-08 10:15:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 5613. [2019-09-08 10:15:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-09-08 10:15:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 7645 transitions. [2019-09-08 10:15:28,990 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 7645 transitions. Word has length 62 [2019-09-08 10:15:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:28,990 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 7645 transitions. [2019-09-08 10:15:28,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:15:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 7645 transitions. [2019-09-08 10:15:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:15:28,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:28,992 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] [2019-09-08 10:15:28,992 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash -131917929, now seen corresponding path program 1 times [2019-09-08 10:15:28,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:28,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:28,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:28,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:28,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:29,038 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:15:29,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:29,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:29,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:29,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:29,039 INFO L87 Difference]: Start difference. First operand 5613 states and 7645 transitions. Second operand 3 states. [2019-09-08 10:15:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:29,976 INFO L93 Difference]: Finished difference Result 10980 states and 15108 transitions. [2019-09-08 10:15:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:15:29,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 10:15:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:29,984 INFO L225 Difference]: With dead ends: 10980 [2019-09-08 10:15:29,984 INFO L226 Difference]: Without dead ends: 7875 [2019-09-08 10:15:29,990 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:15:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7875 states. [2019-09-08 10:15:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7875 to 5524. [2019-09-08 10:15:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5524 states. [2019-09-08 10:15:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 7521 transitions. [2019-09-08 10:15:30,679 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 7521 transitions. Word has length 62 [2019-09-08 10:15:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:30,679 INFO L475 AbstractCegarLoop]: Abstraction has 5524 states and 7521 transitions. [2019-09-08 10:15:30,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:15:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 7521 transitions. [2019-09-08 10:15:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:15:30,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:30,681 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] [2019-09-08 10:15:30,681 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1773291386, now seen corresponding path program 1 times [2019-09-08 10:15:30,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:30,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:30,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:31,238 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:15:31,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:31,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:15:31,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:15:31,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:15:31,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:15:31,241 INFO L87 Difference]: Start difference. First operand 5524 states and 7521 transitions. Second operand 13 states. [2019-09-08 10:15:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:33,888 INFO L93 Difference]: Finished difference Result 9092 states and 12513 transitions. [2019-09-08 10:15:33,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:15:33,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-08 10:15:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:33,897 INFO L225 Difference]: With dead ends: 9092 [2019-09-08 10:15:33,897 INFO L226 Difference]: Without dead ends: 9088 [2019-09-08 10:15:33,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:15:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-09-08 10:15:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 5520. [2019-09-08 10:15:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5520 states. [2019-09-08 10:15:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5520 states to 5520 states and 7516 transitions. [2019-09-08 10:15:34,602 INFO L78 Accepts]: Start accepts. Automaton has 5520 states and 7516 transitions. Word has length 62 [2019-09-08 10:15:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:34,602 INFO L475 AbstractCegarLoop]: Abstraction has 5520 states and 7516 transitions. [2019-09-08 10:15:34,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:15:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5520 states and 7516 transitions. [2019-09-08 10:15:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:15:34,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:34,605 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] [2019-09-08 10:15:34,605 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash -625592832, now seen corresponding path program 1 times [2019-09-08 10:15:34,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:34,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:34,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:35,050 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:15:35,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:35,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:15:35,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:15:35,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:15:35,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:15:35,051 INFO L87 Difference]: Start difference. First operand 5520 states and 7516 transitions. Second operand 10 states. [2019-09-08 10:15:35,583 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 10:15:35,739 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-08 10:15:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:38,176 INFO L93 Difference]: Finished difference Result 12503 states and 17279 transitions. [2019-09-08 10:15:38,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:15:38,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-09-08 10:15:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:38,195 INFO L225 Difference]: With dead ends: 12503 [2019-09-08 10:15:38,195 INFO L226 Difference]: Without dead ends: 11461 [2019-09-08 10:15:38,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:15:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-09-08 10:15:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 5451. [2019-09-08 10:15:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5451 states. [2019-09-08 10:15:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5451 states to 5451 states and 7436 transitions. [2019-09-08 10:15:39,054 INFO L78 Accepts]: Start accepts. Automaton has 5451 states and 7436 transitions. Word has length 62 [2019-09-08 10:15:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:39,054 INFO L475 AbstractCegarLoop]: Abstraction has 5451 states and 7436 transitions. [2019-09-08 10:15:39,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:15:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5451 states and 7436 transitions. [2019-09-08 10:15:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:15:39,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:39,059 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:15:39,059 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2083745963, now seen corresponding path program 1 times [2019-09-08 10:15:39,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:39,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:39,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:39,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:39,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:39,156 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:15:39,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:39,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:15:39,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:15:39,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:15:39,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:15:39,158 INFO L87 Difference]: Start difference. First operand 5451 states and 7436 transitions. Second operand 6 states. [2019-09-08 10:15:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:42,299 INFO L93 Difference]: Finished difference Result 22922 states and 31897 transitions. [2019-09-08 10:15:42,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:15:42,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-08 10:15:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:42,317 INFO L225 Difference]: With dead ends: 22922 [2019-09-08 10:15:42,317 INFO L226 Difference]: Without dead ends: 18835 [2019-09-08 10:15:42,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:15:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18835 states. [2019-09-08 10:15:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18835 to 14483. [2019-09-08 10:15:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14483 states. [2019-09-08 10:15:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 19685 transitions. [2019-09-08 10:15:44,517 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 19685 transitions. Word has length 72 [2019-09-08 10:15:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:44,517 INFO L475 AbstractCegarLoop]: Abstraction has 14483 states and 19685 transitions. [2019-09-08 10:15:44,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:15:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 19685 transitions. [2019-09-08 10:15:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:15:44,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:44,523 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:15:44,523 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1744904066, now seen corresponding path program 1 times [2019-09-08 10:15:44,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:44,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:44,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:44,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:44,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:44,603 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:15:44,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:44,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:15:44,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:15:44,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:15:44,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:15:44,605 INFO L87 Difference]: Start difference. First operand 14483 states and 19685 transitions. Second operand 5 states. [2019-09-08 10:15:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:46,810 INFO L93 Difference]: Finished difference Result 14489 states and 19688 transitions. [2019-09-08 10:15:46,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:15:46,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-09-08 10:15:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:46,827 INFO L225 Difference]: With dead ends: 14489 [2019-09-08 10:15:46,827 INFO L226 Difference]: Without dead ends: 13667 [2019-09-08 10:15:46,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:15:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13667 states. [2019-09-08 10:15:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13667 to 13663. [2019-09-08 10:15:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13663 states. [2019-09-08 10:15:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13663 states to 13663 states and 18610 transitions. [2019-09-08 10:15:49,568 INFO L78 Accepts]: Start accepts. Automaton has 13663 states and 18610 transitions. Word has length 73 [2019-09-08 10:15:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:49,568 INFO L475 AbstractCegarLoop]: Abstraction has 13663 states and 18610 transitions. [2019-09-08 10:15:49,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:15:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13663 states and 18610 transitions. [2019-09-08 10:15:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:15:49,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:49,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:15:49,575 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1665118235, now seen corresponding path program 1 times [2019-09-08 10:15:49,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:49,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:49,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:49,674 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:15:49,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:49,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:15:49,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:15:49,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:15:49,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:15:49,677 INFO L87 Difference]: Start difference. First operand 13663 states and 18610 transitions. Second operand 6 states. [2019-09-08 10:15:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:54,022 INFO L93 Difference]: Finished difference Result 25203 states and 34054 transitions. [2019-09-08 10:15:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:15:54,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-08 10:15:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:54,050 INFO L225 Difference]: With dead ends: 25203 [2019-09-08 10:15:54,050 INFO L226 Difference]: Without dead ends: 25201 [2019-09-08 10:15:54,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:15:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25201 states. [2019-09-08 10:15:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25201 to 13993. [2019-09-08 10:15:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13993 states. [2019-09-08 10:15:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13993 states to 13993 states and 18830 transitions. [2019-09-08 10:15:56,451 INFO L78 Accepts]: Start accepts. Automaton has 13993 states and 18830 transitions. Word has length 74 [2019-09-08 10:15:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:56,451 INFO L475 AbstractCegarLoop]: Abstraction has 13993 states and 18830 transitions. [2019-09-08 10:15:56,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:15:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 13993 states and 18830 transitions. [2019-09-08 10:15:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:15:56,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:56,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:15:56,458 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:56,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1859339602, now seen corresponding path program 1 times [2019-09-08 10:15:56,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:56,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:56,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:56,511 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:15:56,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:56,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:56,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:56,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:56,513 INFO L87 Difference]: Start difference. First operand 13993 states and 18830 transitions. Second operand 3 states. [2019-09-08 10:16:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:00,931 INFO L93 Difference]: Finished difference Result 37779 states and 50890 transitions. [2019-09-08 10:16:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:16:01,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:16:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:01,077 INFO L225 Difference]: With dead ends: 37779 [2019-09-08 10:16:01,077 INFO L226 Difference]: Without dead ends: 25345 [2019-09-08 10:16:01,091 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:16:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-09-08 10:16:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 23771. [2019-09-08 10:16:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23771 states. [2019-09-08 10:16:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23771 states to 23771 states and 31823 transitions. [2019-09-08 10:16:05,183 INFO L78 Accepts]: Start accepts. Automaton has 23771 states and 31823 transitions. Word has length 75 [2019-09-08 10:16:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:05,183 INFO L475 AbstractCegarLoop]: Abstraction has 23771 states and 31823 transitions. [2019-09-08 10:16:05,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:16:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 23771 states and 31823 transitions. [2019-09-08 10:16:05,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:16:05,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:05,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:05,189 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:05,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:05,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1309001061, now seen corresponding path program 1 times [2019-09-08 10:16:05,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:05,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:05,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:05,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:05,241 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:16:05,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:05,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:16:05,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:16:05,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:16:05,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:16:05,243 INFO L87 Difference]: Start difference. First operand 23771 states and 31823 transitions. Second operand 3 states. [2019-09-08 10:16:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:13,494 INFO L93 Difference]: Finished difference Result 65856 states and 87866 transitions. [2019-09-08 10:16:13,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:16:13,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:16:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:13,547 INFO L225 Difference]: With dead ends: 65856 [2019-09-08 10:16:13,547 INFO L226 Difference]: Without dead ends: 43242 [2019-09-08 10:16:13,575 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:16:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43242 states. [2019-09-08 10:16:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43242 to 39960. [2019-09-08 10:16:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39960 states. [2019-09-08 10:16:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39960 states to 39960 states and 52654 transitions. [2019-09-08 10:16:20,740 INFO L78 Accepts]: Start accepts. Automaton has 39960 states and 52654 transitions. Word has length 76 [2019-09-08 10:16:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:20,740 INFO L475 AbstractCegarLoop]: Abstraction has 39960 states and 52654 transitions. [2019-09-08 10:16:20,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:16:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 39960 states and 52654 transitions. [2019-09-08 10:16:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:16:20,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:20,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:20,745 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:20,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash 449656965, now seen corresponding path program 1 times [2019-09-08 10:16:20,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:20,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:20,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:20,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:20,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:20,815 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:16:20,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:20,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:16:20,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:16:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:16:20,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:16:20,816 INFO L87 Difference]: Start difference. First operand 39960 states and 52654 transitions. Second operand 3 states. [2019-09-08 10:16:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:31,934 INFO L93 Difference]: Finished difference Result 97232 states and 127962 transitions. [2019-09-08 10:16:31,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:16:31,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:16:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:32,000 INFO L225 Difference]: With dead ends: 97232 [2019-09-08 10:16:32,000 INFO L226 Difference]: Without dead ends: 58490 [2019-09-08 10:16:32,046 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:16:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58490 states. [2019-09-08 10:16:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58490 to 58488. [2019-09-08 10:16:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58488 states. [2019-09-08 10:16:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58488 states to 58488 states and 76270 transitions. [2019-09-08 10:16:44,246 INFO L78 Accepts]: Start accepts. Automaton has 58488 states and 76270 transitions. Word has length 78 [2019-09-08 10:16:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:44,246 INFO L475 AbstractCegarLoop]: Abstraction has 58488 states and 76270 transitions. [2019-09-08 10:16:44,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:16:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 58488 states and 76270 transitions. [2019-09-08 10:16:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 10:16:44,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:44,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:44,254 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1613619318, now seen corresponding path program 1 times [2019-09-08 10:16:44,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:44,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:44,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:44,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:44,319 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:16:44,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:44,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:16:44,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:16:44,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:16:44,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:16:44,321 INFO L87 Difference]: Start difference. First operand 58488 states and 76270 transitions. Second operand 5 states. [2019-09-08 10:17:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:04,740 INFO L93 Difference]: Finished difference Result 160792 states and 207717 transitions. [2019-09-08 10:17:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:17:04,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-08 10:17:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:04,866 INFO L225 Difference]: With dead ends: 160792 [2019-09-08 10:17:04,866 INFO L226 Difference]: Without dead ends: 103522 [2019-09-08 10:17:04,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:17:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103522 states. [2019-09-08 10:17:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103522 to 65072. [2019-09-08 10:17:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65072 states. [2019-09-08 10:17:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65072 states to 65072 states and 83802 transitions. [2019-09-08 10:17:18,948 INFO L78 Accepts]: Start accepts. Automaton has 65072 states and 83802 transitions. Word has length 89 [2019-09-08 10:17:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:18,948 INFO L475 AbstractCegarLoop]: Abstraction has 65072 states and 83802 transitions. [2019-09-08 10:17:18,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:17:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 65072 states and 83802 transitions. [2019-09-08 10:17:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:17:18,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:18,963 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:18,964 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:18,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:18,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1950557848, now seen corresponding path program 1 times [2019-09-08 10:17:18,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:18,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:18,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:18,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:18,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:19,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:19,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:17:19,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:17:19,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:17:19,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:19,043 INFO L87 Difference]: Start difference. First operand 65072 states and 83802 transitions. Second operand 3 states. [2019-09-08 10:17:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:44,568 INFO L93 Difference]: Finished difference Result 185464 states and 237912 transitions. [2019-09-08 10:17:44,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:17:44,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 10:17:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:44,706 INFO L225 Difference]: With dead ends: 185464 [2019-09-08 10:17:44,706 INFO L226 Difference]: Without dead ends: 121610 [2019-09-08 10:17:44,754 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:17:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121610 states. [2019-09-08 10:18:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121610 to 106128. [2019-09-08 10:18:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106128 states. [2019-09-08 10:18:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106128 states to 106128 states and 134776 transitions. [2019-09-08 10:18:05,294 INFO L78 Accepts]: Start accepts. Automaton has 106128 states and 134776 transitions. Word has length 97 [2019-09-08 10:18:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:05,295 INFO L475 AbstractCegarLoop]: Abstraction has 106128 states and 134776 transitions. [2019-09-08 10:18:05,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 106128 states and 134776 transitions. [2019-09-08 10:18:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 10:18:05,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:05,307 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:05,307 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1162840062, now seen corresponding path program 1 times [2019-09-08 10:18:05,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:05,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:05,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:05,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:05,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:05,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:18:05,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 10:18:05,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:18:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:05,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 10:18:05,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:18:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:18:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:06,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:18:06,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 10:18:06,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:18:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:18:06,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:18:06,046 INFO L87 Difference]: Start difference. First operand 106128 states and 134776 transitions. Second operand 13 states. [2019-09-08 10:19:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:06,716 INFO L93 Difference]: Finished difference Result 350833 states and 446304 transitions. [2019-09-08 10:19:06,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 10:19:06,716 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-09-08 10:19:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:07,324 INFO L225 Difference]: With dead ends: 350833 [2019-09-08 10:19:07,325 INFO L226 Difference]: Without dead ends: 245923 [2019-09-08 10:19:07,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:19:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245923 states. [2019-09-08 10:19:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245923 to 155025. [2019-09-08 10:19:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155025 states. [2019-09-08 10:19:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155025 states to 155025 states and 196792 transitions. [2019-09-08 10:19:41,134 INFO L78 Accepts]: Start accepts. Automaton has 155025 states and 196792 transitions. Word has length 99 [2019-09-08 10:19:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:41,135 INFO L475 AbstractCegarLoop]: Abstraction has 155025 states and 196792 transitions. [2019-09-08 10:19:41,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:19:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 155025 states and 196792 transitions. [2019-09-08 10:19:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 10:19:41,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:41,154 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:41,155 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash 719809032, now seen corresponding path program 1 times [2019-09-08 10:19:41,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:41,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:41,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:41,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:41,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:41,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:19:41,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:19:41,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:41,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:19:41,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:19:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 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:19:41,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:19:41,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-09-08 10:19:41,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:19:41,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:19:41,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:19:41,593 INFO L87 Difference]: Start difference. First operand 155025 states and 196792 transitions. Second operand 10 states. [2019-09-08 10:20:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:44,016 INFO L93 Difference]: Finished difference Result 399332 states and 504985 transitions. [2019-09-08 10:20:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:20:44,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-09-08 10:20:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:44,485 INFO L225 Difference]: With dead ends: 399332 [2019-09-08 10:20:44,485 INFO L226 Difference]: Without dead ends: 246011 [2019-09-08 10:20:44,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:20:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246011 states. [2019-09-08 10:21:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246011 to 165517. [2019-09-08 10:21:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165517 states. [2019-09-08 10:21:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165517 states to 165517 states and 206399 transitions. [2019-09-08 10:21:21,232 INFO L78 Accepts]: Start accepts. Automaton has 165517 states and 206399 transitions. Word has length 100 [2019-09-08 10:21:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:21:21,233 INFO L475 AbstractCegarLoop]: Abstraction has 165517 states and 206399 transitions. [2019-09-08 10:21:21,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:21:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 165517 states and 206399 transitions. [2019-09-08 10:21:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 10:21:21,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:21:21,243 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:21:21,243 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:21:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:21:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash -15585594, now seen corresponding path program 1 times [2019-09-08 10:21:21,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:21:21,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:21:21,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:21,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:21:21,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:21:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:21:21,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:21:21,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:21:21,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:21:21,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:21:21,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:21:21,325 INFO L87 Difference]: Start difference. First operand 165517 states and 206399 transitions. Second operand 5 states. [2019-09-08 10:22:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:22:10,362 INFO L93 Difference]: Finished difference Result 363062 states and 451730 transitions. [2019-09-08 10:22:10,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:22:10,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 10:22:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:22:10,643 INFO L225 Difference]: With dead ends: 363062 [2019-09-08 10:22:10,644 INFO L226 Difference]: Without dead ends: 199211 [2019-09-08 10:22:10,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:22:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199211 states. [2019-09-08 10:22:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199211 to 160425. [2019-09-08 10:22:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160425 states. [2019-09-08 10:22:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160425 states to 160425 states and 197355 transitions. [2019-09-08 10:22:51,098 INFO L78 Accepts]: Start accepts. Automaton has 160425 states and 197355 transitions. Word has length 101 [2019-09-08 10:22:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:22:51,098 INFO L475 AbstractCegarLoop]: Abstraction has 160425 states and 197355 transitions. [2019-09-08 10:22:51,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:22:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 160425 states and 197355 transitions. [2019-09-08 10:22:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 10:22:51,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:22:51,112 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:22:51,112 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:22:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:22:51,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1855442686, now seen corresponding path program 1 times [2019-09-08 10:22:51,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:22:51,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:22:51,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:51,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:22:51,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:22:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:22:51,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:22:51,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:22:51,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:22:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:22:51,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:22:51,220 INFO L87 Difference]: Start difference. First operand 160425 states and 197355 transitions. Second operand 5 states. [2019-09-08 10:23:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:44,977 INFO L93 Difference]: Finished difference Result 289197 states and 356267 transitions. [2019-09-08 10:23:44,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:23:44,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 10:23:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:45,283 INFO L225 Difference]: With dead ends: 289197 [2019-09-08 10:23:45,284 INFO L226 Difference]: Without dead ends: 224999 [2019-09-08 10:23:45,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:23:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224999 states. [2019-09-08 10:24:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224999 to 184895. [2019-09-08 10:24:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184895 states. [2019-09-08 10:24:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184895 states to 184895 states and 227065 transitions. [2019-09-08 10:24:31,502 INFO L78 Accepts]: Start accepts. Automaton has 184895 states and 227065 transitions. Word has length 103 [2019-09-08 10:24:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:31,503 INFO L475 AbstractCegarLoop]: Abstraction has 184895 states and 227065 transitions. [2019-09-08 10:24:31,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:24:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 184895 states and 227065 transitions. [2019-09-08 10:24:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 10:24:31,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:31,522 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:24:31,522 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1041085272, now seen corresponding path program 1 times [2019-09-08 10:24:31,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:31,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:31,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:31,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:31,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 10:24:31,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:31,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:24:31,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:24:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:24:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:24:31,607 INFO L87 Difference]: Start difference. First operand 184895 states and 227065 transitions. Second operand 4 states. [2019-09-08 10:26:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:13,876 INFO L93 Difference]: Finished difference Result 594771 states and 729437 transitions. [2019-09-08 10:26:13,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:26:13,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-08 10:26:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:14,453 INFO L225 Difference]: With dead ends: 594771 [2019-09-08 10:26:14,453 INFO L226 Difference]: Without dead ends: 411599 [2019-09-08 10:26:14,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:26:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411599 states. [2019-09-08 10:27:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411599 to 184539. [2019-09-08 10:27:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184539 states. [2019-09-08 10:27:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184539 states to 184539 states and 226655 transitions. [2019-09-08 10:27:06,445 INFO L78 Accepts]: Start accepts. Automaton has 184539 states and 226655 transitions. Word has length 105 [2019-09-08 10:27:06,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:06,445 INFO L475 AbstractCegarLoop]: Abstraction has 184539 states and 226655 transitions. [2019-09-08 10:27:06,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:27:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 184539 states and 226655 transitions. [2019-09-08 10:27:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 10:27:06,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:06,458 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:06,459 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:06,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:06,459 INFO L82 PathProgramCache]: Analyzing trace with hash 680245603, now seen corresponding path program 1 times [2019-09-08 10:27:06,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:06,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:06,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:06,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:06,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 10:27:06,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:06,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:27:06,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:27:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:27:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:27:06,558 INFO L87 Difference]: Start difference. First operand 184539 states and 226655 transitions. Second operand 5 states.