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_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:06:23,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:06:23,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:06:23,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:06:23,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:06:23,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:06:23,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:06:23,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:06:23,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:06:23,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:06:23,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:06:23,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:06:23,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:06:23,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:06:23,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:06:23,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:06:23,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:06:23,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:06:23,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:06:23,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:06:23,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:06:23,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:06:23,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:06:23,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:06:23,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:06:23,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:06:23,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:06:23,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:06:23,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:06:23,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:06:23,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:06:23,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:06:23,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:06:23,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:06:23,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:06:23,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:06:23,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:06:23,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:06:23,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:06:23,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:06:23,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:06:23,924 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 13:06:23,938 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:06:23,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:06:23,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:06:23,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:06:23,940 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:06:23,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:06:23,941 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:06:23,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:06:23,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:06:23,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:06:23,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:06:23,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:06:23,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:06:23,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:06:23,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:06:23,942 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:06:23,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:06:23,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:06:23,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:06:23,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:06:23,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:06:23,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:06:23,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:06:23,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:06:23,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:06:23,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:06:23,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:06:23,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:06:23,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:06:23,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:06:23,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:06:23,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:06:23,991 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:06:23,991 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:06:23,992 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:06:24,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed00cbaff/d69d72ec0f374314b76fb7cd8e783553/FLAG6e594230f [2019-09-08 13:06:24,599 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:06:24,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:06:24,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed00cbaff/d69d72ec0f374314b76fb7cd8e783553/FLAG6e594230f [2019-09-08 13:06:24,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed00cbaff/d69d72ec0f374314b76fb7cd8e783553 [2019-09-08 13:06:24,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:06:24,930 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:06:24,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:06:24,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:06:24,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:06:24,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:06:24" (1/1) ... [2019-09-08 13:06:24,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfb2fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:24, skipping insertion in model container [2019-09-08 13:06:24,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:06:24" (1/1) ... [2019-09-08 13:06:24,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:06:25,036 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:06:25,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:06:25,737 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:06:26,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:06:26,290 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:06:26,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26 WrapperNode [2019-09-08 13:06:26,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:06:26,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:06:26,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:06:26,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:06:26,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26" (1/1) ... [2019-09-08 13:06:26,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26" (1/1) ... [2019-09-08 13:06:26,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26" (1/1) ... [2019-09-08 13:06:26,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26" (1/1) ... [2019-09-08 13:06:26,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26" (1/1) ... [2019-09-08 13:06:26,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26" (1/1) ... [2019-09-08 13:06:26,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26" (1/1) ... [2019-09-08 13:06:26,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:06:26,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:06:26,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:06:26,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:06:26,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26" (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 13:06:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:06:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:06:26,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:06:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:06:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:06:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:06:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:06:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:06:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:06:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:06:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:06:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:06:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:06:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:06:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:06:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:06:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:06:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:06:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:06:28,288 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:06:28,288 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:06:28,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:06:28 BoogieIcfgContainer [2019-09-08 13:06:28,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:06:28,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:06:28,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:06:28,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:06:28,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:06:24" (1/3) ... [2019-09-08 13:06:28,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb6cb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:06:28, skipping insertion in model container [2019-09-08 13:06:28,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:06:26" (2/3) ... [2019-09-08 13:06:28,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb6cb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:06:28, skipping insertion in model container [2019-09-08 13:06:28,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:06:28" (3/3) ... [2019-09-08 13:06:28,298 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:06:28,309 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:06:28,318 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-08 13:06:28,335 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-08 13:06:28,378 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:06:28,378 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:06:28,379 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:06:28,380 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:06:28,380 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:06:28,380 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:06:28,380 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:06:28,380 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:06:28,380 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:06:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states. [2019-09-08 13:06:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 13:06:28,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:28,459 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, 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 13:06:28,463 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:28,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1499466548, now seen corresponding path program 1 times [2019-09-08 13:06:28,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:28,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:28,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:28,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:29,283 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 13:06:29,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:29,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:29,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:29,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:29,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:29,308 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 3 states. [2019-09-08 13:06:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:29,522 INFO L93 Difference]: Finished difference Result 785 states and 1373 transitions. [2019-09-08 13:06:29,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:29,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-08 13:06:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:29,554 INFO L225 Difference]: With dead ends: 785 [2019-09-08 13:06:29,554 INFO L226 Difference]: Without dead ends: 616 [2019-09-08 13:06:29,559 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 13:06:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-08 13:06:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-09-08 13:06:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 13:06:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 899 transitions. [2019-09-08 13:06:29,693 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 899 transitions. Word has length 154 [2019-09-08 13:06:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:29,694 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 899 transitions. [2019-09-08 13:06:29,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:29,694 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 899 transitions. [2019-09-08 13:06:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 13:06:29,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:29,699 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, 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 13:06:29,699 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1852158380, now seen corresponding path program 1 times [2019-09-08 13:06:29,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:29,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:29,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:29,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:29,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:29,943 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 13:06:29,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:29,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:29,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:29,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:29,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:29,948 INFO L87 Difference]: Start difference. First operand 614 states and 899 transitions. Second operand 3 states. [2019-09-08 13:06:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:30,129 INFO L93 Difference]: Finished difference Result 1239 states and 1874 transitions. [2019-09-08 13:06:30,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:30,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-08 13:06:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:30,140 INFO L225 Difference]: With dead ends: 1239 [2019-09-08 13:06:30,140 INFO L226 Difference]: Without dead ends: 1016 [2019-09-08 13:06:30,147 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 13:06:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-09-08 13:06:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1014. [2019-09-08 13:06:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-08 13:06:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1511 transitions. [2019-09-08 13:06:30,209 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1511 transitions. Word has length 154 [2019-09-08 13:06:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:30,212 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1511 transitions. [2019-09-08 13:06:30,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1511 transitions. [2019-09-08 13:06:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 13:06:30,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:30,218 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, 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 13:06:30,219 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:30,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1852497004, now seen corresponding path program 1 times [2019-09-08 13:06:30,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:30,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:30,560 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 13:06:30,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:30,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:30,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:30,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:30,564 INFO L87 Difference]: Start difference. First operand 1014 states and 1511 transitions. Second operand 4 states. [2019-09-08 13:06:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:30,771 INFO L93 Difference]: Finished difference Result 2964 states and 4408 transitions. [2019-09-08 13:06:30,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:30,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-08 13:06:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:30,789 INFO L225 Difference]: With dead ends: 2964 [2019-09-08 13:06:30,789 INFO L226 Difference]: Without dead ends: 1963 [2019-09-08 13:06:30,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-09-08 13:06:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1921. [2019-09-08 13:06:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2019-09-08 13:06:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2849 transitions. [2019-09-08 13:06:30,883 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2849 transitions. Word has length 154 [2019-09-08 13:06:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:30,884 INFO L475 AbstractCegarLoop]: Abstraction has 1921 states and 2849 transitions. [2019-09-08 13:06:30,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2849 transitions. [2019-09-08 13:06:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 13:06:30,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:30,888 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, 1, 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 13:06:30,889 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:30,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:30,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1278337866, now seen corresponding path program 1 times [2019-09-08 13:06:30,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:30,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:30,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:30,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:30,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:30,970 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 13:06:30,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:30,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:30,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:30,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:30,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:30,972 INFO L87 Difference]: Start difference. First operand 1921 states and 2849 transitions. Second operand 3 states. [2019-09-08 13:06:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:31,167 INFO L93 Difference]: Finished difference Result 5717 states and 8477 transitions. [2019-09-08 13:06:31,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:31,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 13:06:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:31,198 INFO L225 Difference]: With dead ends: 5717 [2019-09-08 13:06:31,198 INFO L226 Difference]: Without dead ends: 3828 [2019-09-08 13:06:31,206 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 13:06:31,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2019-09-08 13:06:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 1923. [2019-09-08 13:06:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-09-08 13:06:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2851 transitions. [2019-09-08 13:06:31,425 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2851 transitions. Word has length 155 [2019-09-08 13:06:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:31,426 INFO L475 AbstractCegarLoop]: Abstraction has 1923 states and 2851 transitions. [2019-09-08 13:06:31,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2851 transitions. [2019-09-08 13:06:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 13:06:31,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:31,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:31,436 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1949044653, now seen corresponding path program 1 times [2019-09-08 13:06:31,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:31,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:31,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:31,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:31,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:31,704 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 13:06:31,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:31,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:31,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:31,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:31,707 INFO L87 Difference]: Start difference. First operand 1923 states and 2851 transitions. Second operand 3 states. [2019-09-08 13:06:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:32,062 INFO L93 Difference]: Finished difference Result 5448 states and 8080 transitions. [2019-09-08 13:06:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:32,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 13:06:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:32,090 INFO L225 Difference]: With dead ends: 5448 [2019-09-08 13:06:32,091 INFO L226 Difference]: Without dead ends: 3722 [2019-09-08 13:06:32,099 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 13:06:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-08 13:06:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3680. [2019-09-08 13:06:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-09-08 13:06:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5416 transitions. [2019-09-08 13:06:32,371 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5416 transitions. Word has length 156 [2019-09-08 13:06:32,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:32,371 INFO L475 AbstractCegarLoop]: Abstraction has 3680 states and 5416 transitions. [2019-09-08 13:06:32,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5416 transitions. [2019-09-08 13:06:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 13:06:32,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:32,380 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, 1, 1, 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 13:06:32,380 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:32,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1948951408, now seen corresponding path program 1 times [2019-09-08 13:06:32,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:32,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:32,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:32,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:32,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:32,649 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 13:06:32,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:32,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:32,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:32,651 INFO L87 Difference]: Start difference. First operand 3680 states and 5416 transitions. Second operand 4 states. [2019-09-08 13:06:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:32,841 INFO L93 Difference]: Finished difference Result 6321 states and 9312 transitions. [2019-09-08 13:06:32,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:32,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-08 13:06:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:32,856 INFO L225 Difference]: With dead ends: 6321 [2019-09-08 13:06:32,857 INFO L226 Difference]: Without dead ends: 2826 [2019-09-08 13:06:32,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-09-08 13:06:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2826. [2019-09-08 13:06:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2019-09-08 13:06:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4145 transitions. [2019-09-08 13:06:33,025 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4145 transitions. Word has length 156 [2019-09-08 13:06:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:33,026 INFO L475 AbstractCegarLoop]: Abstraction has 2826 states and 4145 transitions. [2019-09-08 13:06:33,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4145 transitions. [2019-09-08 13:06:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 13:06:33,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:33,039 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:33,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1917490942, now seen corresponding path program 1 times [2019-09-08 13:06:33,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:33,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:33,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:33,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:06:33,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:33,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:33,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:33,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:33,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:33,151 INFO L87 Difference]: Start difference. First operand 2826 states and 4145 transitions. Second operand 3 states. [2019-09-08 13:06:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:33,441 INFO L93 Difference]: Finished difference Result 7004 states and 10460 transitions. [2019-09-08 13:06:33,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:33,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 13:06:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:33,466 INFO L225 Difference]: With dead ends: 7004 [2019-09-08 13:06:33,467 INFO L226 Difference]: Without dead ends: 4364 [2019-09-08 13:06:33,474 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 13:06:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4364 states. [2019-09-08 13:06:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4364 to 3710. [2019-09-08 13:06:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2019-09-08 13:06:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5586 transitions. [2019-09-08 13:06:33,678 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5586 transitions. Word has length 158 [2019-09-08 13:06:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:33,679 INFO L475 AbstractCegarLoop]: Abstraction has 3710 states and 5586 transitions. [2019-09-08 13:06:33,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5586 transitions. [2019-09-08 13:06:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 13:06:33,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:33,685 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, 1, 1, 1, 1, 1, 1, 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 13:06:33,685 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:33,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash -473203751, now seen corresponding path program 1 times [2019-09-08 13:06:33,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:33,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:33,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:33,778 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 13:06:33,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:33,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:33,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:33,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:33,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:33,780 INFO L87 Difference]: Start difference. First operand 3710 states and 5586 transitions. Second operand 3 states. [2019-09-08 13:06:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:34,304 INFO L93 Difference]: Finished difference Result 9364 states and 14337 transitions. [2019-09-08 13:06:34,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:34,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 13:06:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:34,344 INFO L225 Difference]: With dead ends: 9364 [2019-09-08 13:06:34,344 INFO L226 Difference]: Without dead ends: 5924 [2019-09-08 13:06:34,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5924 states. [2019-09-08 13:06:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5924 to 5266. [2019-09-08 13:06:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5266 states. [2019-09-08 13:06:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5266 states to 5266 states and 8111 transitions. [2019-09-08 13:06:34,840 INFO L78 Accepts]: Start accepts. Automaton has 5266 states and 8111 transitions. Word has length 160 [2019-09-08 13:06:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:34,840 INFO L475 AbstractCegarLoop]: Abstraction has 5266 states and 8111 transitions. [2019-09-08 13:06:34,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 5266 states and 8111 transitions. [2019-09-08 13:06:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 13:06:34,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:34,850 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, 1, 1, 1, 1, 1, 1, 1, 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 13:06:34,851 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:34,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash 68772030, now seen corresponding path program 1 times [2019-09-08 13:06:34,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:34,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:34,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:34,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:34,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:35,061 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 13:06:35,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:35,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:06:35,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:06:35,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:06:35,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:35,063 INFO L87 Difference]: Start difference. First operand 5266 states and 8111 transitions. Second operand 5 states. [2019-09-08 13:06:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:35,746 INFO L93 Difference]: Finished difference Result 10352 states and 15994 transitions. [2019-09-08 13:06:35,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:06:35,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 13:06:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:35,770 INFO L225 Difference]: With dead ends: 10352 [2019-09-08 13:06:35,770 INFO L226 Difference]: Without dead ends: 5266 [2019-09-08 13:06:35,782 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 13:06:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2019-09-08 13:06:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 5266. [2019-09-08 13:06:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5266 states. [2019-09-08 13:06:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5266 states to 5266 states and 8046 transitions. [2019-09-08 13:06:36,214 INFO L78 Accepts]: Start accepts. Automaton has 5266 states and 8046 transitions. Word has length 161 [2019-09-08 13:06:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:36,214 INFO L475 AbstractCegarLoop]: Abstraction has 5266 states and 8046 transitions. [2019-09-08 13:06:36,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:06:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5266 states and 8046 transitions. [2019-09-08 13:06:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 13:06:36,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:36,221 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, 1, 1, 1, 1, 1, 1, 1, 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 13:06:36,222 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash -901806941, now seen corresponding path program 1 times [2019-09-08 13:06:36,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:36,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:36,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:36,591 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 13:06:36,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:36,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:06:36,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:06:36,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:06:36,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:06:36,593 INFO L87 Difference]: Start difference. First operand 5266 states and 8046 transitions. Second operand 9 states. [2019-09-08 13:06:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:40,058 INFO L93 Difference]: Finished difference Result 26964 states and 41821 transitions. [2019-09-08 13:06:40,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:06:40,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-09-08 13:06:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:40,130 INFO L225 Difference]: With dead ends: 26964 [2019-09-08 13:06:40,130 INFO L226 Difference]: Without dead ends: 21917 [2019-09-08 13:06:40,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:06:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21917 states. [2019-09-08 13:06:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21917 to 14238. [2019-09-08 13:06:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14238 states. [2019-09-08 13:06:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14238 states to 14238 states and 21636 transitions. [2019-09-08 13:06:41,393 INFO L78 Accepts]: Start accepts. Automaton has 14238 states and 21636 transitions. Word has length 161 [2019-09-08 13:06:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:41,393 INFO L475 AbstractCegarLoop]: Abstraction has 14238 states and 21636 transitions. [2019-09-08 13:06:41,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:06:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14238 states and 21636 transitions. [2019-09-08 13:06:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 13:06:41,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:41,404 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, 1, 1, 1, 1, 1, 1, 1, 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 13:06:41,405 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:41,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:41,405 INFO L82 PathProgramCache]: Analyzing trace with hash -590735011, now seen corresponding path program 1 times [2019-09-08 13:06:41,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:41,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:41,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:41,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:41,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:41,583 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 13:06:41,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:41,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:41,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:41,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:41,585 INFO L87 Difference]: Start difference. First operand 14238 states and 21636 transitions. Second operand 4 states. [2019-09-08 13:06:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:42,726 INFO L93 Difference]: Finished difference Result 28035 states and 43597 transitions. [2019-09-08 13:06:42,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:42,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 13:06:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:42,771 INFO L225 Difference]: With dead ends: 28035 [2019-09-08 13:06:42,772 INFO L226 Difference]: Without dead ends: 17550 [2019-09-08 13:06:42,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 13:06:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17550 states. [2019-09-08 13:06:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17550 to 17548. [2019-09-08 13:06:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17548 states. [2019-09-08 13:06:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17548 states to 17548 states and 26780 transitions. [2019-09-08 13:06:44,502 INFO L78 Accepts]: Start accepts. Automaton has 17548 states and 26780 transitions. Word has length 161 [2019-09-08 13:06:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:44,503 INFO L475 AbstractCegarLoop]: Abstraction has 17548 states and 26780 transitions. [2019-09-08 13:06:44,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 17548 states and 26780 transitions. [2019-09-08 13:06:44,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 13:06:44,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:44,513 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, 1, 1, 1, 1, 1, 1, 1, 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 13:06:44,513 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1126058457, now seen corresponding path program 1 times [2019-09-08 13:06:44,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:44,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:44,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:44,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:44,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:44,703 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 13:06:44,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:44,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:44,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:44,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:44,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:44,705 INFO L87 Difference]: Start difference. First operand 17548 states and 26780 transitions. Second operand 4 states. [2019-09-08 13:06:46,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:46,249 INFO L93 Difference]: Finished difference Result 46392 states and 70766 transitions. [2019-09-08 13:06:46,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:46,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 13:06:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:46,325 INFO L225 Difference]: With dead ends: 46392 [2019-09-08 13:06:46,326 INFO L226 Difference]: Without dead ends: 28867 [2019-09-08 13:06:46,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28867 states. [2019-09-08 13:06:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28867 to 28833. [2019-09-08 13:06:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28833 states. [2019-09-08 13:06:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28833 states to 28833 states and 43595 transitions. [2019-09-08 13:06:47,947 INFO L78 Accepts]: Start accepts. Automaton has 28833 states and 43595 transitions. Word has length 161 [2019-09-08 13:06:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:47,948 INFO L475 AbstractCegarLoop]: Abstraction has 28833 states and 43595 transitions. [2019-09-08 13:06:47,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 28833 states and 43595 transitions. [2019-09-08 13:06:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 13:06:47,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:47,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:47,962 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:47,963 INFO L82 PathProgramCache]: Analyzing trace with hash -669020024, now seen corresponding path program 1 times [2019-09-08 13:06:47,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:47,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:47,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:48,061 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 13:06:48,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:48,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:48,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:48,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:48,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:48,063 INFO L87 Difference]: Start difference. First operand 28833 states and 43595 transitions. Second operand 3 states. [2019-09-08 13:06:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:51,035 INFO L93 Difference]: Finished difference Result 77808 states and 117631 transitions. [2019-09-08 13:06:51,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:51,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-08 13:06:51,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:51,124 INFO L225 Difference]: With dead ends: 77808 [2019-09-08 13:06:51,124 INFO L226 Difference]: Without dead ends: 49371 [2019-09-08 13:06:51,164 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 13:06:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49371 states. [2019-09-08 13:06:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49371 to 49341. [2019-09-08 13:06:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49341 states. [2019-09-08 13:06:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49341 states to 49341 states and 73917 transitions. [2019-09-08 13:06:53,505 INFO L78 Accepts]: Start accepts. Automaton has 49341 states and 73917 transitions. Word has length 163 [2019-09-08 13:06:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:53,505 INFO L475 AbstractCegarLoop]: Abstraction has 49341 states and 73917 transitions. [2019-09-08 13:06:53,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 49341 states and 73917 transitions. [2019-09-08 13:06:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 13:06:53,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:53,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:53,541 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:53,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1518159755, now seen corresponding path program 1 times [2019-09-08 13:06:53,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:53,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:53,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:53,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:53,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:53,681 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 13:06:53,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:53,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:53,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:53,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:53,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:53,683 INFO L87 Difference]: Start difference. First operand 49341 states and 73917 transitions. Second operand 4 states. [2019-09-08 13:06:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:56,945 INFO L93 Difference]: Finished difference Result 83872 states and 125457 transitions. [2019-09-08 13:06:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:56,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-08 13:06:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:57,018 INFO L225 Difference]: With dead ends: 83872 [2019-09-08 13:06:57,018 INFO L226 Difference]: Without dead ends: 45048 [2019-09-08 13:06:57,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45048 states. [2019-09-08 13:06:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45048 to 45048. [2019-09-08 13:06:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45048 states. [2019-09-08 13:06:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45048 states to 45048 states and 67463 transitions. [2019-09-08 13:06:59,013 INFO L78 Accepts]: Start accepts. Automaton has 45048 states and 67463 transitions. Word has length 163 [2019-09-08 13:06:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:59,013 INFO L475 AbstractCegarLoop]: Abstraction has 45048 states and 67463 transitions. [2019-09-08 13:06:59,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 45048 states and 67463 transitions. [2019-09-08 13:06:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 13:06:59,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:59,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:59,032 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash 42041699, now seen corresponding path program 1 times [2019-09-08 13:06:59,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:59,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:59,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:59,117 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 13:06:59,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:59,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:59,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:59,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:59,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:59,119 INFO L87 Difference]: Start difference. First operand 45048 states and 67463 transitions. Second operand 3 states. [2019-09-08 13:07:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:02,354 INFO L93 Difference]: Finished difference Result 121206 states and 183395 transitions. [2019-09-08 13:07:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:02,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 13:07:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:02,487 INFO L225 Difference]: With dead ends: 121206 [2019-09-08 13:07:02,487 INFO L226 Difference]: Without dead ends: 76494 [2019-09-08 13:07:02,552 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 13:07:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76494 states. [2019-09-08 13:07:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76494 to 69304. [2019-09-08 13:07:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69304 states. [2019-09-08 13:07:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69304 states to 69304 states and 105758 transitions. [2019-09-08 13:07:07,417 INFO L78 Accepts]: Start accepts. Automaton has 69304 states and 105758 transitions. Word has length 167 [2019-09-08 13:07:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:07,417 INFO L475 AbstractCegarLoop]: Abstraction has 69304 states and 105758 transitions. [2019-09-08 13:07:07,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:07,418 INFO L276 IsEmpty]: Start isEmpty. Operand 69304 states and 105758 transitions. [2019-09-08 13:07:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:07:07,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:07,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:07,437 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1492969945, now seen corresponding path program 1 times [2019-09-08 13:07:07,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:07,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:07,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:07,591 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 13:07:07,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:07,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:07,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:07,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:07,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:07,593 INFO L87 Difference]: Start difference. First operand 69304 states and 105758 transitions. Second operand 4 states. [2019-09-08 13:07:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:10,938 INFO L93 Difference]: Finished difference Result 121352 states and 187153 transitions. [2019-09-08 13:07:10,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:10,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 13:07:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:11,031 INFO L225 Difference]: With dead ends: 121352 [2019-09-08 13:07:11,031 INFO L226 Difference]: Without dead ends: 61418 [2019-09-08 13:07:11,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 13:07:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61418 states. [2019-09-08 13:07:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61418 to 61416. [2019-09-08 13:07:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61416 states. [2019-09-08 13:07:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61416 states to 61416 states and 93025 transitions. [2019-09-08 13:07:15,795 INFO L78 Accepts]: Start accepts. Automaton has 61416 states and 93025 transitions. Word has length 168 [2019-09-08 13:07:15,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:15,796 INFO L475 AbstractCegarLoop]: Abstraction has 61416 states and 93025 transitions. [2019-09-08 13:07:15,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand 61416 states and 93025 transitions. [2019-09-08 13:07:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:07:15,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:15,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:15,809 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1315780074, now seen corresponding path program 1 times [2019-09-08 13:07:15,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:15,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:15,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:15,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:15,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:15,971 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 13:07:15,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:15,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:15,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:15,973 INFO L87 Difference]: Start difference. First operand 61416 states and 93025 transitions. Second operand 4 states. [2019-09-08 13:07:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:21,991 INFO L93 Difference]: Finished difference Result 173357 states and 262250 transitions. [2019-09-08 13:07:21,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:21,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 13:07:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:22,199 INFO L225 Difference]: With dead ends: 173357 [2019-09-08 13:07:22,199 INFO L226 Difference]: Without dead ends: 111984 [2019-09-08 13:07:22,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111984 states. [2019-09-08 13:07:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111984 to 111926. [2019-09-08 13:07:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111926 states. [2019-09-08 13:07:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111926 states to 111926 states and 167862 transitions. [2019-09-08 13:07:29,913 INFO L78 Accepts]: Start accepts. Automaton has 111926 states and 167862 transitions. Word has length 168 [2019-09-08 13:07:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:29,913 INFO L475 AbstractCegarLoop]: Abstraction has 111926 states and 167862 transitions. [2019-09-08 13:07:29,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 111926 states and 167862 transitions. [2019-09-08 13:07:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 13:07:29,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:29,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:29,932 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:29,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:29,933 INFO L82 PathProgramCache]: Analyzing trace with hash -74725554, now seen corresponding path program 1 times [2019-09-08 13:07:29,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:29,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:29,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:29,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:29,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:30,417 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 13:07:30,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:30,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:30,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:30,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:30,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:30,418 INFO L87 Difference]: Start difference. First operand 111926 states and 167862 transitions. Second operand 3 states. [2019-09-08 13:07:43,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:43,014 INFO L93 Difference]: Finished difference Result 335578 states and 503331 transitions. [2019-09-08 13:07:43,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:43,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 13:07:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:43,342 INFO L225 Difference]: With dead ends: 335578 [2019-09-08 13:07:43,343 INFO L226 Difference]: Without dead ends: 223761 [2019-09-08 13:07:43,434 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 13:07:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223761 states. [2019-09-08 13:07:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223761 to 111932. [2019-09-08 13:07:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111932 states. [2019-09-08 13:07:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111932 states to 111932 states and 167868 transitions. [2019-09-08 13:07:50,790 INFO L78 Accepts]: Start accepts. Automaton has 111932 states and 167868 transitions. Word has length 169 [2019-09-08 13:07:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:50,791 INFO L475 AbstractCegarLoop]: Abstraction has 111932 states and 167868 transitions. [2019-09-08 13:07:50,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 111932 states and 167868 transitions. [2019-09-08 13:07:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:07:50,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:50,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:50,805 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1534467413, now seen corresponding path program 1 times [2019-09-08 13:07:50,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:50,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:50,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:50,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:50,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:50,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 13:07:50,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:50,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:50,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:50,950 INFO L87 Difference]: Start difference. First operand 111932 states and 167868 transitions. Second operand 4 states. [2019-09-08 13:07:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:58,624 INFO L93 Difference]: Finished difference Result 223753 states and 335595 transitions. [2019-09-08 13:07:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:58,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-08 13:07:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:58,790 INFO L225 Difference]: With dead ends: 223753 [2019-09-08 13:07:58,790 INFO L226 Difference]: Without dead ends: 111932 [2019-09-08 13:07:58,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111932 states. [2019-09-08 13:08:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111932 to 111929. [2019-09-08 13:08:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111929 states. [2019-09-08 13:08:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111929 states to 111929 states and 167861 transitions. [2019-09-08 13:08:05,606 INFO L78 Accepts]: Start accepts. Automaton has 111929 states and 167861 transitions. Word has length 170 [2019-09-08 13:08:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:05,606 INFO L475 AbstractCegarLoop]: Abstraction has 111929 states and 167861 transitions. [2019-09-08 13:08:05,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 111929 states and 167861 transitions. [2019-09-08 13:08:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:08:05,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:05,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:05,626 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash 86168618, now seen corresponding path program 1 times [2019-09-08 13:08:05,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:05,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:05,783 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 13:08:05,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:05,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:05,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:05,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:05,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:05,786 INFO L87 Difference]: Start difference. First operand 111929 states and 167861 transitions. Second operand 4 states. [2019-09-08 13:08:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:14,159 INFO L93 Difference]: Finished difference Result 223815 states and 335663 transitions. [2019-09-08 13:08:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:14,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-08 13:08:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:14,331 INFO L225 Difference]: With dead ends: 223815 [2019-09-08 13:08:14,331 INFO L226 Difference]: Without dead ends: 111923 [2019-09-08 13:08:14,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:08:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111923 states. [2019-09-08 13:08:20,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111923 to 111923. [2019-09-08 13:08:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111923 states. [2019-09-08 13:08:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111923 states to 111923 states and 167849 transitions. [2019-09-08 13:08:21,094 INFO L78 Accepts]: Start accepts. Automaton has 111923 states and 167849 transitions. Word has length 170 [2019-09-08 13:08:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:21,094 INFO L475 AbstractCegarLoop]: Abstraction has 111923 states and 167849 transitions. [2019-09-08 13:08:21,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 111923 states and 167849 transitions. [2019-09-08 13:08:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:08:21,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:21,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:21,115 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1231528269, now seen corresponding path program 1 times [2019-09-08 13:08:21,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:21,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:21,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:21,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:21,208 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 13:08:21,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:21,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:21,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:21,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:21,210 INFO L87 Difference]: Start difference. First operand 111923 states and 167849 transitions. Second operand 3 states. [2019-09-08 13:08:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:31,861 INFO L93 Difference]: Finished difference Result 272373 states and 407564 transitions. [2019-09-08 13:08:31,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:31,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 13:08:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:32,098 INFO L225 Difference]: With dead ends: 272373 [2019-09-08 13:08:32,098 INFO L226 Difference]: Without dead ends: 161191 [2019-09-08 13:08:32,182 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 13:08:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161191 states. [2019-09-08 13:08:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161191 to 161133. [2019-09-08 13:08:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161133 states. [2019-09-08 13:08:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161133 states to 161133 states and 237848 transitions. [2019-09-08 13:08:42,543 INFO L78 Accepts]: Start accepts. Automaton has 161133 states and 237848 transitions. Word has length 170 [2019-09-08 13:08:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:42,543 INFO L475 AbstractCegarLoop]: Abstraction has 161133 states and 237848 transitions. [2019-09-08 13:08:42,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 161133 states and 237848 transitions. [2019-09-08 13:08:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:08:42,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:42,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:42,564 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 904934381, now seen corresponding path program 1 times [2019-09-08 13:08:42,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:42,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:42,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:42,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:42,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:42,669 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 13:08:42,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:42,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:42,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:42,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:42,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:42,671 INFO L87 Difference]: Start difference. First operand 161133 states and 237848 transitions. Second operand 4 states. [2019-09-08 13:08:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:57,345 INFO L93 Difference]: Finished difference Result 287627 states and 426628 transitions. [2019-09-08 13:08:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:57,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 13:08:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:57,711 INFO L225 Difference]: With dead ends: 287627 [2019-09-08 13:08:57,712 INFO L226 Difference]: Without dead ends: 222762 [2019-09-08 13:08:57,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:08:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222762 states. [2019-09-08 13:09:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222762 to 160949. [2019-09-08 13:09:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160949 states. [2019-09-08 13:09:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160949 states to 160949 states and 237404 transitions. [2019-09-08 13:09:08,761 INFO L78 Accepts]: Start accepts. Automaton has 160949 states and 237404 transitions. Word has length 175 [2019-09-08 13:09:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:08,762 INFO L475 AbstractCegarLoop]: Abstraction has 160949 states and 237404 transitions. [2019-09-08 13:09:08,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 160949 states and 237404 transitions. [2019-09-08 13:09:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:09:08,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:08,787 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1101316072, now seen corresponding path program 1 times [2019-09-08 13:09:08,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:08,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:08,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:08,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:08,956 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 13:09:08,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:08,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:09:08,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:09:08,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:09:08,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:09:08,958 INFO L87 Difference]: Start difference. First operand 160949 states and 237404 transitions. Second operand 8 states. [2019-09-08 13:09:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:39,371 INFO L93 Difference]: Finished difference Result 518577 states and 766419 transitions. [2019-09-08 13:09:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:09:39,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-09-08 13:09:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:40,222 INFO L225 Difference]: With dead ends: 518577 [2019-09-08 13:09:40,222 INFO L226 Difference]: Without dead ends: 419077 [2019-09-08 13:09:40,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:09:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419077 states. [2019-09-08 13:10:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419077 to 187921. [2019-09-08 13:10:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187921 states. [2019-09-08 13:10:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187921 states to 187921 states and 278916 transitions. [2019-09-08 13:10:01,848 INFO L78 Accepts]: Start accepts. Automaton has 187921 states and 278916 transitions. Word has length 175 [2019-09-08 13:10:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:01,848 INFO L475 AbstractCegarLoop]: Abstraction has 187921 states and 278916 transitions. [2019-09-08 13:10:01,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:10:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 187921 states and 278916 transitions. [2019-09-08 13:10:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:10:01,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:01,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:01,884 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1292977437, now seen corresponding path program 1 times [2019-09-08 13:10:01,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:01,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:01,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:01,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:01,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:10:02,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:02,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:10:02,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:10:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:10:02,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:02,154 INFO L87 Difference]: Start difference. First operand 187921 states and 278916 transitions. Second operand 4 states. [2019-09-08 13:10:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:17,958 INFO L93 Difference]: Finished difference Result 312795 states and 464249 transitions. [2019-09-08 13:10:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:17,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 13:10:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:18,205 INFO L225 Difference]: With dead ends: 312795 [2019-09-08 13:10:18,206 INFO L226 Difference]: Without dead ends: 174409 [2019-09-08 13:10:18,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:10:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174409 states. [2019-09-08 13:10:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174409 to 174339. [2019-09-08 13:10:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174339 states. [2019-09-08 13:10:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174339 states to 174339 states and 258879 transitions. [2019-09-08 13:10:31,804 INFO L78 Accepts]: Start accepts. Automaton has 174339 states and 258879 transitions. Word has length 175 [2019-09-08 13:10:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:31,804 INFO L475 AbstractCegarLoop]: Abstraction has 174339 states and 258879 transitions. [2019-09-08 13:10:31,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 174339 states and 258879 transitions. [2019-09-08 13:10:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 13:10:31,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:31,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:31,826 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:31,826 INFO L82 PathProgramCache]: Analyzing trace with hash -837566264, now seen corresponding path program 1 times [2019-09-08 13:10:31,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:31,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:31,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:31,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:31,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:32,060 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 13:10:32,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:32,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:10:32,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:10:32,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:10:32,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:32,063 INFO L87 Difference]: Start difference. First operand 174339 states and 258879 transitions. Second operand 4 states. [2019-09-08 13:10:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:47,635 INFO L93 Difference]: Finished difference Result 348739 states and 517816 transitions. [2019-09-08 13:10:47,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:47,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-08 13:10:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:47,946 INFO L225 Difference]: With dead ends: 348739 [2019-09-08 13:10:47,947 INFO L226 Difference]: Without dead ends: 174559 [2019-09-08 13:10:48,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:10:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174559 states. [2019-09-08 13:11:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174559 to 174441. [2019-09-08 13:11:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174441 states. [2019-09-08 13:11:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174441 states to 174441 states and 258979 transitions. [2019-09-08 13:11:06,600 INFO L78 Accepts]: Start accepts. Automaton has 174441 states and 258979 transitions. Word has length 177 [2019-09-08 13:11:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:06,600 INFO L475 AbstractCegarLoop]: Abstraction has 174441 states and 258979 transitions. [2019-09-08 13:11:06,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:11:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 174441 states and 258979 transitions. [2019-09-08 13:11:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:11:06,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:06,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:06,622 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:06,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:06,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1142204644, now seen corresponding path program 1 times [2019-09-08 13:11:06,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:06,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:06,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:06,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:06,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:06,689 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 13:11:06,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:06,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:11:06,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:11:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:11:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:11:06,691 INFO L87 Difference]: Start difference. First operand 174441 states and 258979 transitions. Second operand 3 states. [2019-09-08 13:11:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:34,047 INFO L93 Difference]: Finished difference Result 485635 states and 721192 transitions. [2019-09-08 13:11:34,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:11:34,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 13:11:34,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:34,604 INFO L225 Difference]: With dead ends: 485635 [2019-09-08 13:11:34,604 INFO L226 Difference]: Without dead ends: 348671 [2019-09-08 13:11:34,741 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 13:11:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348671 states. [2019-09-08 13:11:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348671 to 174451. [2019-09-08 13:11:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174451 states. [2019-09-08 13:11:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174451 states to 174451 states and 258989 transitions. [2019-09-08 13:11:56,678 INFO L78 Accepts]: Start accepts. Automaton has 174451 states and 258989 transitions. Word has length 178 [2019-09-08 13:11:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:56,678 INFO L475 AbstractCegarLoop]: Abstraction has 174451 states and 258989 transitions. [2019-09-08 13:11:56,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:11:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 174451 states and 258989 transitions. [2019-09-08 13:11:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:11:56,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:56,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:56,698 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:56,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:56,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1172365455, now seen corresponding path program 1 times [2019-09-08 13:11:56,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:56,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:56,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:56,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:56,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:11:56,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:56,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:11:56,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:11:56,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:11:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:11:56,817 INFO L87 Difference]: Start difference. First operand 174451 states and 258989 transitions. Second operand 4 states. [2019-09-08 13:12:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:19,237 INFO L93 Difference]: Finished difference Result 346454 states and 520195 transitions. [2019-09-08 13:12:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:12:19,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-08 13:12:19,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:19,669 INFO L225 Difference]: With dead ends: 346454 [2019-09-08 13:12:19,669 INFO L226 Difference]: Without dead ends: 262093 [2019-09-08 13:12:19,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:12:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262093 states. [2019-09-08 13:12:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262093 to 174311. [2019-09-08 13:12:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174311 states. [2019-09-08 13:12:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174311 states to 174311 states and 258637 transitions. [2019-09-08 13:12:39,488 INFO L78 Accepts]: Start accepts. Automaton has 174311 states and 258637 transitions. Word has length 179 [2019-09-08 13:12:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:39,488 INFO L475 AbstractCegarLoop]: Abstraction has 174311 states and 258637 transitions. [2019-09-08 13:12:39,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:12:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 174311 states and 258637 transitions. [2019-09-08 13:12:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:12:39,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:39,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:39,509 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2064185023, now seen corresponding path program 1 times [2019-09-08 13:12:39,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:39,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:39,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:39,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:39,653 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 13:12:39,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:39,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:12:39,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:12:39,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:12:39,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:12:39,655 INFO L87 Difference]: Start difference. First operand 174311 states and 258637 transitions. Second operand 5 states. [2019-09-08 13:12:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:56,466 INFO L93 Difference]: Finished difference Result 331222 states and 492086 transitions. [2019-09-08 13:12:56,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:12:56,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-09-08 13:12:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:56,762 INFO L225 Difference]: With dead ends: 331222 [2019-09-08 13:12:56,762 INFO L226 Difference]: Without dead ends: 174313 [2019-09-08 13:12:56,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:12:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174313 states. [2019-09-08 13:13:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174313 to 174311. [2019-09-08 13:13:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174311 states. [2019-09-08 13:13:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174311 states to 174311 states and 257713 transitions. [2019-09-08 13:13:16,105 INFO L78 Accepts]: Start accepts. Automaton has 174311 states and 257713 transitions. Word has length 179 [2019-09-08 13:13:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:16,105 INFO L475 AbstractCegarLoop]: Abstraction has 174311 states and 257713 transitions. [2019-09-08 13:13:16,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:13:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 174311 states and 257713 transitions. [2019-09-08 13:13:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:13:16,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:16,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:13:16,127 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:16,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1768561050, now seen corresponding path program 1 times [2019-09-08 13:13:16,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:16,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:16,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:16,313 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 13:13:16,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:16,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:13:16,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:13:16,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:13:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:13:16,314 INFO L87 Difference]: Start difference. First operand 174311 states and 257713 transitions. Second operand 8 states. [2019-09-08 13:14:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:03,475 INFO L93 Difference]: Finished difference Result 540336 states and 793385 transitions. [2019-09-08 13:14:03,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:14:03,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-09-08 13:14:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:04,376 INFO L225 Difference]: With dead ends: 540336 [2019-09-08 13:14:04,376 INFO L226 Difference]: Without dead ends: 473071 [2019-09-08 13:14:04,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:14:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473071 states. [2019-09-08 13:14:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473071 to 131795. [2019-09-08 13:14:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131795 states. [2019-09-08 13:14:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131795 states to 131795 states and 190751 transitions. [2019-09-08 13:14:27,920 INFO L78 Accepts]: Start accepts. Automaton has 131795 states and 190751 transitions. Word has length 179 [2019-09-08 13:14:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:27,920 INFO L475 AbstractCegarLoop]: Abstraction has 131795 states and 190751 transitions. [2019-09-08 13:14:27,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:14:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 131795 states and 190751 transitions. [2019-09-08 13:14:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:14:27,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:27,945 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash 313385232, now seen corresponding path program 1 times [2019-09-08 13:14:27,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:27,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:27,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:27,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:27,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:28,526 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 13:14:28,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:28,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:28,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:28,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:28,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:28,528 INFO L87 Difference]: Start difference. First operand 131795 states and 190751 transitions. Second operand 4 states. [2019-09-08 13:14:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:44,871 INFO L93 Difference]: Finished difference Result 263775 states and 381688 transitions. [2019-09-08 13:14:44,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:14:44,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-08 13:14:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:45,072 INFO L225 Difference]: With dead ends: 263775 [2019-09-08 13:14:45,072 INFO L226 Difference]: Without dead ends: 132254 [2019-09-08 13:14:45,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:14:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132254 states. [2019-09-08 13:14:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132254 to 132041. [2019-09-08 13:14:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132041 states. [2019-09-08 13:14:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132041 states to 132041 states and 190997 transitions. [2019-09-08 13:14:59,597 INFO L78 Accepts]: Start accepts. Automaton has 132041 states and 190997 transitions. Word has length 179 [2019-09-08 13:14:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:59,597 INFO L475 AbstractCegarLoop]: Abstraction has 132041 states and 190997 transitions. [2019-09-08 13:14:59,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:14:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 132041 states and 190997 transitions. [2019-09-08 13:14:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:14:59,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:59,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:59,620 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:59,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:59,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1060941927, now seen corresponding path program 1 times [2019-09-08 13:14:59,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:59,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:59,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:59,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:59,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:59,735 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 13:14:59,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:59,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:59,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:59,737 INFO L87 Difference]: Start difference. First operand 132041 states and 190997 transitions. Second operand 4 states. [2019-09-08 13:15:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:14,490 INFO L93 Difference]: Finished difference Result 203216 states and 293794 transitions. [2019-09-08 13:15:14,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:14,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-08 13:15:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:14,650 INFO L225 Difference]: With dead ends: 203216 [2019-09-08 13:15:14,651 INFO L226 Difference]: Without dead ends: 118339 [2019-09-08 13:15:14,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:15:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118339 states. [2019-09-08 13:15:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118339 to 118339. [2019-09-08 13:15:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118339 states. [2019-09-08 13:15:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118339 states to 118339 states and 171444 transitions. [2019-09-08 13:15:31,489 INFO L78 Accepts]: Start accepts. Automaton has 118339 states and 171444 transitions. Word has length 179 [2019-09-08 13:15:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:31,489 INFO L475 AbstractCegarLoop]: Abstraction has 118339 states and 171444 transitions. [2019-09-08 13:15:31,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 118339 states and 171444 transitions. [2019-09-08 13:15:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:15:31,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:31,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:15:31,510 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:31,511 INFO L82 PathProgramCache]: Analyzing trace with hash 501529733, now seen corresponding path program 1 times [2019-09-08 13:15:31,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:31,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:31,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:33,324 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 13:15:33,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:33,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 13:15:33,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 13:15:33,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 13:15:33,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:15:33,325 INFO L87 Difference]: Start difference. First operand 118339 states and 171444 transitions. Second operand 21 states. [2019-09-08 13:15:34,248 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-08 13:15:34,423 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 13:15:34,779 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 13:15:35,037 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-08 13:15:35,204 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-08 13:15:35,391 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-08 13:15:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:52,500 INFO L93 Difference]: Finished difference Result 184628 states and 269501 transitions. [2019-09-08 13:15:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 13:15:52,500 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 181 [2019-09-08 13:15:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:52,691 INFO L225 Difference]: With dead ends: 184628 [2019-09-08 13:15:52,692 INFO L226 Difference]: Without dead ends: 121823 [2019-09-08 13:15:52,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 13:15:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121823 states. [2019-09-08 13:16:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121823 to 119058. [2019-09-08 13:16:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119058 states. [2019-09-08 13:16:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119058 states to 119058 states and 172282 transitions. [2019-09-08 13:16:06,835 INFO L78 Accepts]: Start accepts. Automaton has 119058 states and 172282 transitions. Word has length 181 [2019-09-08 13:16:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:06,836 INFO L475 AbstractCegarLoop]: Abstraction has 119058 states and 172282 transitions. [2019-09-08 13:16:06,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 13:16:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 119058 states and 172282 transitions. [2019-09-08 13:16:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:16:06,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:06,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:16:06,856 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:06,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1597208288, now seen corresponding path program 1 times [2019-09-08 13:16:06,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:06,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:06,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:06,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:06,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:06,960 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 13:16:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:16:06,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:16:06,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:16:06,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:16:06,966 INFO L87 Difference]: Start difference. First operand 119058 states and 172282 transitions. Second operand 4 states. [2019-09-08 13:16:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:32,947 INFO L93 Difference]: Finished difference Result 315308 states and 467776 transitions. [2019-09-08 13:16:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:16:32,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-09-08 13:16:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:33,320 INFO L225 Difference]: With dead ends: 315308 [2019-09-08 13:16:33,320 INFO L226 Difference]: Without dead ends: 213711 [2019-09-08 13:16:33,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:16:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213711 states. [2019-09-08 13:16:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213711 to 116115. [2019-09-08 13:16:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116115 states. [2019-09-08 13:16:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116115 states to 116115 states and 168706 transitions. [2019-09-08 13:16:52,402 INFO L78 Accepts]: Start accepts. Automaton has 116115 states and 168706 transitions. Word has length 181 [2019-09-08 13:16:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:52,402 INFO L475 AbstractCegarLoop]: Abstraction has 116115 states and 168706 transitions. [2019-09-08 13:16:52,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:16:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 116115 states and 168706 transitions. [2019-09-08 13:16:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:16:52,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:16:52,421 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash 355267511, now seen corresponding path program 1 times [2019-09-08 13:16:52,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:52,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:54,311 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 13:16:54,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:54,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 13:16:54,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 13:16:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 13:16:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:16:54,312 INFO L87 Difference]: Start difference. First operand 116115 states and 168706 transitions. Second operand 21 states. [2019-09-08 13:16:54,993 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-09-08 13:16:55,355 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 13:16:55,558 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-08 13:16:55,850 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-08 13:16:56,074 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-08 13:16:56,312 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 13:16:56,577 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 13:16:56,748 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 13:16:56,968 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-08 13:17:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:13,745 INFO L93 Difference]: Finished difference Result 169065 states and 245964 transitions. [2019-09-08 13:17:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 13:17:13,745 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 181 [2019-09-08 13:17:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:13,919 INFO L225 Difference]: With dead ends: 169065 [2019-09-08 13:17:13,920 INFO L226 Difference]: Without dead ends: 121410 [2019-09-08 13:17:13,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=294, Invalid=966, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 13:17:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121410 states. [2019-09-08 13:17:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121410 to 118153. [2019-09-08 13:17:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118153 states. [2019-09-08 13:17:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118153 states to 118153 states and 171100 transitions. [2019-09-08 13:17:27,878 INFO L78 Accepts]: Start accepts. Automaton has 118153 states and 171100 transitions. Word has length 181 [2019-09-08 13:17:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:27,878 INFO L475 AbstractCegarLoop]: Abstraction has 118153 states and 171100 transitions. [2019-09-08 13:17:27,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 13:17:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 118153 states and 171100 transitions. [2019-09-08 13:17:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:17:27,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:27,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:27,899 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash 541451344, now seen corresponding path program 1 times [2019-09-08 13:17:27,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:27,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:27,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:27,964 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 13:17:27,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:27,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:27,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:27,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:27,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:27,965 INFO L87 Difference]: Start difference. First operand 118153 states and 171100 transitions. Second operand 3 states. [2019-09-08 13:17:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:44,089 INFO L93 Difference]: Finished difference Result 213771 states and 308998 transitions. [2019-09-08 13:17:44,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:44,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 13:17:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:44,284 INFO L225 Difference]: With dead ends: 213771 [2019-09-08 13:17:44,285 INFO L226 Difference]: Without dead ends: 131858 [2019-09-08 13:17:44,353 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 13:17:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131858 states. [2019-09-08 13:18:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131858 to 117139. [2019-09-08 13:18:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117139 states. [2019-09-08 13:18:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117139 states to 117139 states and 169204 transitions. [2019-09-08 13:18:02,933 INFO L78 Accepts]: Start accepts. Automaton has 117139 states and 169204 transitions. Word has length 182 [2019-09-08 13:18:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:02,933 INFO L475 AbstractCegarLoop]: Abstraction has 117139 states and 169204 transitions. [2019-09-08 13:18:02,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 117139 states and 169204 transitions. [2019-09-08 13:18:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:18:02,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:02,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:02,951 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:02,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:02,951 INFO L82 PathProgramCache]: Analyzing trace with hash -30835057, now seen corresponding path program 1 times [2019-09-08 13:18:02,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:02,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:02,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:02,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:02,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:03,012 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 13:18:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:03,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:03,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:03,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:03,013 INFO L87 Difference]: Start difference. First operand 117139 states and 169204 transitions. Second operand 3 states. [2019-09-08 13:18:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:16,899 INFO L93 Difference]: Finished difference Result 204322 states and 295939 transitions. [2019-09-08 13:18:16,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:16,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 13:18:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:17,068 INFO L225 Difference]: With dead ends: 204322 [2019-09-08 13:18:17,068 INFO L226 Difference]: Without dead ends: 116351 [2019-09-08 13:18:17,148 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 13:18:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116351 states. [2019-09-08 13:18:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116351 to 116351. [2019-09-08 13:18:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116351 states. [2019-09-08 13:18:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116351 states to 116351 states and 167785 transitions. [2019-09-08 13:18:31,039 INFO L78 Accepts]: Start accepts. Automaton has 116351 states and 167785 transitions. Word has length 182 [2019-09-08 13:18:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:31,040 INFO L475 AbstractCegarLoop]: Abstraction has 116351 states and 167785 transitions. [2019-09-08 13:18:31,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 116351 states and 167785 transitions. [2019-09-08 13:18:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:18:31,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:31,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:31,059 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:31,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1968335284, now seen corresponding path program 1 times [2019-09-08 13:18:31,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:31,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:31,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:31,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:31,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:31,140 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 13:18:31,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:31,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:31,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:31,142 INFO L87 Difference]: Start difference. First operand 116351 states and 167785 transitions. Second operand 3 states.