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.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:41:43,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:41:43,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:41:43,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:41:43,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:41:43,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:41:43,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:41:43,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:41:43,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:41:43,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:41:43,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:41:43,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:41:43,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:41:43,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:41:43,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:41:43,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:41:43,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:41:43,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:41:43,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:41:43,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:41:43,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:41:43,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:41:43,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:41:43,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:41:43,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:41:43,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:41:43,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:41:43,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:41:43,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:41:43,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:41:43,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:41:43,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:41:43,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:41:43,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:41:43,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:41:43,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:41:43,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:41:43,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:41:43,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:41:43,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:41:43,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:41:43,946 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 12:41:43,960 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:41:43,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:41:43,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:41:43,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:41:43,962 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:41:43,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:41:43,962 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:41:43,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:41:43,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:41:43,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:41:43,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:41:43,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:41:43,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:41:43,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:41:43,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:41:43,964 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:41:43,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:41:43,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:41:43,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:41:43,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:41:43,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:41:43,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:41:43,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:41:43,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:41:43,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:41:43,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:41:43,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:41:43,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:41:43,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:41:43,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:41:44,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:41:44,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:41:44,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:41:44,010 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:41:44,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-08 12:41:44,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea548eb26/baaf83be5fc04d0b9bfa7335eea86b76/FLAG691a36f91 [2019-09-08 12:41:44,583 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:41:44,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-08 12:41:44,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea548eb26/baaf83be5fc04d0b9bfa7335eea86b76/FLAG691a36f91 [2019-09-08 12:41:44,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea548eb26/baaf83be5fc04d0b9bfa7335eea86b76 [2019-09-08 12:41:44,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:41:44,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:41:44,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:41:44,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:41:44,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:41:44,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:41:44" (1/1) ... [2019-09-08 12:41:44,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d19e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:44, skipping insertion in model container [2019-09-08 12:41:44,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:41:44" (1/1) ... [2019-09-08 12:41:44,951 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:41:45,014 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:41:45,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:41:45,497 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:41:45,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:41:45,664 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:41:45,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45 WrapperNode [2019-09-08 12:41:45,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:41:45,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:41:45,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:41:45,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:41:45,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:41:45,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:41:45,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:41:45,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:41:45,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (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 12:41:45,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:41:45,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:41:45,822 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:41:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:41:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:41:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:41:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:41:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:41:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:41:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:41:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:41:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:41:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:41:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:41:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:41:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:41:46,922 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:41:46,923 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:41:46,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:41:46 BoogieIcfgContainer [2019-09-08 12:41:46,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:41:46,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:41:46,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:41:46,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:41:46,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:41:44" (1/3) ... [2019-09-08 12:41:46,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f369580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:41:46, skipping insertion in model container [2019-09-08 12:41:46,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (2/3) ... [2019-09-08 12:41:46,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f369580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:41:46, skipping insertion in model container [2019-09-08 12:41:46,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:41:46" (3/3) ... [2019-09-08 12:41:46,932 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-08 12:41:46,940 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:41:46,948 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:41:46,964 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:41:46,994 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:41:46,995 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:41:46,995 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:41:46,995 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:41:46,995 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:41:46,995 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:41:46,995 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:41:46,996 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:41:46,996 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:41:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2019-09-08 12:41:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:41:47,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:47,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:47,042 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1051248920, now seen corresponding path program 1 times [2019-09-08 12:41:47,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:47,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:47,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:47,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:47,592 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 12:41:47,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:47,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:47,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:47,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:47,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:47,617 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2019-09-08 12:41:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:47,793 INFO L93 Difference]: Finished difference Result 399 states and 662 transitions. [2019-09-08 12:41:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:47,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-08 12:41:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:47,821 INFO L225 Difference]: With dead ends: 399 [2019-09-08 12:41:47,822 INFO L226 Difference]: Without dead ends: 306 [2019-09-08 12:41:47,829 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 12:41:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-08 12:41:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-08 12:41:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:41:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 434 transitions. [2019-09-08 12:41:47,924 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 434 transitions. Word has length 112 [2019-09-08 12:41:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:47,925 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 434 transitions. [2019-09-08 12:41:47,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 434 transitions. [2019-09-08 12:41:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:41:47,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:47,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:47,930 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:47,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash -458569337, now seen corresponding path program 1 times [2019-09-08 12:41:47,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:47,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:47,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:47,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:47,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:48,244 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 12:41:48,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:48,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:48,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:48,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:48,249 INFO L87 Difference]: Start difference. First operand 304 states and 434 transitions. Second operand 5 states. [2019-09-08 12:41:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:48,566 INFO L93 Difference]: Finished difference Result 547 states and 806 transitions. [2019-09-08 12:41:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:48,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-08 12:41:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:48,570 INFO L225 Difference]: With dead ends: 547 [2019-09-08 12:41:48,570 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 12:41:48,572 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 12:41:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 12:41:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-08 12:41:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:41:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 431 transitions. [2019-09-08 12:41:48,603 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 431 transitions. Word has length 114 [2019-09-08 12:41:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:48,604 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 431 transitions. [2019-09-08 12:41:48,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 431 transitions. [2019-09-08 12:41:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:41:48,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:48,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:48,612 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:48,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:48,612 INFO L82 PathProgramCache]: Analyzing trace with hash 140292373, now seen corresponding path program 1 times [2019-09-08 12:41:48,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:48,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:48,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:48,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:48,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:48,857 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 12:41:48,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:48,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:48,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:48,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:48,860 INFO L87 Difference]: Start difference. First operand 304 states and 431 transitions. Second operand 5 states. [2019-09-08 12:41:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:49,075 INFO L93 Difference]: Finished difference Result 543 states and 796 transitions. [2019-09-08 12:41:49,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:49,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-08 12:41:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:49,078 INFO L225 Difference]: With dead ends: 543 [2019-09-08 12:41:49,078 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 12:41:49,080 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 12:41:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 12:41:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-08 12:41:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:41:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 428 transitions. [2019-09-08 12:41:49,108 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 428 transitions. Word has length 115 [2019-09-08 12:41:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:49,109 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 428 transitions. [2019-09-08 12:41:49,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 428 transitions. [2019-09-08 12:41:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:41:49,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:49,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:49,116 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:49,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1606063222, now seen corresponding path program 1 times [2019-09-08 12:41:49,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:49,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:49,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:49,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:49,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:49,325 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 12:41:49,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:49,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:49,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:49,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:49,327 INFO L87 Difference]: Start difference. First operand 304 states and 428 transitions. Second operand 5 states. [2019-09-08 12:41:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:49,542 INFO L93 Difference]: Finished difference Result 523 states and 766 transitions. [2019-09-08 12:41:49,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:49,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-08 12:41:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:49,545 INFO L225 Difference]: With dead ends: 523 [2019-09-08 12:41:49,545 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 12:41:49,547 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 12:41:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 12:41:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-08 12:41:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:41:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 425 transitions. [2019-09-08 12:41:49,571 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 425 transitions. Word has length 116 [2019-09-08 12:41:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:49,572 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 425 transitions. [2019-09-08 12:41:49,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 425 transitions. [2019-09-08 12:41:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:49,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:49,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:49,575 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1122053542, now seen corresponding path program 1 times [2019-09-08 12:41:49,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:49,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:49,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:49,723 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 12:41:49,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:49,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:49,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:49,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:49,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:49,725 INFO L87 Difference]: Start difference. First operand 304 states and 425 transitions. Second operand 5 states. [2019-09-08 12:41:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:49,917 INFO L93 Difference]: Finished difference Result 535 states and 775 transitions. [2019-09-08 12:41:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:49,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-08 12:41:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:49,921 INFO L225 Difference]: With dead ends: 535 [2019-09-08 12:41:49,921 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 12:41:49,923 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 12:41:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 12:41:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-08 12:41:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:41:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-09-08 12:41:49,943 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 117 [2019-09-08 12:41:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:49,943 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-09-08 12:41:49,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-09-08 12:41:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:41:49,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:49,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:49,946 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:49,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:49,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1734849881, now seen corresponding path program 1 times [2019-09-08 12:41:49,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:49,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:49,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:50,104 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 12:41:50,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:50,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:50,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:50,106 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 5 states. [2019-09-08 12:41:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:50,295 INFO L93 Difference]: Finished difference Result 531 states and 765 transitions. [2019-09-08 12:41:50,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:50,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-08 12:41:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:50,298 INFO L225 Difference]: With dead ends: 531 [2019-09-08 12:41:50,298 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 12:41:50,299 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 12:41:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 12:41:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-08 12:41:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:41:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 419 transitions. [2019-09-08 12:41:50,318 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 419 transitions. Word has length 118 [2019-09-08 12:41:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:50,320 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 419 transitions. [2019-09-08 12:41:50,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 419 transitions. [2019-09-08 12:41:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:41:50,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:50,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:50,322 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:50,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1494263947, now seen corresponding path program 1 times [2019-09-08 12:41:50,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:50,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:50,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:50,454 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 12:41:50,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:50,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:50,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:50,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:50,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:50,456 INFO L87 Difference]: Start difference. First operand 304 states and 419 transitions. Second operand 5 states. [2019-09-08 12:41:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:50,641 INFO L93 Difference]: Finished difference Result 539 states and 768 transitions. [2019-09-08 12:41:50,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:50,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-08 12:41:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:50,644 INFO L225 Difference]: With dead ends: 539 [2019-09-08 12:41:50,644 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 12:41:50,645 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 12:41:50,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 12:41:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-08 12:41:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:41:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 416 transitions. [2019-09-08 12:41:50,665 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 416 transitions. Word has length 119 [2019-09-08 12:41:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:50,665 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 416 transitions. [2019-09-08 12:41:50,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 416 transitions. [2019-09-08 12:41:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:41:50,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:50,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:50,667 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash 776973317, now seen corresponding path program 1 times [2019-09-08 12:41:50,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:50,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:50,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:50,819 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 12:41:50,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:50,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:50,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:50,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:50,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:50,821 INFO L87 Difference]: Start difference. First operand 304 states and 416 transitions. Second operand 5 states. [2019-09-08 12:41:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:51,011 INFO L93 Difference]: Finished difference Result 527 states and 750 transitions. [2019-09-08 12:41:51,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:51,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:41:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:51,014 INFO L225 Difference]: With dead ends: 527 [2019-09-08 12:41:51,014 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 12:41:51,015 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 12:41:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 12:41:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-08 12:41:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:41:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 413 transitions. [2019-09-08 12:41:51,041 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 413 transitions. Word has length 120 [2019-09-08 12:41:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:51,041 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 413 transitions. [2019-09-08 12:41:51,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 413 transitions. [2019-09-08 12:41:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:51,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:51,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:51,044 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:51,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:51,044 INFO L82 PathProgramCache]: Analyzing trace with hash -510022136, now seen corresponding path program 1 times [2019-09-08 12:41:51,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:51,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:51,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:51,205 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 12:41:51,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:51,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:51,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:51,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:51,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:51,206 INFO L87 Difference]: Start difference. First operand 304 states and 413 transitions. Second operand 5 states. [2019-09-08 12:41:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:51,367 INFO L93 Difference]: Finished difference Result 874 states and 1263 transitions. [2019-09-08 12:41:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:51,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 12:41:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:51,374 INFO L225 Difference]: With dead ends: 874 [2019-09-08 12:41:51,374 INFO L226 Difference]: Without dead ends: 718 [2019-09-08 12:41:51,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:41:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-09-08 12:41:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 658. [2019-09-08 12:41:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-08 12:41:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 947 transitions. [2019-09-08 12:41:51,428 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 947 transitions. Word has length 121 [2019-09-08 12:41:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:51,428 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 947 transitions. [2019-09-08 12:41:51,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 947 transitions. [2019-09-08 12:41:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:51,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:51,431 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash 780943061, now seen corresponding path program 1 times [2019-09-08 12:41:51,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:51,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:51,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:51,587 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 12:41:51,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:51,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:51,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:51,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:51,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:51,589 INFO L87 Difference]: Start difference. First operand 658 states and 947 transitions. Second operand 5 states. [2019-09-08 12:41:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:51,846 INFO L93 Difference]: Finished difference Result 1629 states and 2398 transitions. [2019-09-08 12:41:51,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:51,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 12:41:51,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:51,853 INFO L225 Difference]: With dead ends: 1629 [2019-09-08 12:41:51,853 INFO L226 Difference]: Without dead ends: 1161 [2019-09-08 12:41:51,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:41:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2019-09-08 12:41:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 911. [2019-09-08 12:41:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-09-08 12:41:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1329 transitions. [2019-09-08 12:41:51,978 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1329 transitions. Word has length 121 [2019-09-08 12:41:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:51,979 INFO L475 AbstractCegarLoop]: Abstraction has 911 states and 1329 transitions. [2019-09-08 12:41:51,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1329 transitions. [2019-09-08 12:41:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:51,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:51,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:51,982 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:51,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:51,983 INFO L82 PathProgramCache]: Analyzing trace with hash -909475221, now seen corresponding path program 1 times [2019-09-08 12:41:51,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:51,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:51,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:51,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:51,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:52,233 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 12:41:52,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:52,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:52,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:52,235 INFO L87 Difference]: Start difference. First operand 911 states and 1329 transitions. Second operand 9 states. [2019-09-08 12:41:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:52,848 INFO L93 Difference]: Finished difference Result 3164 states and 4692 transitions. [2019-09-08 12:41:52,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:41:52,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:52,864 INFO L225 Difference]: With dead ends: 3164 [2019-09-08 12:41:52,864 INFO L226 Difference]: Without dead ends: 2459 [2019-09-08 12:41:52,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:41:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-09-08 12:41:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 1075. [2019-09-08 12:41:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-08 12:41:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1575 transitions. [2019-09-08 12:41:53,005 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1575 transitions. Word has length 121 [2019-09-08 12:41:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:53,005 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1575 transitions. [2019-09-08 12:41:53,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1575 transitions. [2019-09-08 12:41:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:53,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:53,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:53,007 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:53,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:53,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1121640156, now seen corresponding path program 1 times [2019-09-08 12:41:53,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:53,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:53,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:53,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:53,147 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 12:41:53,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:53,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:53,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:53,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:53,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:53,149 INFO L87 Difference]: Start difference. First operand 1075 states and 1575 transitions. Second operand 5 states. [2019-09-08 12:41:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:53,412 INFO L93 Difference]: Finished difference Result 2208 states and 3269 transitions. [2019-09-08 12:41:53,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:53,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 12:41:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:53,422 INFO L225 Difference]: With dead ends: 2208 [2019-09-08 12:41:53,423 INFO L226 Difference]: Without dead ends: 1503 [2019-09-08 12:41:53,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:41:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-09-08 12:41:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1313. [2019-09-08 12:41:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-09-08 12:41:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1933 transitions. [2019-09-08 12:41:53,578 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1933 transitions. Word has length 121 [2019-09-08 12:41:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:53,579 INFO L475 AbstractCegarLoop]: Abstraction has 1313 states and 1933 transitions. [2019-09-08 12:41:53,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1933 transitions. [2019-09-08 12:41:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:53,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:53,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:53,581 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:53,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2117519461, now seen corresponding path program 1 times [2019-09-08 12:41:53,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:53,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:53,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:53,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:53,663 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 12:41:53,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:53,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:53,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:53,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:53,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:53,665 INFO L87 Difference]: Start difference. First operand 1313 states and 1933 transitions. Second operand 3 states. [2019-09-08 12:41:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:53,831 INFO L93 Difference]: Finished difference Result 2415 states and 3585 transitions. [2019-09-08 12:41:53,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:53,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:41:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:53,838 INFO L225 Difference]: With dead ends: 2415 [2019-09-08 12:41:53,838 INFO L226 Difference]: Without dead ends: 1315 [2019-09-08 12:41:53,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 12:41:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-09-08 12:41:53,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1313. [2019-09-08 12:41:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-09-08 12:41:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1927 transitions. [2019-09-08 12:41:53,985 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1927 transitions. Word has length 121 [2019-09-08 12:41:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:53,986 INFO L475 AbstractCegarLoop]: Abstraction has 1313 states and 1927 transitions. [2019-09-08 12:41:53,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1927 transitions. [2019-09-08 12:41:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:53,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:53,988 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:53,989 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1936230108, now seen corresponding path program 1 times [2019-09-08 12:41:53,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:53,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:53,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:54,100 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 12:41:54,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:54,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:54,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:54,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:54,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:54,102 INFO L87 Difference]: Start difference. First operand 1313 states and 1927 transitions. Second operand 3 states. [2019-09-08 12:41:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:54,326 INFO L93 Difference]: Finished difference Result 3425 states and 5063 transitions. [2019-09-08 12:41:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:54,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:41:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:54,343 INFO L225 Difference]: With dead ends: 3425 [2019-09-08 12:41:54,343 INFO L226 Difference]: Without dead ends: 2325 [2019-09-08 12:41:54,351 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 12:41:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2019-09-08 12:41:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2323. [2019-09-08 12:41:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2019-09-08 12:41:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3393 transitions. [2019-09-08 12:41:54,733 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3393 transitions. Word has length 121 [2019-09-08 12:41:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:54,734 INFO L475 AbstractCegarLoop]: Abstraction has 2323 states and 3393 transitions. [2019-09-08 12:41:54,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3393 transitions. [2019-09-08 12:41:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:54,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:54,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:54,738 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:54,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1496063070, now seen corresponding path program 1 times [2019-09-08 12:41:54,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:54,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:54,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:54,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:54,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:55,182 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 12:41:55,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:55,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:55,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:55,185 INFO L87 Difference]: Start difference. First operand 2323 states and 3393 transitions. Second operand 9 states. [2019-09-08 12:41:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:56,051 INFO L93 Difference]: Finished difference Result 7930 states and 11653 transitions. [2019-09-08 12:41:56,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:41:56,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:56,076 INFO L225 Difference]: With dead ends: 7930 [2019-09-08 12:41:56,077 INFO L226 Difference]: Without dead ends: 6123 [2019-09-08 12:41:56,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:41:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2019-09-08 12:41:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 2778. [2019-09-08 12:41:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2019-09-08 12:41:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 4062 transitions. [2019-09-08 12:41:56,417 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 4062 transitions. Word has length 121 [2019-09-08 12:41:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:56,418 INFO L475 AbstractCegarLoop]: Abstraction has 2778 states and 4062 transitions. [2019-09-08 12:41:56,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4062 transitions. [2019-09-08 12:41:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:56,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:56,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:56,420 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash -222165262, now seen corresponding path program 1 times [2019-09-08 12:41:56,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:56,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:56,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:56,639 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 12:41:56,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:56,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:56,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:56,641 INFO L87 Difference]: Start difference. First operand 2778 states and 4062 transitions. Second operand 9 states. [2019-09-08 12:41:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:57,551 INFO L93 Difference]: Finished difference Result 8150 states and 11977 transitions. [2019-09-08 12:41:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:41:57,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:57,578 INFO L225 Difference]: With dead ends: 8150 [2019-09-08 12:41:57,579 INFO L226 Difference]: Without dead ends: 6343 [2019-09-08 12:41:57,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:41:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-09-08 12:41:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 3092. [2019-09-08 12:41:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-09-08 12:41:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4525 transitions. [2019-09-08 12:41:57,957 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4525 transitions. Word has length 121 [2019-09-08 12:41:57,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:57,958 INFO L475 AbstractCegarLoop]: Abstraction has 3092 states and 4525 transitions. [2019-09-08 12:41:57,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4525 transitions. [2019-09-08 12:41:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:57,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:57,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:57,961 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash -684921793, now seen corresponding path program 1 times [2019-09-08 12:41:57,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:57,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:57,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:58,210 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 12:41:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:58,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:58,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:58,212 INFO L87 Difference]: Start difference. First operand 3092 states and 4525 transitions. Second operand 9 states. [2019-09-08 12:41:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:58,985 INFO L93 Difference]: Finished difference Result 7563 states and 11111 transitions. [2019-09-08 12:41:58,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:41:58,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:59,007 INFO L225 Difference]: With dead ends: 7563 [2019-09-08 12:41:59,007 INFO L226 Difference]: Without dead ends: 5756 [2019-09-08 12:41:59,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:41:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2019-09-08 12:41:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 3411. [2019-09-08 12:41:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3411 states. [2019-09-08 12:41:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 4996 transitions. [2019-09-08 12:41:59,356 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 4996 transitions. Word has length 121 [2019-09-08 12:41:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:59,356 INFO L475 AbstractCegarLoop]: Abstraction has 3411 states and 4996 transitions. [2019-09-08 12:41:59,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 4996 transitions. [2019-09-08 12:41:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:41:59,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:59,359 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:59,359 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:59,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1220503032, now seen corresponding path program 1 times [2019-09-08 12:41:59,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:59,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:59,501 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 12:41:59,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:59,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:59,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:59,504 INFO L87 Difference]: Start difference. First operand 3411 states and 4996 transitions. Second operand 5 states. [2019-09-08 12:42:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:00,363 INFO L93 Difference]: Finished difference Result 5841 states and 8573 transitions. [2019-09-08 12:42:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:42:00,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-08 12:42:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:00,381 INFO L225 Difference]: With dead ends: 5841 [2019-09-08 12:42:00,382 INFO L226 Difference]: Without dead ends: 5839 [2019-09-08 12:42:00,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:42:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2019-09-08 12:42:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 3433. [2019-09-08 12:42:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3433 states. [2019-09-08 12:42:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 5010 transitions. [2019-09-08 12:42:00,749 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 5010 transitions. Word has length 122 [2019-09-08 12:42:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:00,750 INFO L475 AbstractCegarLoop]: Abstraction has 3433 states and 5010 transitions. [2019-09-08 12:42:00,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:42:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 5010 transitions. [2019-09-08 12:42:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:00,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:00,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:00,752 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:00,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:00,753 INFO L82 PathProgramCache]: Analyzing trace with hash 124379524, now seen corresponding path program 1 times [2019-09-08 12:42:00,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:00,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:00,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:00,877 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 12:42:00,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:00,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:42:00,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:42:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:42:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:42:00,878 INFO L87 Difference]: Start difference. First operand 3433 states and 5010 transitions. Second operand 4 states. [2019-09-08 12:42:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:01,341 INFO L93 Difference]: Finished difference Result 8165 states and 11959 transitions. [2019-09-08 12:42:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:42:01,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-08 12:42:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:01,356 INFO L225 Difference]: With dead ends: 8165 [2019-09-08 12:42:01,356 INFO L226 Difference]: Without dead ends: 4972 [2019-09-08 12:42:01,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:42:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2019-09-08 12:42:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 4970. [2019-09-08 12:42:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-08 12:42:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7245 transitions. [2019-09-08 12:42:01,834 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7245 transitions. Word has length 122 [2019-09-08 12:42:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:01,834 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7245 transitions. [2019-09-08 12:42:01,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:42:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7245 transitions. [2019-09-08 12:42:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:42:01,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:01,836 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:01,836 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:01,837 INFO L82 PathProgramCache]: Analyzing trace with hash -605502652, now seen corresponding path program 1 times [2019-09-08 12:42:01,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:01,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:01,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:01,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:01,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:02,072 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 12:42:02,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:02,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:02,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:02,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:02,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:02,074 INFO L87 Difference]: Start difference. First operand 4970 states and 7245 transitions. Second operand 9 states. [2019-09-08 12:42:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:03,840 INFO L93 Difference]: Finished difference Result 14391 states and 21042 transitions. [2019-09-08 12:42:03,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:42:03,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:42:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:03,866 INFO L225 Difference]: With dead ends: 14391 [2019-09-08 12:42:03,866 INFO L226 Difference]: Without dead ends: 9700 [2019-09-08 12:42:03,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:42:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9700 states. [2019-09-08 12:42:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9700 to 4970. [2019-09-08 12:42:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-08 12:42:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7244 transitions. [2019-09-08 12:42:04,503 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7244 transitions. Word has length 123 [2019-09-08 12:42:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:04,503 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7244 transitions. [2019-09-08 12:42:04,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7244 transitions. [2019-09-08 12:42:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:42:04,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:04,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:04,505 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1823653614, now seen corresponding path program 1 times [2019-09-08 12:42:04,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:04,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:04,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:04,750 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 12:42:04,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:04,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:42:04,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:42:04,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:42:04,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:42:04,752 INFO L87 Difference]: Start difference. First operand 4970 states and 7244 transitions. Second operand 10 states. [2019-09-08 12:42:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:06,784 INFO L93 Difference]: Finished difference Result 14741 states and 21499 transitions. [2019-09-08 12:42:06,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:42:06,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-08 12:42:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:06,804 INFO L225 Difference]: With dead ends: 14741 [2019-09-08 12:42:06,804 INFO L226 Difference]: Without dead ends: 9918 [2019-09-08 12:42:06,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9918 states. [2019-09-08 12:42:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9918 to 4970. [2019-09-08 12:42:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-08 12:42:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7240 transitions. [2019-09-08 12:42:07,806 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7240 transitions. Word has length 123 [2019-09-08 12:42:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:07,806 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7240 transitions. [2019-09-08 12:42:07,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:42:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7240 transitions. [2019-09-08 12:42:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:42:07,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:07,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:07,808 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1180348485, now seen corresponding path program 1 times [2019-09-08 12:42:07,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:07,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:07,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:07,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:07,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:08,032 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 12:42:08,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:08,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:42:08,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:42:08,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:42:08,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:42:08,033 INFO L87 Difference]: Start difference. First operand 4970 states and 7240 transitions. Second operand 10 states. [2019-09-08 12:42:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:09,972 INFO L93 Difference]: Finished difference Result 14607 states and 21300 transitions. [2019-09-08 12:42:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:42:09,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-08 12:42:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:09,990 INFO L225 Difference]: With dead ends: 14607 [2019-09-08 12:42:09,990 INFO L226 Difference]: Without dead ends: 9785 [2019-09-08 12:42:09,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states. [2019-09-08 12:42:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 4970. [2019-09-08 12:42:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-08 12:42:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7238 transitions. [2019-09-08 12:42:10,897 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7238 transitions. Word has length 123 [2019-09-08 12:42:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:10,897 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7238 transitions. [2019-09-08 12:42:10,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:42:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7238 transitions. [2019-09-08 12:42:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:42:10,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:10,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:10,899 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash -165022808, now seen corresponding path program 1 times [2019-09-08 12:42:10,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:10,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:10,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:10,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:10,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:11,116 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 12:42:11,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:11,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:42:11,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:42:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:42:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:42:11,118 INFO L87 Difference]: Start difference. First operand 4970 states and 7238 transitions. Second operand 10 states. [2019-09-08 12:42:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:13,673 INFO L93 Difference]: Finished difference Result 14722 states and 21462 transitions. [2019-09-08 12:42:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:42:13,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-09-08 12:42:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:13,690 INFO L225 Difference]: With dead ends: 14722 [2019-09-08 12:42:13,690 INFO L226 Difference]: Without dead ends: 9919 [2019-09-08 12:42:13,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9919 states. [2019-09-08 12:42:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9919 to 4970. [2019-09-08 12:42:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-08 12:42:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7232 transitions. [2019-09-08 12:42:14,682 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7232 transitions. Word has length 124 [2019-09-08 12:42:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:14,683 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7232 transitions. [2019-09-08 12:42:14,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:42:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7232 transitions. [2019-09-08 12:42:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:42:14,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:14,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:14,689 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:14,690 INFO L82 PathProgramCache]: Analyzing trace with hash -600651996, now seen corresponding path program 1 times [2019-09-08 12:42:14,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:14,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:14,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:14,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:14,947 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 12:42:14,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:14,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:42:14,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:42:14,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:42:14,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:42:14,950 INFO L87 Difference]: Start difference. First operand 4970 states and 7232 transitions. Second operand 10 states. [2019-09-08 12:42:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:17,312 INFO L93 Difference]: Finished difference Result 14607 states and 21272 transitions. [2019-09-08 12:42:17,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:42:17,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2019-09-08 12:42:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:17,326 INFO L225 Difference]: With dead ends: 14607 [2019-09-08 12:42:17,327 INFO L226 Difference]: Without dead ends: 9869 [2019-09-08 12:42:17,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9869 states. [2019-09-08 12:42:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9869 to 4970. [2019-09-08 12:42:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-08 12:42:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7224 transitions. [2019-09-08 12:42:18,136 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7224 transitions. Word has length 125 [2019-09-08 12:42:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:18,136 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7224 transitions. [2019-09-08 12:42:18,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:42:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7224 transitions. [2019-09-08 12:42:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:42:18,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:18,138 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:18,138 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:18,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1027454488, now seen corresponding path program 1 times [2019-09-08 12:42:18,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:18,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:18,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:18,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:18,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:18,375 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 12:42:18,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:18,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:42:18,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:42:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:42:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:42:18,376 INFO L87 Difference]: Start difference. First operand 4970 states and 7224 transitions. Second operand 10 states. [2019-09-08 12:42:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:20,616 INFO L93 Difference]: Finished difference Result 14672 states and 21354 transitions. [2019-09-08 12:42:20,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:42:20,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-09-08 12:42:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:20,627 INFO L225 Difference]: With dead ends: 14672 [2019-09-08 12:42:20,627 INFO L226 Difference]: Without dead ends: 9899 [2019-09-08 12:42:20,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9899 states. [2019-09-08 12:42:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9899 to 4970. [2019-09-08 12:42:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-08 12:42:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7217 transitions. [2019-09-08 12:42:21,372 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7217 transitions. Word has length 126 [2019-09-08 12:42:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:21,373 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7217 transitions. [2019-09-08 12:42:21,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:42:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7217 transitions. [2019-09-08 12:42:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:42:21,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:21,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:21,374 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1728637094, now seen corresponding path program 1 times [2019-09-08 12:42:21,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:21,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:21,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:21,605 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 12:42:21,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:21,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:42:21,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:42:21,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:42:21,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:42:21,606 INFO L87 Difference]: Start difference. First operand 4970 states and 7217 transitions. Second operand 10 states. [2019-09-08 12:42:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:25,891 INFO L93 Difference]: Finished difference Result 23278 states and 33710 transitions. [2019-09-08 12:42:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:42:25,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-09-08 12:42:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:25,905 INFO L225 Difference]: With dead ends: 23278 [2019-09-08 12:42:25,906 INFO L226 Difference]: Without dead ends: 18548 [2019-09-08 12:42:25,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:42:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18548 states. [2019-09-08 12:42:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18548 to 4997. [2019-09-08 12:42:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4997 states. [2019-09-08 12:42:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4997 states to 4997 states and 7253 transitions. [2019-09-08 12:42:26,748 INFO L78 Accepts]: Start accepts. Automaton has 4997 states and 7253 transitions. Word has length 127 [2019-09-08 12:42:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:26,749 INFO L475 AbstractCegarLoop]: Abstraction has 4997 states and 7253 transitions. [2019-09-08 12:42:26,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:42:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4997 states and 7253 transitions. [2019-09-08 12:42:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:42:26,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:26,750 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:26,750 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2105653509, now seen corresponding path program 1 times [2019-09-08 12:42:26,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:26,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:26,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:26,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:26,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:26,831 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 12:42:26,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:26,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:42:26,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:42:26,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:42:26,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:42:26,832 INFO L87 Difference]: Start difference. First operand 4997 states and 7253 transitions. Second operand 3 states. [2019-09-08 12:42:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:28,434 INFO L93 Difference]: Finished difference Result 14205 states and 20780 transitions. [2019-09-08 12:42:28,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:42:28,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 12:42:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:28,442 INFO L225 Difference]: With dead ends: 14205 [2019-09-08 12:42:28,442 INFO L226 Difference]: Without dead ends: 9475 [2019-09-08 12:42:28,447 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 12:42:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9475 states. [2019-09-08 12:42:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9475 to 9221. [2019-09-08 12:42:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9221 states. [2019-09-08 12:42:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9221 states to 9221 states and 13345 transitions. [2019-09-08 12:42:29,910 INFO L78 Accepts]: Start accepts. Automaton has 9221 states and 13345 transitions. Word has length 128 [2019-09-08 12:42:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:29,910 INFO L475 AbstractCegarLoop]: Abstraction has 9221 states and 13345 transitions. [2019-09-08 12:42:29,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:42:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9221 states and 13345 transitions. [2019-09-08 12:42:29,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:42:29,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:29,912 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:29,912 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:29,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1669775685, now seen corresponding path program 1 times [2019-09-08 12:42:29,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:29,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:29,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:29,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:29,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:31,285 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:42:31,512 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:42:31,681 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 12:42:31,891 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 12:42:32,076 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 12:42:32,298 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 12:42:32,493 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-08 12:42:32,712 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-08 12:42:32,905 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-08 12:42:33,132 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-08 12:42:33,552 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 12:42:33,909 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 12:42:35,832 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 12:42:35,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:35,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2019-09-08 12:42:35,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 12:42:35,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 12:42:35,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 12:42:35,834 INFO L87 Difference]: Start difference. First operand 9221 states and 13345 transitions. Second operand 46 states. [2019-09-08 12:42:36,055 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-08 12:42:37,380 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 12:42:37,576 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 12:42:37,791 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:42:38,117 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 12:42:39,133 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-08 12:42:39,860 WARN L188 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-08 12:42:40,437 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 139 [2019-09-08 12:42:41,131 WARN L188 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 153 [2019-09-08 12:42:41,822 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 138 [2019-09-08 12:42:42,658 WARN L188 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 153 [2019-09-08 12:42:43,479 WARN L188 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 160 [2019-09-08 12:42:44,506 WARN L188 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 175 [2019-09-08 12:42:45,572 WARN L188 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 182 [2019-09-08 12:42:46,837 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 237 DAG size of output: 193 [2019-09-08 12:42:48,107 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 247 DAG size of output: 200 [2019-09-08 12:42:50,141 WARN L188 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 272 DAG size of output: 223 [2019-09-08 12:42:52,259 WARN L188 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 286 DAG size of output: 233 [2019-09-08 12:42:52,810 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2019-09-08 12:42:53,249 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-08 12:42:53,733 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-08 12:42:54,230 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 101 [2019-09-08 12:42:54,630 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-09-08 12:42:55,208 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-08 12:42:55,858 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-08 12:42:56,437 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-08 12:42:57,005 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-08 12:42:57,270 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-08 12:42:58,238 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-08 12:42:58,931 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-08 12:43:00,047 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-08 12:43:00,852 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-08 12:43:01,937 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-08 12:43:02,778 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-08 12:43:03,256 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 12:43:03,992 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 12:43:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:20,578 INFO L93 Difference]: Finished difference Result 40285 states and 58469 transitions. [2019-09-08 12:43:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 12:43:20,578 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 128 [2019-09-08 12:43:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:20,613 INFO L225 Difference]: With dead ends: 40285 [2019-09-08 12:43:20,613 INFO L226 Difference]: Without dead ends: 37305 [2019-09-08 12:43:20,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=1613, Invalid=8089, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 12:43:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37305 states. [2019-09-08 12:43:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37305 to 9261. [2019-09-08 12:43:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9261 states. [2019-09-08 12:43:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9261 states to 9261 states and 13395 transitions. [2019-09-08 12:43:22,812 INFO L78 Accepts]: Start accepts. Automaton has 9261 states and 13395 transitions. Word has length 128 [2019-09-08 12:43:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:22,812 INFO L475 AbstractCegarLoop]: Abstraction has 9261 states and 13395 transitions. [2019-09-08 12:43:22,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 12:43:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9261 states and 13395 transitions. [2019-09-08 12:43:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:43:22,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:22,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:43:22,814 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1390990270, now seen corresponding path program 1 times [2019-09-08 12:43:22,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:22,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:24,422 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 12:43:24,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:24,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:43:24,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:43:24,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:43:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:43:24,424 INFO L87 Difference]: Start difference. First operand 9261 states and 13395 transitions. Second operand 25 states. [2019-09-08 12:43:25,554 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 12:43:25,814 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:43:26,140 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-08 12:43:26,507 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-08 12:43:27,163 WARN L188 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-09-08 12:43:27,846 WARN L188 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-09-08 12:43:28,062 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 12:43:28,219 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-08 12:43:28,581 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 12:43:28,996 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 12:43:29,257 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:43:29,643 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:43:30,181 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:43:30,898 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:43:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:43,155 INFO L93 Difference]: Finished difference Result 46626 states and 67729 transitions. [2019-09-08 12:43:43,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:43:43,156 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2019-09-08 12:43:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:43,189 INFO L225 Difference]: With dead ends: 46626 [2019-09-08 12:43:43,189 INFO L226 Difference]: Without dead ends: 40668 [2019-09-08 12:43:43,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=527, Invalid=2229, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 12:43:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40668 states. [2019-09-08 12:43:45,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40668 to 9281. [2019-09-08 12:43:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2019-09-08 12:43:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 13417 transitions. [2019-09-08 12:43:45,795 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 13417 transitions. Word has length 128 [2019-09-08 12:43:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:45,795 INFO L475 AbstractCegarLoop]: Abstraction has 9281 states and 13417 transitions. [2019-09-08 12:43:45,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:43:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 13417 transitions. [2019-09-08 12:43:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:43:45,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:45,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:43:45,797 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash 970646882, now seen corresponding path program 1 times [2019-09-08 12:43:45,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:45,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:45,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:46,719 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 12:43:46,881 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:43:47,069 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-08 12:43:47,232 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:43:47,448 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-08 12:43:47,652 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 12:43:47,886 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-08 12:43:48,098 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:43:48,328 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-08 12:43:48,521 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 12:43:48,747 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-08 12:43:48,931 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-08 12:43:49,120 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 12:43:50,594 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 12:43:50,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:50,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-09-08 12:43:50,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 12:43:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 12:43:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:43:50,596 INFO L87 Difference]: Start difference. First operand 9281 states and 13417 transitions. Second operand 41 states. [2019-09-08 12:43:50,836 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-09-08 12:43:52,083 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-08 12:43:52,273 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-08 12:43:52,490 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-09-08 12:43:52,731 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-08 12:43:53,138 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-09-08 12:43:54,291 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-09-08 12:43:54,673 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 84 [2019-09-08 12:43:55,173 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 102 [2019-09-08 12:43:55,724 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 110 [2019-09-08 12:43:56,464 WARN L188 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 128 [2019-09-08 12:43:57,219 WARN L188 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 137 [2019-09-08 12:43:58,186 WARN L188 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 156 [2019-09-08 12:43:59,248 WARN L188 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 165 [2019-09-08 12:44:00,456 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 240 DAG size of output: 183 [2019-09-08 12:44:01,708 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 252 DAG size of output: 191 [2019-09-08 12:44:03,153 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 273 DAG size of output: 206 [2019-09-08 12:44:03,572 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2019-09-08 12:44:03,961 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2019-09-08 12:44:04,363 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-09-08 12:44:04,954 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-08 12:44:05,407 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-08 12:44:06,157 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-09-08 12:44:06,603 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-09-08 12:44:07,711 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-09-08 12:44:08,258 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-09-08 12:44:09,292 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-08 12:44:09,920 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-08 12:44:10,876 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-08 12:44:11,400 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-08 12:44:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:29,971 INFO L93 Difference]: Finished difference Result 42847 states and 62194 transitions. [2019-09-08 12:44:29,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 12:44:29,971 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 128 [2019-09-08 12:44:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:30,002 INFO L225 Difference]: With dead ends: 42847 [2019-09-08 12:44:30,002 INFO L226 Difference]: Without dead ends: 36865 [2019-09-08 12:44:30,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=1308, Invalid=5012, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 12:44:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36865 states. [2019-09-08 12:44:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36865 to 9331. [2019-09-08 12:44:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9331 states. [2019-09-08 12:44:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9331 states to 9331 states and 13481 transitions. [2019-09-08 12:44:33,008 INFO L78 Accepts]: Start accepts. Automaton has 9331 states and 13481 transitions. Word has length 128 [2019-09-08 12:44:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:33,008 INFO L475 AbstractCegarLoop]: Abstraction has 9331 states and 13481 transitions. [2019-09-08 12:44:33,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 12:44:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9331 states and 13481 transitions. [2019-09-08 12:44:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:44:33,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:33,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:33,009 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:33,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1768753698, now seen corresponding path program 1 times [2019-09-08 12:44:33,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:33,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:33,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:33,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:33,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:34,464 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 12:44:34,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:34,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:44:34,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:44:34,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:44:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:44:34,466 INFO L87 Difference]: Start difference. First operand 9331 states and 13481 transitions. Second operand 24 states. [2019-09-08 12:44:35,653 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:44:35,904 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:44:36,315 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 12:44:36,950 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-09-08 12:44:37,799 WARN L188 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2019-09-08 12:44:38,023 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 12:44:38,243 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 12:44:38,471 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 12:44:39,148 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 12:44:39,503 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:44:39,788 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:44:40,170 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:44:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:54,320 INFO L93 Difference]: Finished difference Result 43842 states and 63607 transitions. [2019-09-08 12:44:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:44:54,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 128 [2019-09-08 12:44:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:54,352 INFO L225 Difference]: With dead ends: 43842 [2019-09-08 12:44:54,353 INFO L226 Difference]: Without dead ends: 38740 [2019-09-08 12:44:54,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=490, Invalid=1960, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 12:44:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38740 states. [2019-09-08 12:44:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38740 to 9447. [2019-09-08 12:44:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9447 states. [2019-09-08 12:44:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9447 states to 9447 states and 13638 transitions. [2019-09-08 12:44:57,822 INFO L78 Accepts]: Start accepts. Automaton has 9447 states and 13638 transitions. Word has length 128 [2019-09-08 12:44:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:57,822 INFO L475 AbstractCegarLoop]: Abstraction has 9447 states and 13638 transitions. [2019-09-08 12:44:57,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:44:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 9447 states and 13638 transitions. [2019-09-08 12:44:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:44:57,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:57,824 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:57,824 INFO L82 PathProgramCache]: Analyzing trace with hash 859171391, now seen corresponding path program 1 times [2019-09-08 12:44:57,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:57,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:57,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:57,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:57,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:58,782 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:44:59,040 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:44:59,600 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 12:44:59,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:59,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:44:59,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:44:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:44:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:44:59,602 INFO L87 Difference]: Start difference. First operand 9447 states and 13638 transitions. Second operand 25 states. [2019-09-08 12:45:00,685 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-08 12:45:00,954 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-08 12:45:01,305 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-08 12:45:01,702 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-09-08 12:45:02,212 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2019-09-08 12:45:02,755 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 122 [2019-09-08 12:45:03,010 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-08 12:45:03,499 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-08 12:45:03,949 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-08 12:45:04,176 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:45:04,558 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:45:05,019 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 12:45:05,438 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 12:45:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:23,889 INFO L93 Difference]: Finished difference Result 50025 states and 72599 transitions. [2019-09-08 12:45:23,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:45:23,889 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2019-09-08 12:45:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:23,927 INFO L225 Difference]: With dead ends: 50025 [2019-09-08 12:45:23,928 INFO L226 Difference]: Without dead ends: 44043 [2019-09-08 12:45:23,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:45:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44043 states. [2019-09-08 12:45:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44043 to 9451. [2019-09-08 12:45:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9451 states. [2019-09-08 12:45:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9451 states to 9451 states and 13638 transitions. [2019-09-08 12:45:27,855 INFO L78 Accepts]: Start accepts. Automaton has 9451 states and 13638 transitions. Word has length 128 [2019-09-08 12:45:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:27,855 INFO L475 AbstractCegarLoop]: Abstraction has 9451 states and 13638 transitions. [2019-09-08 12:45:27,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:45:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 9451 states and 13638 transitions. [2019-09-08 12:45:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:45:27,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:27,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:27,858 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash 759484704, now seen corresponding path program 1 times [2019-09-08 12:45:27,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:27,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:29,214 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-09-08 12:45:29,557 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 12:45:29,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:29,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:45:29,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:45:29,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:45:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:45:29,558 INFO L87 Difference]: Start difference. First operand 9451 states and 13638 transitions. Second operand 24 states. [2019-09-08 12:45:30,742 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 12:45:30,970 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-08 12:45:31,294 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-08 12:45:31,676 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2019-09-08 12:45:32,167 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 121 [2019-09-08 12:45:32,385 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:45:32,610 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:45:32,957 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:45:33,296 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:45:33,692 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:45:34,871 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:45:35,509 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 12:46:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:02,183 INFO L93 Difference]: Finished difference Result 65413 states and 94832 transitions. [2019-09-08 12:46:02,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:46:02,183 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 128 [2019-09-08 12:46:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:02,236 INFO L225 Difference]: With dead ends: 65413 [2019-09-08 12:46:02,237 INFO L226 Difference]: Without dead ends: 59455 [2019-09-08 12:46:02,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 12:46:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59455 states. [2019-09-08 12:46:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59455 to 9600. [2019-09-08 12:46:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9600 states. [2019-09-08 12:46:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9600 states to 9600 states and 13831 transitions. [2019-09-08 12:46:06,658 INFO L78 Accepts]: Start accepts. Automaton has 9600 states and 13831 transitions. Word has length 128 [2019-09-08 12:46:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:06,659 INFO L475 AbstractCegarLoop]: Abstraction has 9600 states and 13831 transitions. [2019-09-08 12:46:06,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:46:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9600 states and 13831 transitions. [2019-09-08 12:46:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:46:06,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:06,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:06,661 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 568996734, now seen corresponding path program 1 times [2019-09-08 12:46:06,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:06,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:06,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:06,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:06,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:07,531 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 12:46:07,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:07,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:46:07,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:46:07,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:46:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:46:07,532 INFO L87 Difference]: Start difference. First operand 9600 states and 13831 transitions. Second operand 15 states. [2019-09-08 12:46:08,003 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:46:08,158 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 12:46:08,350 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-08 12:46:08,516 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-08 12:46:08,701 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:46:08,981 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:46:09,182 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 12:46:09,306 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:46:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:29,908 INFO L93 Difference]: Finished difference Result 48430 states and 70288 transitions. [2019-09-08 12:46:29,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:46:29,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 129 [2019-09-08 12:46:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:29,946 INFO L225 Difference]: With dead ends: 48430 [2019-09-08 12:46:29,946 INFO L226 Difference]: Without dead ends: 45317 [2019-09-08 12:46:29,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:46:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-09-08 12:46:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 9509. [2019-09-08 12:46:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9509 states. [2019-09-08 12:46:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9509 states to 9509 states and 13711 transitions. [2019-09-08 12:46:34,413 INFO L78 Accepts]: Start accepts. Automaton has 9509 states and 13711 transitions. Word has length 129 [2019-09-08 12:46:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:34,413 INFO L475 AbstractCegarLoop]: Abstraction has 9509 states and 13711 transitions. [2019-09-08 12:46:34,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:46:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9509 states and 13711 transitions. [2019-09-08 12:46:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:46:34,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:34,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:34,415 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash -279551843, now seen corresponding path program 1 times [2019-09-08 12:46:34,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:34,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:34,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:34,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:34,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:34,955 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 12:46:34,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:34,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:46:34,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:46:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:46:34,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:46:34,957 INFO L87 Difference]: Start difference. First operand 9509 states and 13711 transitions. Second operand 13 states. [2019-09-08 12:46:35,268 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-08 12:46:35,412 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:46:35,566 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:46:35,930 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:46:36,141 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 12:46:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:53,277 INFO L93 Difference]: Finished difference Result 41750 states and 60536 transitions. [2019-09-08 12:46:53,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:53,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-08 12:46:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:53,309 INFO L225 Difference]: With dead ends: 41750 [2019-09-08 12:46:53,309 INFO L226 Difference]: Without dead ends: 36622 [2019-09-08 12:46:53,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:46:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36622 states. [2019-09-08 12:46:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36622 to 9438. [2019-09-08 12:46:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9438 states. [2019-09-08 12:46:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 13604 transitions. [2019-09-08 12:46:57,882 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 13604 transitions. Word has length 129 [2019-09-08 12:46:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:57,882 INFO L475 AbstractCegarLoop]: Abstraction has 9438 states and 13604 transitions. [2019-09-08 12:46:57,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:46:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 13604 transitions. [2019-09-08 12:46:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:46:57,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:57,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:57,884 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1197732160, now seen corresponding path program 1 times [2019-09-08 12:46:57,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:57,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:59,104 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 12:46:59,241 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:46:59,408 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-08 12:46:59,697 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-08 12:47:00,565 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 12:47:00,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:00,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:47:00,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:47:00,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:47:00,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:47:00,567 INFO L87 Difference]: Start difference. First operand 9438 states and 13604 transitions. Second operand 31 states. [2019-09-08 12:47:01,751 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-08 12:47:02,232 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-08 12:47:02,536 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-08 12:47:02,993 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-08 12:47:03,466 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2019-09-08 12:47:04,100 WARN L188 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 121 [2019-09-08 12:47:04,778 WARN L188 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2019-09-08 12:47:05,677 WARN L188 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 161 [2019-09-08 12:47:06,624 WARN L188 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 174 [2019-09-08 12:47:06,915 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-08 12:47:07,136 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-08 12:47:07,532 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-08 12:47:07,978 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-08 12:47:08,354 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-08 12:47:08,747 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-08 12:47:09,404 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-08 12:47:09,878 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-08 12:47:10,640 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-08 12:47:11,121 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-08 12:47:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:37,033 INFO L93 Difference]: Finished difference Result 48287 states and 70029 transitions. [2019-09-08 12:47:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 12:47:37,033 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2019-09-08 12:47:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:37,070 INFO L225 Difference]: With dead ends: 48287 [2019-09-08 12:47:37,071 INFO L226 Difference]: Without dead ends: 43159 [2019-09-08 12:47:37,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=770, Invalid=3390, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 12:47:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43159 states. [2019-09-08 12:47:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43159 to 9452. [2019-09-08 12:47:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-09-08 12:47:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 13621 transitions. [2019-09-08 12:47:42,893 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 13621 transitions. Word has length 129 [2019-09-08 12:47:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:42,894 INFO L475 AbstractCegarLoop]: Abstraction has 9452 states and 13621 transitions. [2019-09-08 12:47:42,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:47:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 13621 transitions. [2019-09-08 12:47:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:47:42,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:42,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:47:42,896 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash -59208219, now seen corresponding path program 1 times [2019-09-08 12:47:42,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:42,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:42,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:42,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:42,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:43,484 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 12:47:43,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:43,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:47:43,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:47:43,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:47:43,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:47:43,485 INFO L87 Difference]: Start difference. First operand 9452 states and 13621 transitions. Second operand 16 states. [2019-09-08 12:47:44,104 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:47:44,301 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 12:47:44,511 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:47:44,700 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 12:47:45,274 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:47:45,459 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 12:47:45,707 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 12:47:45,870 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:47:46,058 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 12:47:50,900 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 12:47:51,445 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-08 12:48:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:19,036 INFO L93 Difference]: Finished difference Result 64312 states and 93286 transitions. [2019-09-08 12:48:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:48:19,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-08 12:48:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:19,086 INFO L225 Difference]: With dead ends: 64312 [2019-09-08 12:48:19,087 INFO L226 Difference]: Without dead ends: 58354 [2019-09-08 12:48:19,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=306, Invalid=1026, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:48:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58354 states. [2019-09-08 12:48:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58354 to 9321. [2019-09-08 12:48:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9321 states. [2019-09-08 12:48:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9321 states to 9321 states and 13458 transitions. [2019-09-08 12:48:24,605 INFO L78 Accepts]: Start accepts. Automaton has 9321 states and 13458 transitions. Word has length 129 [2019-09-08 12:48:24,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:24,605 INFO L475 AbstractCegarLoop]: Abstraction has 9321 states and 13458 transitions. [2019-09-08 12:48:24,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:48:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9321 states and 13458 transitions. [2019-09-08 12:48:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:48:24,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:24,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:24,607 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash -829357733, now seen corresponding path program 1 times [2019-09-08 12:48:24,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:24,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:24,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:25,388 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:48:25,523 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:48:25,693 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:48:25,995 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 12:48:27,070 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 12:48:27,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:27,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-08 12:48:27,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 12:48:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 12:48:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:48:27,071 INFO L87 Difference]: Start difference. First operand 9321 states and 13458 transitions. Second operand 29 states. [2019-09-08 12:48:28,225 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-09-08 12:48:28,686 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-09-08 12:48:28,932 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2019-09-08 12:48:29,248 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 69 [2019-09-08 12:48:29,616 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 76 [2019-09-08 12:48:30,090 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 93 [2019-09-08 12:48:30,589 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 101 [2019-09-08 12:48:31,211 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 118 [2019-09-08 12:48:31,517 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-09-08 12:48:31,825 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-09-08 12:48:32,161 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-09-08 12:48:32,569 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-08 12:48:32,866 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-08 12:48:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:55,094 INFO L93 Difference]: Finished difference Result 39257 states and 56939 transitions. [2019-09-08 12:48:55,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:48:55,094 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 129 [2019-09-08 12:48:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:55,122 INFO L225 Difference]: With dead ends: 39257 [2019-09-08 12:48:55,122 INFO L226 Difference]: Without dead ends: 33259 [2019-09-08 12:48:55,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=536, Invalid=2014, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:48:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33259 states. [2019-09-08 12:49:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33259 to 9319. [2019-09-08 12:49:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9319 states. [2019-09-08 12:49:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9319 states to 9319 states and 13454 transitions. [2019-09-08 12:49:00,785 INFO L78 Accepts]: Start accepts. Automaton has 9319 states and 13454 transitions. Word has length 129 [2019-09-08 12:49:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:00,786 INFO L475 AbstractCegarLoop]: Abstraction has 9319 states and 13454 transitions. [2019-09-08 12:49:00,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 12:49:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 9319 states and 13454 transitions. [2019-09-08 12:49:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:49:00,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:00,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:00,787 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1635491301, now seen corresponding path program 1 times [2019-09-08 12:49:00,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:00,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:00,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:00,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:00,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:01,631 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 12:49:01,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:01,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:49:01,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:49:01,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:49:01,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:49:01,632 INFO L87 Difference]: Start difference. First operand 9319 states and 13454 transitions. Second operand 17 states. [2019-09-08 12:49:02,488 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-09-08 12:49:02,645 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-08 12:49:02,799 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:49:02,930 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-08 12:49:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:29,851 INFO L93 Difference]: Finished difference Result 48498 states and 70466 transitions. [2019-09-08 12:49:29,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:49:29,852 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2019-09-08 12:49:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:29,887 INFO L225 Difference]: With dead ends: 48498 [2019-09-08 12:49:29,887 INFO L226 Difference]: Without dead ends: 42470 [2019-09-08 12:49:29,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:49:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42470 states. [2019-09-08 12:49:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42470 to 9304. [2019-09-08 12:49:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9304 states. [2019-09-08 12:49:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9304 states to 9304 states and 13436 transitions. [2019-09-08 12:49:35,720 INFO L78 Accepts]: Start accepts. Automaton has 9304 states and 13436 transitions. Word has length 129 [2019-09-08 12:49:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:35,720 INFO L475 AbstractCegarLoop]: Abstraction has 9304 states and 13436 transitions. [2019-09-08 12:49:35,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:49:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 9304 states and 13436 transitions. [2019-09-08 12:49:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:49:35,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:35,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:35,721 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1459134333, now seen corresponding path program 1 times [2019-09-08 12:49:35,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:35,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:35,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:36,633 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 12:49:36,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:36,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:49:36,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:49:36,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:49:36,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:49:36,634 INFO L87 Difference]: Start difference. First operand 9304 states and 13436 transitions. Second operand 19 states. [2019-09-08 12:49:37,221 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-08 12:49:37,419 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:49:37,718 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-09-08 12:49:38,160 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-08 12:49:38,328 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-08 12:49:38,732 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 12:49:39,025 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:49:39,195 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:49:39,463 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:50:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:07,547 INFO L93 Difference]: Finished difference Result 51274 states and 74469 transitions. [2019-09-08 12:50:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:50:07,547 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2019-09-08 12:50:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:07,587 INFO L225 Difference]: With dead ends: 51274 [2019-09-08 12:50:07,588 INFO L226 Difference]: Without dead ends: 45298 [2019-09-08 12:50:07,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:50:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45298 states. [2019-09-08 12:50:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45298 to 9278. [2019-09-08 12:50:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9278 states. [2019-09-08 12:50:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 13404 transitions. [2019-09-08 12:50:13,484 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 13404 transitions. Word has length 129 [2019-09-08 12:50:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:13,485 INFO L475 AbstractCegarLoop]: Abstraction has 9278 states and 13404 transitions. [2019-09-08 12:50:13,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:50:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 13404 transitions. [2019-09-08 12:50:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:50:13,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:13,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:13,486 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:13,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:13,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1282415388, now seen corresponding path program 1 times [2019-09-08 12:50:13,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:13,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:13,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:13,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:13,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:14,385 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:50:15,211 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 12:50:15,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:15,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:50:15,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:50:15,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:50:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:50:15,212 INFO L87 Difference]: Start difference. First operand 9278 states and 13404 transitions. Second operand 25 states. [2019-09-08 12:50:16,337 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 12:50:16,580 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-08 12:50:16,928 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-09-08 12:50:17,348 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-09-08 12:50:17,906 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 125 [2019-09-08 12:50:18,531 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 138 [2019-09-08 12:50:18,764 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-08 12:50:18,932 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-08 12:50:19,245 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-08 12:50:19,558 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:50:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:41,262 INFO L93 Difference]: Finished difference Result 35301 states and 51205 transitions. [2019-09-08 12:50:41,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:50:41,262 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2019-09-08 12:50:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:41,289 INFO L225 Difference]: With dead ends: 35301 [2019-09-08 12:50:41,290 INFO L226 Difference]: Without dead ends: 32276 [2019-09-08 12:50:41,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=385, Invalid=1777, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 12:50:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32276 states. [2019-09-08 12:50:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32276 to 9266. [2019-09-08 12:50:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9266 states. [2019-09-08 12:50:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9266 states to 9266 states and 13387 transitions. [2019-09-08 12:50:47,286 INFO L78 Accepts]: Start accepts. Automaton has 9266 states and 13387 transitions. Word has length 129 [2019-09-08 12:50:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:47,286 INFO L475 AbstractCegarLoop]: Abstraction has 9266 states and 13387 transitions. [2019-09-08 12:50:47,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:50:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 9266 states and 13387 transitions. [2019-09-08 12:50:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:50:47,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:47,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:47,287 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:47,288 INFO L82 PathProgramCache]: Analyzing trace with hash 476281820, now seen corresponding path program 1 times [2019-09-08 12:50:47,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:47,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:47,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:47,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:47,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:47,648 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-08 12:50:48,020 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 12:50:48,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:48,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:50:48,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:50:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:50:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:50:48,022 INFO L87 Difference]: Start difference. First operand 9266 states and 13387 transitions. Second operand 13 states. [2019-09-08 12:50:48,497 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 12:50:48,661 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 12:50:48,954 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:50:49,158 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 12:51:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:12,730 INFO L93 Difference]: Finished difference Result 38592 states and 55983 transitions. [2019-09-08 12:51:12,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:12,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-08 12:51:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:12,758 INFO L225 Difference]: With dead ends: 38592 [2019-09-08 12:51:12,758 INFO L226 Difference]: Without dead ends: 35552 [2019-09-08 12:51:12,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:51:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35552 states. [2019-09-08 12:51:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35552 to 9201. [2019-09-08 12:51:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9201 states. [2019-09-08 12:51:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9201 states to 9201 states and 13307 transitions. [2019-09-08 12:51:18,811 INFO L78 Accepts]: Start accepts. Automaton has 9201 states and 13307 transitions. Word has length 129 [2019-09-08 12:51:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:18,812 INFO L475 AbstractCegarLoop]: Abstraction has 9201 states and 13307 transitions. [2019-09-08 12:51:18,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:51:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9201 states and 13307 transitions. [2019-09-08 12:51:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:51:18,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:18,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:18,813 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:18,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:18,813 INFO L82 PathProgramCache]: Analyzing trace with hash 9869342, now seen corresponding path program 1 times [2019-09-08 12:51:18,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:18,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:18,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:18,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:18,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:19,190 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-08 12:51:19,375 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 12:51:19,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:19,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:51:19,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:51:19,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:51:19,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:51:19,377 INFO L87 Difference]: Start difference. First operand 9201 states and 13307 transitions. Second operand 13 states. [2019-09-08 12:51:19,918 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-08 12:51:20,153 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-08 12:51:20,403 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-08 12:51:20,793 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 12:51:21,085 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-08 12:51:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:45,501 INFO L93 Difference]: Finished difference Result 42230 states and 61304 transitions. [2019-09-08 12:51:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:45,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-08 12:51:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:45,532 INFO L225 Difference]: With dead ends: 42230 [2019-09-08 12:51:45,532 INFO L226 Difference]: Without dead ends: 36232 [2019-09-08 12:51:45,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:51:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36232 states. [2019-09-08 12:51:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36232 to 9181. [2019-09-08 12:51:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-09-08 12:51:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 13279 transitions. [2019-09-08 12:51:51,957 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 13279 transitions. Word has length 129 [2019-09-08 12:51:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:51,957 INFO L475 AbstractCegarLoop]: Abstraction has 9181 states and 13279 transitions. [2019-09-08 12:51:51,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:51:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 13279 transitions. [2019-09-08 12:51:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:51:51,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:51,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:51,958 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1214549341, now seen corresponding path program 1 times [2019-09-08 12:51:51,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:51,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:52,942 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 12:51:52,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:52,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:51:52,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:51:52,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:51:52,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:51:52,943 INFO L87 Difference]: Start difference. First operand 9181 states and 13279 transitions. Second operand 19 states. [2019-09-08 12:51:53,514 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-08 12:51:53,712 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:51:54,001 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 12:51:54,479 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-08 12:51:54,644 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:51:54,942 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:51:55,186 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:51:55,382 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:51:55,594 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:52:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:25,775 INFO L93 Difference]: Finished difference Result 47669 states and 69276 transitions. [2019-09-08 12:52:25,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:52:25,776 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2019-09-08 12:52:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:25,812 INFO L225 Difference]: With dead ends: 47669 [2019-09-08 12:52:25,812 INFO L226 Difference]: Without dead ends: 42527 [2019-09-08 12:52:25,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:52:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42527 states. [2019-09-08 12:52:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42527 to 9169. [2019-09-08 12:52:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9169 states. [2019-09-08 12:52:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9169 states to 9169 states and 13263 transitions. [2019-09-08 12:52:32,447 INFO L78 Accepts]: Start accepts. Automaton has 9169 states and 13263 transitions. Word has length 129 [2019-09-08 12:52:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:32,447 INFO L475 AbstractCegarLoop]: Abstraction has 9169 states and 13263 transitions. [2019-09-08 12:52:32,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:52:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9169 states and 13263 transitions. [2019-09-08 12:52:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:52:32,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:32,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:32,448 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1604872504, now seen corresponding path program 1 times [2019-09-08 12:52:32,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:32,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:32,811 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-08 12:52:33,173 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 12:52:33,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:33,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:52:33,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:52:33,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:52:33,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:52:33,174 INFO L87 Difference]: Start difference. First operand 9169 states and 13263 transitions. Second operand 13 states. [2019-09-08 12:52:33,596 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 12:52:33,750 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:52:33,908 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:52:34,230 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:52:34,441 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:53:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:00,716 INFO L93 Difference]: Finished difference Result 42094 states and 61134 transitions. [2019-09-08 12:53:00,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:00,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2019-09-08 12:53:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:00,749 INFO L225 Difference]: With dead ends: 42094 [2019-09-08 12:53:00,749 INFO L226 Difference]: Without dead ends: 36114 [2019-09-08 12:53:00,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:53:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36114 states. [2019-09-08 12:53:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36114 to 9154. [2019-09-08 12:53:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2019-09-08 12:53:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 13243 transitions. [2019-09-08 12:53:08,366 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 13243 transitions. Word has length 130 [2019-09-08 12:53:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:08,366 INFO L475 AbstractCegarLoop]: Abstraction has 9154 states and 13243 transitions. [2019-09-08 12:53:08,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:53:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 13243 transitions. [2019-09-08 12:53:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:53:08,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:08,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:08,367 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1312996549, now seen corresponding path program 1 times [2019-09-08 12:53:08,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:08,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:08,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:09,187 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-08 12:53:09,701 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 12:53:09,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:09,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:53:09,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:53:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:53:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:53:09,703 INFO L87 Difference]: Start difference. First operand 9154 states and 13243 transitions. Second operand 17 states. [2019-09-08 12:53:10,430 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 12:53:10,575 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 12:53:10,910 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-08 12:53:11,081 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:53:11,247 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:53:11,407 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:53:11,758 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-08 12:53:11,925 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 12:53:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:38,796 INFO L93 Difference]: Finished difference Result 40961 states and 59506 transitions. [2019-09-08 12:53:38,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:53:38,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2019-09-08 12:53:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:38,825 INFO L225 Difference]: With dead ends: 40961 [2019-09-08 12:53:38,825 INFO L226 Difference]: Without dead ends: 34951 [2019-09-08 12:53:38,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:53:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34951 states. [2019-09-08 12:53:45,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34951 to 8824. [2019-09-08 12:53:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8824 states. [2019-09-08 12:53:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8824 states to 8824 states and 12781 transitions. [2019-09-08 12:53:45,599 INFO L78 Accepts]: Start accepts. Automaton has 8824 states and 12781 transitions. Word has length 130 [2019-09-08 12:53:45,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:45,600 INFO L475 AbstractCegarLoop]: Abstraction has 8824 states and 12781 transitions. [2019-09-08 12:53:45,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:53:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 8824 states and 12781 transitions. [2019-09-08 12:53:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:53:45,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:45,600 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:45,601 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:45,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:45,601 INFO L82 PathProgramCache]: Analyzing trace with hash 842257019, now seen corresponding path program 1 times [2019-09-08 12:53:45,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:45,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:45,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:46,303 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 12:53:46,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:46,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:53:46,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:53:46,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:53:46,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:53:46,304 INFO L87 Difference]: Start difference. First operand 8824 states and 12781 transitions. Second operand 14 states. [2019-09-08 12:53:46,919 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 12:53:47,121 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 12:53:47,368 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 12:53:47,535 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-08 12:53:47,685 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:53:47,869 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 12:53:48,072 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:53:48,209 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 12:53:48,373 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:53:49,211 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-08 12:54:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:29,802 INFO L93 Difference]: Finished difference Result 57374 states and 83410 transitions. [2019-09-08 12:54:29,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:54:29,802 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-09-08 12:54:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:29,845 INFO L225 Difference]: With dead ends: 57374 [2019-09-08 12:54:29,845 INFO L226 Difference]: Without dead ends: 52251 [2019-09-08 12:54:29,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:54:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52251 states. [2019-09-08 12:54:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52251 to 8803. [2019-09-08 12:54:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8803 states. [2019-09-08 12:54:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8803 states to 8803 states and 12756 transitions. [2019-09-08 12:54:37,032 INFO L78 Accepts]: Start accepts. Automaton has 8803 states and 12756 transitions. Word has length 130 [2019-09-08 12:54:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:37,033 INFO L475 AbstractCegarLoop]: Abstraction has 8803 states and 12756 transitions. [2019-09-08 12:54:37,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:54:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8803 states and 12756 transitions. [2019-09-08 12:54:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 12:54:37,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:37,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:37,036 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 892131988, now seen corresponding path program 1 times [2019-09-08 12:54:37,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:37,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:37,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:37,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:37,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:37,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:37,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:37,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:37,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:37,098 INFO L87 Difference]: Start difference. First operand 8803 states and 12756 transitions. Second operand 3 states. [2019-09-08 12:54:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:50,910 INFO L93 Difference]: Finished difference Result 25667 states and 37146 transitions. [2019-09-08 12:54:50,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:50,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 12:54:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:50,926 INFO L225 Difference]: With dead ends: 25667 [2019-09-08 12:54:50,926 INFO L226 Difference]: Without dead ends: 16991 [2019-09-08 12:54:50,933 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 12:54:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16991 states. [2019-09-08 12:55:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16991 to 16501. [2019-09-08 12:55:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16501 states. [2019-09-08 12:55:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16501 states to 16501 states and 23791 transitions. [2019-09-08 12:55:04,115 INFO L78 Accepts]: Start accepts. Automaton has 16501 states and 23791 transitions. Word has length 165 [2019-09-08 12:55:04,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:04,115 INFO L475 AbstractCegarLoop]: Abstraction has 16501 states and 23791 transitions. [2019-09-08 12:55:04,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:04,116 INFO L276 IsEmpty]: Start isEmpty. Operand 16501 states and 23791 transitions. [2019-09-08 12:55:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:55:04,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:04,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:04,118 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 113259421, now seen corresponding path program 1 times [2019-09-08 12:55:04,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:04,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:04,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:04,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:04,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:55:04,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:55:04,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:55:04,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:04,190 INFO L87 Difference]: Start difference. First operand 16501 states and 23791 transitions. Second operand 3 states. [2019-09-08 12:55:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:30,835 INFO L93 Difference]: Finished difference Result 48273 states and 69397 transitions. [2019-09-08 12:55:30,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:55:30,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 12:55:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:30,863 INFO L225 Difference]: With dead ends: 48273 [2019-09-08 12:55:30,863 INFO L226 Difference]: Without dead ends: 31899 [2019-09-08 12:55:30,875 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 12:55:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31899 states.