/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:36:54,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:36:54,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:36:54,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:36:54,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:36:54,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:36:54,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:36:54,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:36:54,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:36:54,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:36:54,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:36:54,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:36:54,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:36:54,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:36:54,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:36:54,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:36:54,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:36:54,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:36:54,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:36:54,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:36:54,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:36:54,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:36:54,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:36:54,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:36:54,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:36:54,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:36:54,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:36:54,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:36:54,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:36:54,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:36:54,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:36:54,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:36:54,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:36:54,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:36:54,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:36:54,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:36:54,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:36:54,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:36:54,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:36:54,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:36:54,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:36:54,143 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-11-23 22:36:54,157 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:36:54,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:36:54,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:36:54,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:36:54,159 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:36:54,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:36:54,160 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:36:54,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:36:54,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:36:54,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:36:54,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:36:54,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:36:54,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:36:54,161 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:36:54,161 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:36:54,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:36:54,161 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:36:54,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:36:54,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:36:54,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:36:54,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:36:54,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:36:54,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:36:54,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:36:54,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:36:54,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:36:54,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:36:54,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:36:54,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:36:54,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:36:54,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:36:54,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:36:54,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:36:54,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:36:54,458 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:36:54,459 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-23 22:36:54,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ee6dd3e/b175f12a5cff4879bcb14c702541dfc8/FLAG2ad4bc147 [2019-11-23 22:36:55,055 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:36:55,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-23 22:36:55,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ee6dd3e/b175f12a5cff4879bcb14c702541dfc8/FLAG2ad4bc147 [2019-11-23 22:36:55,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ee6dd3e/b175f12a5cff4879bcb14c702541dfc8 [2019-11-23 22:36:55,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:36:55,416 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:36:55,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:36:55,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:36:55,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:36:55,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e373f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55, skipping insertion in model container [2019-11-23 22:36:55,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:36:55,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:36:55,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:36:55,839 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:36:55,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:36:55,922 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:36:55,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55 WrapperNode [2019-11-23 22:36:55,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:36:55,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:36:55,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:36:55,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:36:55,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:55,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:56,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:36:56,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:36:56,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:36:56,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:36:56,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:56,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:56,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:56,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:56,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:56,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:56,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... [2019-11-23 22:36:56,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:36:56,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:36:56,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:36:56,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:36:56,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:36:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:36:56,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:36:58,069 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:36:58,069 INFO L284 CfgBuilder]: Removed 173 assume(true) statements. [2019-11-23 22:36:58,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:36:58 BoogieIcfgContainer [2019-11-23 22:36:58,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:36:58,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:36:58,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:36:58,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:36:58,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:36:55" (1/3) ... [2019-11-23 22:36:58,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a427a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:36:58, skipping insertion in model container [2019-11-23 22:36:58,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:55" (2/3) ... [2019-11-23 22:36:58,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a427a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:36:58, skipping insertion in model container [2019-11-23 22:36:58,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:36:58" (3/3) ... [2019-11-23 22:36:58,089 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-23 22:36:58,099 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:36:58,116 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-23 22:36:58,129 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-23 22:36:58,179 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:36:58,180 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:36:58,180 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:36:58,180 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:36:58,180 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:36:58,181 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:36:58,181 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:36:58,181 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:36:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states. [2019-11-23 22:36:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 22:36:58,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:58,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:58,234 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2019-11-23 22:36:58,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:58,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783135598] [2019-11-23 22:36:58,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:58,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783135598] [2019-11-23 22:36:58,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:58,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:58,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891062033] [2019-11-23 22:36:58,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:58,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:58,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:58,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:58,503 INFO L87 Difference]: Start difference. First operand 514 states. Second operand 3 states. [2019-11-23 22:36:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:58,816 INFO L93 Difference]: Finished difference Result 1224 states and 2024 transitions. [2019-11-23 22:36:58,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:58,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-23 22:36:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:58,849 INFO L225 Difference]: With dead ends: 1224 [2019-11-23 22:36:58,850 INFO L226 Difference]: Without dead ends: 712 [2019-11-23 22:36:58,863 INFO L630 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-11-23 22:36:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-11-23 22:36:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 450. [2019-11-23 22:36:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-11-23 22:36:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 705 transitions. [2019-11-23 22:36:58,958 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 705 transitions. Word has length 9 [2019-11-23 22:36:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:58,958 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 705 transitions. [2019-11-23 22:36:58,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 705 transitions. [2019-11-23 22:36:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:36:58,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:58,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:58,961 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:58,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:58,962 INFO L82 PathProgramCache]: Analyzing trace with hash -503954138, now seen corresponding path program 1 times [2019-11-23 22:36:58,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:58,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434047642] [2019-11-23 22:36:58,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:59,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434047642] [2019-11-23 22:36:59,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:59,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540323347] [2019-11-23 22:36:59,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:59,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:59,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:59,055 INFO L87 Difference]: Start difference. First operand 450 states and 705 transitions. Second operand 3 states. [2019-11-23 22:36:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,145 INFO L93 Difference]: Finished difference Result 1110 states and 1725 transitions. [2019-11-23 22:36:59,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:59,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-23 22:36:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,153 INFO L225 Difference]: With dead ends: 1110 [2019-11-23 22:36:59,154 INFO L226 Difference]: Without dead ends: 662 [2019-11-23 22:36:59,155 INFO L630 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-11-23 22:36:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-23 22:36:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 417. [2019-11-23 22:36:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-23 22:36:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 647 transitions. [2019-11-23 22:36:59,186 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 647 transitions. Word has length 10 [2019-11-23 22:36:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,186 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 647 transitions. [2019-11-23 22:36:59,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 647 transitions. [2019-11-23 22:36:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:36:59,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:59,188 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash -674152124, now seen corresponding path program 1 times [2019-11-23 22:36:59,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148460907] [2019-11-23 22:36:59,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:59,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148460907] [2019-11-23 22:36:59,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:59,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648478596] [2019-11-23 22:36:59,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:59,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:59,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:59,255 INFO L87 Difference]: Start difference. First operand 417 states and 647 transitions. Second operand 3 states. [2019-11-23 22:36:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,330 INFO L93 Difference]: Finished difference Result 1229 states and 1912 transitions. [2019-11-23 22:36:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:59,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-23 22:36:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,336 INFO L225 Difference]: With dead ends: 1229 [2019-11-23 22:36:59,336 INFO L226 Difference]: Without dead ends: 822 [2019-11-23 22:36:59,337 INFO L630 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-11-23 22:36:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-11-23 22:36:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 421. [2019-11-23 22:36:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-23 22:36:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 651 transitions. [2019-11-23 22:36:59,354 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 651 transitions. Word has length 13 [2019-11-23 22:36:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,354 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 651 transitions. [2019-11-23 22:36:59,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2019-11-23 22:36:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:36:59,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:59,356 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1826556945, now seen corresponding path program 1 times [2019-11-23 22:36:59,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822673354] [2019-11-23 22:36:59,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:59,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822673354] [2019-11-23 22:36:59,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:59,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147197022] [2019-11-23 22:36:59,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:59,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:59,440 INFO L87 Difference]: Start difference. First operand 421 states and 651 transitions. Second operand 3 states. [2019-11-23 22:36:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,465 INFO L93 Difference]: Finished difference Result 657 states and 1010 transitions. [2019-11-23 22:36:59,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:59,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:36:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,469 INFO L225 Difference]: With dead ends: 657 [2019-11-23 22:36:59,469 INFO L226 Difference]: Without dead ends: 421 [2019-11-23 22:36:59,470 INFO L630 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-11-23 22:36:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-23 22:36:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-11-23 22:36:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-23 22:36:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 647 transitions. [2019-11-23 22:36:59,482 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 647 transitions. Word has length 17 [2019-11-23 22:36:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,482 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 647 transitions. [2019-11-23 22:36:59,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 647 transitions. [2019-11-23 22:36:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:36:59,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:59,485 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash -35486156, now seen corresponding path program 1 times [2019-11-23 22:36:59,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947316826] [2019-11-23 22:36:59,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:36:59,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947316826] [2019-11-23 22:36:59,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:36:59,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915423749] [2019-11-23 22:36:59,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:36:59,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:36:59,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:36:59,558 INFO L87 Difference]: Start difference. First operand 421 states and 647 transitions. Second operand 4 states. [2019-11-23 22:36:59,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,641 INFO L93 Difference]: Finished difference Result 1072 states and 1643 transitions. [2019-11-23 22:36:59,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:59,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-23 22:36:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,647 INFO L225 Difference]: With dead ends: 1072 [2019-11-23 22:36:59,649 INFO L226 Difference]: Without dead ends: 663 [2019-11-23 22:36:59,650 INFO L630 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-11-23 22:36:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-23 22:36:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 421. [2019-11-23 22:36:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-23 22:36:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 646 transitions. [2019-11-23 22:36:59,664 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 646 transitions. Word has length 18 [2019-11-23 22:36:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,665 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 646 transitions. [2019-11-23 22:36:59,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 646 transitions. [2019-11-23 22:36:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:36:59,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:59,670 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1967275947, now seen corresponding path program 1 times [2019-11-23 22:36:59,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431902561] [2019-11-23 22:36:59,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:36:59,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431902561] [2019-11-23 22:36:59,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:59,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941707822] [2019-11-23 22:36:59,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:59,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:59,740 INFO L87 Difference]: Start difference. First operand 421 states and 646 transitions. Second operand 3 states. [2019-11-23 22:36:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:59,888 INFO L93 Difference]: Finished difference Result 1014 states and 1545 transitions. [2019-11-23 22:36:59,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:59,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:36:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:59,893 INFO L225 Difference]: With dead ends: 1014 [2019-11-23 22:36:59,893 INFO L226 Difference]: Without dead ends: 608 [2019-11-23 22:36:59,895 INFO L630 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-11-23 22:36:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-11-23 22:36:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 376. [2019-11-23 22:36:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-23 22:36:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 566 transitions. [2019-11-23 22:36:59,909 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 566 transitions. Word has length 21 [2019-11-23 22:36:59,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:59,910 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 566 transitions. [2019-11-23 22:36:59,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 566 transitions. [2019-11-23 22:36:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:36:59,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:59,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:36:59,912 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:59,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash -385095713, now seen corresponding path program 1 times [2019-11-23 22:36:59,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:59,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39608095] [2019-11-23 22:36:59,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:36:59,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39608095] [2019-11-23 22:36:59,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:59,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:59,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148306297] [2019-11-23 22:36:59,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:59,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:59,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:59,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:59,947 INFO L87 Difference]: Start difference. First operand 376 states and 566 transitions. Second operand 3 states. [2019-11-23 22:37:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,019 INFO L93 Difference]: Finished difference Result 935 states and 1407 transitions. [2019-11-23 22:37:00,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:37:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,023 INFO L225 Difference]: With dead ends: 935 [2019-11-23 22:37:00,024 INFO L226 Difference]: Without dead ends: 574 [2019-11-23 22:37:00,025 INFO L630 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-11-23 22:37:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-23 22:37:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 350. [2019-11-23 22:37:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-23 22:37:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 520 transitions. [2019-11-23 22:37:00,039 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 520 transitions. Word has length 21 [2019-11-23 22:37:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,040 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 520 transitions. [2019-11-23 22:37:00,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 520 transitions. [2019-11-23 22:37:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:37:00,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,043 INFO L410 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] [2019-11-23 22:37:00,044 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2032684668, now seen corresponding path program 1 times [2019-11-23 22:37:00,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209693982] [2019-11-23 22:37:00,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:37:00,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209693982] [2019-11-23 22:37:00,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:00,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373507288] [2019-11-23 22:37:00,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:00,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:00,130 INFO L87 Difference]: Start difference. First operand 350 states and 520 transitions. Second operand 4 states. [2019-11-23 22:37:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,221 INFO L93 Difference]: Finished difference Result 896 states and 1338 transitions. [2019-11-23 22:37:00,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:37:00,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-23 22:37:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,225 INFO L225 Difference]: With dead ends: 896 [2019-11-23 22:37:00,225 INFO L226 Difference]: Without dead ends: 572 [2019-11-23 22:37:00,226 INFO L630 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-11-23 22:37:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-11-23 22:37:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 350. [2019-11-23 22:37:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-23 22:37:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 519 transitions. [2019-11-23 22:37:00,237 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 519 transitions. Word has length 31 [2019-11-23 22:37:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,238 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 519 transitions. [2019-11-23 22:37:00,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 519 transitions. [2019-11-23 22:37:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:37:00,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,239 INFO L410 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] [2019-11-23 22:37:00,239 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,240 INFO L82 PathProgramCache]: Analyzing trace with hash -290926641, now seen corresponding path program 1 times [2019-11-23 22:37:00,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093502517] [2019-11-23 22:37:00,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:37:00,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093502517] [2019-11-23 22:37:00,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923273695] [2019-11-23 22:37:00,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,275 INFO L87 Difference]: Start difference. First operand 350 states and 519 transitions. Second operand 3 states. [2019-11-23 22:37:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,319 INFO L93 Difference]: Finished difference Result 869 states and 1301 transitions. [2019-11-23 22:37:00,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-23 22:37:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,323 INFO L225 Difference]: With dead ends: 869 [2019-11-23 22:37:00,323 INFO L226 Difference]: Without dead ends: 548 [2019-11-23 22:37:00,324 INFO L630 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-11-23 22:37:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-11-23 22:37:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 327. [2019-11-23 22:37:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-11-23 22:37:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 481 transitions. [2019-11-23 22:37:00,335 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 481 transitions. Word has length 34 [2019-11-23 22:37:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,335 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 481 transitions. [2019-11-23 22:37:00,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 481 transitions. [2019-11-23 22:37:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:37:00,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,336 INFO L410 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] [2019-11-23 22:37:00,337 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1984299198, now seen corresponding path program 1 times [2019-11-23 22:37:00,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704760571] [2019-11-23 22:37:00,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:37:00,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704760571] [2019-11-23 22:37:00,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999287463] [2019-11-23 22:37:00,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,379 INFO L87 Difference]: Start difference. First operand 327 states and 481 transitions. Second operand 3 states. [2019-11-23 22:37:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,443 INFO L93 Difference]: Finished difference Result 731 states and 1077 transitions. [2019-11-23 22:37:00,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-23 22:37:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,447 INFO L225 Difference]: With dead ends: 731 [2019-11-23 22:37:00,447 INFO L226 Difference]: Without dead ends: 433 [2019-11-23 22:37:00,448 INFO L630 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-11-23 22:37:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-23 22:37:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 295. [2019-11-23 22:37:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-23 22:37:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 421 transitions. [2019-11-23 22:37:00,458 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 421 transitions. Word has length 35 [2019-11-23 22:37:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,467 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 421 transitions. [2019-11-23 22:37:00,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 421 transitions. [2019-11-23 22:37:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-23 22:37:00,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,470 INFO L410 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] [2019-11-23 22:37:00,470 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1766202321, now seen corresponding path program 1 times [2019-11-23 22:37:00,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256875455] [2019-11-23 22:37:00,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:37:00,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256875455] [2019-11-23 22:37:00,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:00,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985386183] [2019-11-23 22:37:00,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:00,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:00,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:00,525 INFO L87 Difference]: Start difference. First operand 295 states and 421 transitions. Second operand 4 states. [2019-11-23 22:37:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,573 INFO L93 Difference]: Finished difference Result 752 states and 1089 transitions. [2019-11-23 22:37:00,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:37:00,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-23 22:37:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,578 INFO L225 Difference]: With dead ends: 752 [2019-11-23 22:37:00,579 INFO L226 Difference]: Without dead ends: 499 [2019-11-23 22:37:00,579 INFO L630 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-11-23 22:37:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-23 22:37:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 295. [2019-11-23 22:37:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-23 22:37:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 420 transitions. [2019-11-23 22:37:00,590 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 420 transitions. Word has length 46 [2019-11-23 22:37:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,590 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 420 transitions. [2019-11-23 22:37:00,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 420 transitions. [2019-11-23 22:37:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:37:00,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,592 INFO L410 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] [2019-11-23 22:37:00,593 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,593 INFO L82 PathProgramCache]: Analyzing trace with hash -544708160, now seen corresponding path program 1 times [2019-11-23 22:37:00,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798751338] [2019-11-23 22:37:00,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:00,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798751338] [2019-11-23 22:37:00,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30368363] [2019-11-23 22:37:00,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,655 INFO L87 Difference]: Start difference. First operand 295 states and 420 transitions. Second operand 3 states. [2019-11-23 22:37:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,699 INFO L93 Difference]: Finished difference Result 634 states and 937 transitions. [2019-11-23 22:37:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-23 22:37:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,701 INFO L225 Difference]: With dead ends: 634 [2019-11-23 22:37:00,701 INFO L226 Difference]: Without dead ends: 384 [2019-11-23 22:37:00,702 INFO L630 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-11-23 22:37:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-23 22:37:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 255. [2019-11-23 22:37:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-23 22:37:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 370 transitions. [2019-11-23 22:37:00,712 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 370 transitions. Word has length 49 [2019-11-23 22:37:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,712 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 370 transitions. [2019-11-23 22:37:00,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 370 transitions. [2019-11-23 22:37:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:37:00,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,713 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:00,714 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash 390941353, now seen corresponding path program 1 times [2019-11-23 22:37:00,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882911271] [2019-11-23 22:37:00,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:00,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882911271] [2019-11-23 22:37:00,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498047201] [2019-11-23 22:37:00,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:00,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:00,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:00,755 INFO L87 Difference]: Start difference. First operand 255 states and 370 transitions. Second operand 3 states. [2019-11-23 22:37:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,782 INFO L93 Difference]: Finished difference Result 435 states and 644 transitions. [2019-11-23 22:37:00,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:00,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-23 22:37:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,784 INFO L225 Difference]: With dead ends: 435 [2019-11-23 22:37:00,784 INFO L226 Difference]: Without dead ends: 225 [2019-11-23 22:37:00,785 INFO L630 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-11-23 22:37:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-23 22:37:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-11-23 22:37:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-23 22:37:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 324 transitions. [2019-11-23 22:37:00,792 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 324 transitions. Word has length 56 [2019-11-23 22:37:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,793 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 324 transitions. [2019-11-23 22:37:00,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 324 transitions. [2019-11-23 22:37:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 22:37:00,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:00,794 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1746044383, now seen corresponding path program 1 times [2019-11-23 22:37:00,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078453403] [2019-11-23 22:37:00,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:00,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078453403] [2019-11-23 22:37:00,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:00,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001644946] [2019-11-23 22:37:00,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:00,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:00,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:00,884 INFO L87 Difference]: Start difference. First operand 225 states and 324 transitions. Second operand 4 states. [2019-11-23 22:37:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:00,921 INFO L93 Difference]: Finished difference Result 393 states and 578 transitions. [2019-11-23 22:37:00,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:37:00,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-23 22:37:00,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:00,923 INFO L225 Difference]: With dead ends: 393 [2019-11-23 22:37:00,923 INFO L226 Difference]: Without dead ends: 225 [2019-11-23 22:37:00,927 INFO L630 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-11-23 22:37:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-23 22:37:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-11-23 22:37:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-23 22:37:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 323 transitions. [2019-11-23 22:37:00,935 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 323 transitions. Word has length 59 [2019-11-23 22:37:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:00,935 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 323 transitions. [2019-11-23 22:37:00,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 323 transitions. [2019-11-23 22:37:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:37:00,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:00,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:00,937 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash 621112538, now seen corresponding path program 1 times [2019-11-23 22:37:00,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:00,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434954986] [2019-11-23 22:37:00,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:00,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434954986] [2019-11-23 22:37:00,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:00,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:00,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186357644] [2019-11-23 22:37:01,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:01,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:01,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:01,001 INFO L87 Difference]: Start difference. First operand 225 states and 323 transitions. Second operand 3 states. [2019-11-23 22:37:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,038 INFO L93 Difference]: Finished difference Result 522 states and 776 transitions. [2019-11-23 22:37:01,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:01,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-23 22:37:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,041 INFO L225 Difference]: With dead ends: 522 [2019-11-23 22:37:01,041 INFO L226 Difference]: Without dead ends: 357 [2019-11-23 22:37:01,042 INFO L630 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-11-23 22:37:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-23 22:37:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 220. [2019-11-23 22:37:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-23 22:37:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 315 transitions. [2019-11-23 22:37:01,050 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 315 transitions. Word has length 62 [2019-11-23 22:37:01,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,051 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 315 transitions. [2019-11-23 22:37:01,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 315 transitions. [2019-11-23 22:37:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:37:01,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:01,052 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,052 INFO L82 PathProgramCache]: Analyzing trace with hash 114301335, now seen corresponding path program 1 times [2019-11-23 22:37:01,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700047876] [2019-11-23 22:37:01,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700047876] [2019-11-23 22:37:01,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:01,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55206617] [2019-11-23 22:37:01,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:01,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:01,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:01,090 INFO L87 Difference]: Start difference. First operand 220 states and 315 transitions. Second operand 3 states. [2019-11-23 22:37:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,123 INFO L93 Difference]: Finished difference Result 503 states and 747 transitions. [2019-11-23 22:37:01,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:01,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:37:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,125 INFO L225 Difference]: With dead ends: 503 [2019-11-23 22:37:01,125 INFO L226 Difference]: Without dead ends: 343 [2019-11-23 22:37:01,126 INFO L630 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-11-23 22:37:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-23 22:37:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 216. [2019-11-23 22:37:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 22:37:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 308 transitions. [2019-11-23 22:37:01,135 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 308 transitions. Word has length 67 [2019-11-23 22:37:01,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,135 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 308 transitions. [2019-11-23 22:37:01,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 308 transitions. [2019-11-23 22:37:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:37:01,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:01,136 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2093726931, now seen corresponding path program 1 times [2019-11-23 22:37:01,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501429815] [2019-11-23 22:37:01,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501429815] [2019-11-23 22:37:01,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:01,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654552398] [2019-11-23 22:37:01,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:01,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:01,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:01,178 INFO L87 Difference]: Start difference. First operand 216 states and 308 transitions. Second operand 3 states. [2019-11-23 22:37:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,198 INFO L93 Difference]: Finished difference Result 370 states and 542 transitions. [2019-11-23 22:37:01,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:01,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:37:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,200 INFO L225 Difference]: With dead ends: 370 [2019-11-23 22:37:01,200 INFO L226 Difference]: Without dead ends: 214 [2019-11-23 22:37:01,201 INFO L630 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-11-23 22:37:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-23 22:37:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-11-23 22:37:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-23 22:37:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 302 transitions. [2019-11-23 22:37:01,210 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 302 transitions. Word has length 73 [2019-11-23 22:37:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,210 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 302 transitions. [2019-11-23 22:37:01,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 302 transitions. [2019-11-23 22:37:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:37:01,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,211 INFO L410 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] [2019-11-23 22:37:01,211 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash -953900745, now seen corresponding path program 1 times [2019-11-23 22:37:01,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159814796] [2019-11-23 22:37:01,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159814796] [2019-11-23 22:37:01,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:01,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215369031] [2019-11-23 22:37:01,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:01,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:01,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:01,262 INFO L87 Difference]: Start difference. First operand 213 states and 302 transitions. Second operand 3 states. [2019-11-23 22:37:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,280 INFO L93 Difference]: Finished difference Result 412 states and 601 transitions. [2019-11-23 22:37:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:01,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-23 22:37:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,283 INFO L225 Difference]: With dead ends: 412 [2019-11-23 22:37:01,283 INFO L226 Difference]: Without dead ends: 259 [2019-11-23 22:37:01,284 INFO L630 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-11-23 22:37:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-23 22:37:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 210. [2019-11-23 22:37:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-23 22:37:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 298 transitions. [2019-11-23 22:37:01,307 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 298 transitions. Word has length 80 [2019-11-23 22:37:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,308 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 298 transitions. [2019-11-23 22:37:01,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 298 transitions. [2019-11-23 22:37:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:37:01,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,309 INFO L410 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] [2019-11-23 22:37:01,310 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1940476615, now seen corresponding path program 1 times [2019-11-23 22:37:01,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423227873] [2019-11-23 22:37:01,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423227873] [2019-11-23 22:37:01,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:01,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552307640] [2019-11-23 22:37:01,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:01,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:01,442 INFO L87 Difference]: Start difference. First operand 210 states and 298 transitions. Second operand 4 states. [2019-11-23 22:37:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,561 INFO L93 Difference]: Finished difference Result 534 states and 779 transitions. [2019-11-23 22:37:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:37:01,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-23 22:37:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,563 INFO L225 Difference]: With dead ends: 534 [2019-11-23 22:37:01,564 INFO L226 Difference]: Without dead ends: 384 [2019-11-23 22:37:01,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-23 22:37:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-23 22:37:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 291. [2019-11-23 22:37:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-23 22:37:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 415 transitions. [2019-11-23 22:37:01,584 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 415 transitions. Word has length 83 [2019-11-23 22:37:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,585 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 415 transitions. [2019-11-23 22:37:01,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 415 transitions. [2019-11-23 22:37:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:37:01,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,586 INFO L410 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] [2019-11-23 22:37:01,586 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1284591471, now seen corresponding path program 1 times [2019-11-23 22:37:01,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512058157] [2019-11-23 22:37:01,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512058157] [2019-11-23 22:37:01,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:01,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361394084] [2019-11-23 22:37:01,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:01,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:01,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:01,686 INFO L87 Difference]: Start difference. First operand 291 states and 415 transitions. Second operand 3 states. [2019-11-23 22:37:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,730 INFO L93 Difference]: Finished difference Result 690 states and 1009 transitions. [2019-11-23 22:37:01,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:01,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:37:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,733 INFO L225 Difference]: With dead ends: 690 [2019-11-23 22:37:01,734 INFO L226 Difference]: Without dead ends: 497 [2019-11-23 22:37:01,734 INFO L630 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-11-23 22:37:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-11-23 22:37:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 361. [2019-11-23 22:37:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-23 22:37:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 514 transitions. [2019-11-23 22:37:01,758 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 514 transitions. Word has length 99 [2019-11-23 22:37:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,759 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 514 transitions. [2019-11-23 22:37:01,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 514 transitions. [2019-11-23 22:37:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:37:01,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,762 INFO L410 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] [2019-11-23 22:37:01,765 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1539198065, now seen corresponding path program 1 times [2019-11-23 22:37:01,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587477949] [2019-11-23 22:37:01,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:37:01,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587477949] [2019-11-23 22:37:01,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:01,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:01,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655420938] [2019-11-23 22:37:01,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:01,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:01,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:01,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:01,850 INFO L87 Difference]: Start difference. First operand 361 states and 514 transitions. Second operand 3 states. [2019-11-23 22:37:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:01,890 INFO L93 Difference]: Finished difference Result 839 states and 1222 transitions. [2019-11-23 22:37:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:01,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:37:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:01,894 INFO L225 Difference]: With dead ends: 839 [2019-11-23 22:37:01,894 INFO L226 Difference]: Without dead ends: 603 [2019-11-23 22:37:01,894 INFO L630 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-11-23 22:37:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-23 22:37:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 455. [2019-11-23 22:37:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-23 22:37:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 648 transitions. [2019-11-23 22:37:01,918 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 648 transitions. Word has length 100 [2019-11-23 22:37:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:01,918 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 648 transitions. [2019-11-23 22:37:01,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 648 transitions. [2019-11-23 22:37:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:37:01,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:01,920 INFO L410 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] [2019-11-23 22:37:01,920 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:01,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:01,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1069877832, now seen corresponding path program 1 times [2019-11-23 22:37:01,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:01,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601969852] [2019-11-23 22:37:01,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:01,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601969852] [2019-11-23 22:37:01,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926433983] [2019-11-23 22:37:01,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:02,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:37:02,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:37:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:37:02,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:37:02,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-23 22:37:02,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890938263] [2019-11-23 22:37:02,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:37:02,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:37:02,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:37:02,170 INFO L87 Difference]: Start difference. First operand 455 states and 648 transitions. Second operand 6 states. [2019-11-23 22:37:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:02,534 INFO L93 Difference]: Finished difference Result 1190 states and 1646 transitions. [2019-11-23 22:37:02,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:37:02,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-23 22:37:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:02,538 INFO L225 Difference]: With dead ends: 1190 [2019-11-23 22:37:02,538 INFO L226 Difference]: Without dead ends: 746 [2019-11-23 22:37:02,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:37:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-11-23 22:37:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 496. [2019-11-23 22:37:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-23 22:37:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 688 transitions. [2019-11-23 22:37:02,567 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 688 transitions. Word has length 101 [2019-11-23 22:37:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:02,567 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 688 transitions. [2019-11-23 22:37:02,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:37:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 688 transitions. [2019-11-23 22:37:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-23 22:37:02,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:02,570 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:02,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:02,782 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash -958769693, now seen corresponding path program 1 times [2019-11-23 22:37:02,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:02,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742337951] [2019-11-23 22:37:02,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-23 22:37:02,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742337951] [2019-11-23 22:37:02,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639625754] [2019-11-23 22:37:02,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:03,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 22:37:03,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:37:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 22:37:03,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:37:03,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-23 22:37:03,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831561280] [2019-11-23 22:37:03,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:37:03,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:03,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:37:03,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:37:03,139 INFO L87 Difference]: Start difference. First operand 496 states and 688 transitions. Second operand 7 states. [2019-11-23 22:37:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:03,432 INFO L93 Difference]: Finished difference Result 1395 states and 1935 transitions. [2019-11-23 22:37:03,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:37:03,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-11-23 22:37:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:03,437 INFO L225 Difference]: With dead ends: 1395 [2019-11-23 22:37:03,437 INFO L226 Difference]: Without dead ends: 918 [2019-11-23 22:37:03,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:37:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-23 22:37:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 537. [2019-11-23 22:37:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-23 22:37:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 736 transitions. [2019-11-23 22:37:03,469 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 736 transitions. Word has length 139 [2019-11-23 22:37:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:03,470 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 736 transitions. [2019-11-23 22:37:03,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:37:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 736 transitions. [2019-11-23 22:37:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 22:37:03,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:03,472 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:03,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:03,677 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash 818430710, now seen corresponding path program 1 times [2019-11-23 22:37:03,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:03,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875403086] [2019-11-23 22:37:03,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:03,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875403086] [2019-11-23 22:37:03,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:03,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:03,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966903683] [2019-11-23 22:37:03,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:03,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:03,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:03,831 INFO L87 Difference]: Start difference. First operand 537 states and 736 transitions. Second operand 4 states. [2019-11-23 22:37:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:03,907 INFO L93 Difference]: Finished difference Result 851 states and 1186 transitions. [2019-11-23 22:37:03,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:37:03,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-23 22:37:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:03,911 INFO L225 Difference]: With dead ends: 851 [2019-11-23 22:37:03,911 INFO L226 Difference]: Without dead ends: 849 [2019-11-23 22:37:03,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-23 22:37:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-11-23 22:37:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 539. [2019-11-23 22:37:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-11-23 22:37:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 738 transitions. [2019-11-23 22:37:03,940 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 738 transitions. Word has length 177 [2019-11-23 22:37:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:03,941 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 738 transitions. [2019-11-23 22:37:03,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 738 transitions. [2019-11-23 22:37:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-23 22:37:03,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:03,943 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:03,943 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1245468310, now seen corresponding path program 1 times [2019-11-23 22:37:03,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:03,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299806699] [2019-11-23 22:37:03,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-23 22:37:04,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299806699] [2019-11-23 22:37:04,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947076137] [2019-11-23 22:37:04,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:04,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 22:37:04,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:37:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-23 22:37:04,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:37:04,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-11-23 22:37:04,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363904120] [2019-11-23 22:37:04,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:37:04,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:37:04,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:37:04,476 INFO L87 Difference]: Start difference. First operand 539 states and 738 transitions. Second operand 11 states. [2019-11-23 22:37:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:05,323 INFO L93 Difference]: Finished difference Result 2992 states and 4233 transitions. [2019-11-23 22:37:05,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:37:05,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 180 [2019-11-23 22:37:05,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:05,336 INFO L225 Difference]: With dead ends: 2992 [2019-11-23 22:37:05,337 INFO L226 Difference]: Without dead ends: 2690 [2019-11-23 22:37:05,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-11-23 22:37:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2019-11-23 22:37:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 727. [2019-11-23 22:37:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-11-23 22:37:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 987 transitions. [2019-11-23 22:37:05,401 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 987 transitions. Word has length 180 [2019-11-23 22:37:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:05,401 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 987 transitions. [2019-11-23 22:37:05,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:37:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 987 transitions. [2019-11-23 22:37:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-23 22:37:05,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:05,404 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:05,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:05,611 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:05,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash -34395368, now seen corresponding path program 1 times [2019-11-23 22:37:05,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:05,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294334671] [2019-11-23 22:37:05,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:05,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294334671] [2019-11-23 22:37:05,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:05,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:05,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478375488] [2019-11-23 22:37:05,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:05,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:05,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:05,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:05,694 INFO L87 Difference]: Start difference. First operand 727 states and 987 transitions. Second operand 3 states. [2019-11-23 22:37:05,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:05,876 INFO L93 Difference]: Finished difference Result 1572 states and 2166 transitions. [2019-11-23 22:37:05,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:05,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-23 22:37:05,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:05,883 INFO L225 Difference]: With dead ends: 1572 [2019-11-23 22:37:05,883 INFO L226 Difference]: Without dead ends: 1270 [2019-11-23 22:37:05,884 INFO L630 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-11-23 22:37:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-23 22:37:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 727. [2019-11-23 22:37:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-11-23 22:37:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 985 transitions. [2019-11-23 22:37:05,941 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 985 transitions. Word has length 180 [2019-11-23 22:37:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:05,942 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 985 transitions. [2019-11-23 22:37:05,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 985 transitions. [2019-11-23 22:37:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-23 22:37:05,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:05,948 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:05,948 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1859951354, now seen corresponding path program 1 times [2019-11-23 22:37:05,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:05,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829865233] [2019-11-23 22:37:05,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:37:06,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829865233] [2019-11-23 22:37:06,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:06,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:06,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059350027] [2019-11-23 22:37:06,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:06,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:06,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:06,048 INFO L87 Difference]: Start difference. First operand 727 states and 985 transitions. Second operand 3 states. [2019-11-23 22:37:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:06,139 INFO L93 Difference]: Finished difference Result 1192 states and 1628 transitions. [2019-11-23 22:37:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:06,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-23 22:37:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:06,143 INFO L225 Difference]: With dead ends: 1192 [2019-11-23 22:37:06,143 INFO L226 Difference]: Without dead ends: 586 [2019-11-23 22:37:06,144 INFO L630 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-11-23 22:37:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-23 22:37:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 585. [2019-11-23 22:37:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-11-23 22:37:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 769 transitions. [2019-11-23 22:37:06,201 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 769 transitions. Word has length 183 [2019-11-23 22:37:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:06,202 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 769 transitions. [2019-11-23 22:37:06,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 769 transitions. [2019-11-23 22:37:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-23 22:37:06,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:06,206 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:06,206 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:06,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2102972572, now seen corresponding path program 1 times [2019-11-23 22:37:06,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:06,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993256400] [2019-11-23 22:37:06,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:06,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993256400] [2019-11-23 22:37:06,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:06,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:37:06,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077733055] [2019-11-23 22:37:06,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:37:06,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:06,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:37:06,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:37:06,450 INFO L87 Difference]: Start difference. First operand 585 states and 769 transitions. Second operand 9 states. [2019-11-23 22:37:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:07,923 INFO L93 Difference]: Finished difference Result 1910 states and 2584 transitions. [2019-11-23 22:37:07,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-23 22:37:07,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2019-11-23 22:37:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:07,931 INFO L225 Difference]: With dead ends: 1910 [2019-11-23 22:37:07,931 INFO L226 Difference]: Without dead ends: 1619 [2019-11-23 22:37:07,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=384, Invalid=1256, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 22:37:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2019-11-23 22:37:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 675. [2019-11-23 22:37:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2019-11-23 22:37:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 885 transitions. [2019-11-23 22:37:07,987 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 885 transitions. Word has length 188 [2019-11-23 22:37:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:07,988 INFO L462 AbstractCegarLoop]: Abstraction has 675 states and 885 transitions. [2019-11-23 22:37:07,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:37:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 885 transitions. [2019-11-23 22:37:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 22:37:07,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:07,991 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:07,991 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:07,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:07,991 INFO L82 PathProgramCache]: Analyzing trace with hash -567802538, now seen corresponding path program 1 times [2019-11-23 22:37:07,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:07,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072479048] [2019-11-23 22:37:07,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:08,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072479048] [2019-11-23 22:37:08,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:08,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:37:08,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78909044] [2019-11-23 22:37:08,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:37:08,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:08,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:37:08,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:37:08,141 INFO L87 Difference]: Start difference. First operand 675 states and 885 transitions. Second operand 6 states. [2019-11-23 22:37:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:08,355 INFO L93 Difference]: Finished difference Result 2092 states and 2826 transitions. [2019-11-23 22:37:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:37:08,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-11-23 22:37:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:08,366 INFO L225 Difference]: With dead ends: 2092 [2019-11-23 22:37:08,366 INFO L226 Difference]: Without dead ends: 1705 [2019-11-23 22:37:08,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:37:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2019-11-23 22:37:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 752. [2019-11-23 22:37:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-11-23 22:37:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 983 transitions. [2019-11-23 22:37:08,485 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 983 transitions. Word has length 194 [2019-11-23 22:37:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:08,486 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 983 transitions. [2019-11-23 22:37:08,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:37:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 983 transitions. [2019-11-23 22:37:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 22:37:08,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:08,490 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:08,491 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash 190520342, now seen corresponding path program 1 times [2019-11-23 22:37:08,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:08,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804982476] [2019-11-23 22:37:08,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:08,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804982476] [2019-11-23 22:37:08,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:08,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:37:08,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402256077] [2019-11-23 22:37:08,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:37:08,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:37:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:37:08,736 INFO L87 Difference]: Start difference. First operand 752 states and 983 transitions. Second operand 7 states. [2019-11-23 22:37:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:09,188 INFO L93 Difference]: Finished difference Result 1783 states and 2362 transitions. [2019-11-23 22:37:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:37:09,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2019-11-23 22:37:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:09,195 INFO L225 Difference]: With dead ends: 1783 [2019-11-23 22:37:09,195 INFO L226 Difference]: Without dead ends: 1322 [2019-11-23 22:37:09,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:37:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-23 22:37:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 793. [2019-11-23 22:37:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-23 22:37:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1029 transitions. [2019-11-23 22:37:09,262 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1029 transitions. Word has length 194 [2019-11-23 22:37:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:09,262 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1029 transitions. [2019-11-23 22:37:09,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:37:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1029 transitions. [2019-11-23 22:37:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 22:37:09,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:09,265 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:37:09,265 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1531612590, now seen corresponding path program 1 times [2019-11-23 22:37:09,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:09,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691144837] [2019-11-23 22:37:09,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:09,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691144837] [2019-11-23 22:37:09,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:09,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:37:09,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907176743] [2019-11-23 22:37:09,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:37:09,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:09,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:37:09,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:37:09,440 INFO L87 Difference]: Start difference. First operand 793 states and 1029 transitions. Second operand 7 states. [2019-11-23 22:37:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:09,937 INFO L93 Difference]: Finished difference Result 1853 states and 2442 transitions. [2019-11-23 22:37:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:37:09,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2019-11-23 22:37:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:09,944 INFO L225 Difference]: With dead ends: 1853 [2019-11-23 22:37:09,944 INFO L226 Difference]: Without dead ends: 1346 [2019-11-23 22:37:09,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:37:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-11-23 22:37:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 812. [2019-11-23 22:37:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2019-11-23 22:37:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1053 transitions. [2019-11-23 22:37:10,020 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1053 transitions. Word has length 194 [2019-11-23 22:37:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:10,020 INFO L462 AbstractCegarLoop]: Abstraction has 812 states and 1053 transitions. [2019-11-23 22:37:10,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:37:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1053 transitions. [2019-11-23 22:37:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-23 22:37:10,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:10,023 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:10,024 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:10,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:10,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1585508679, now seen corresponding path program 1 times [2019-11-23 22:37:10,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:10,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674072705] [2019-11-23 22:37:10,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-23 22:37:10,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674072705] [2019-11-23 22:37:10,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:10,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:37:10,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154579870] [2019-11-23 22:37:10,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:37:10,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:10,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:37:10,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:37:10,118 INFO L87 Difference]: Start difference. First operand 812 states and 1053 transitions. Second operand 4 states. [2019-11-23 22:37:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:10,316 INFO L93 Difference]: Finished difference Result 1467 states and 1930 transitions. [2019-11-23 22:37:10,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:37:10,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-11-23 22:37:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:10,321 INFO L225 Difference]: With dead ends: 1467 [2019-11-23 22:37:10,321 INFO L226 Difference]: Without dead ends: 949 [2019-11-23 22:37:10,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-23 22:37:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-11-23 22:37:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 642. [2019-11-23 22:37:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 22:37:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 822 transitions. [2019-11-23 22:37:10,377 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 822 transitions. Word has length 203 [2019-11-23 22:37:10,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:10,377 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 822 transitions. [2019-11-23 22:37:10,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:37:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 822 transitions. [2019-11-23 22:37:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-23 22:37:10,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:10,381 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:10,381 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1545379130, now seen corresponding path program 1 times [2019-11-23 22:37:10,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:10,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100702422] [2019-11-23 22:37:10,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:10,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100702422] [2019-11-23 22:37:10,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984483719] [2019-11-23 22:37:10,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:10,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 22:37:10,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:37:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:37:11,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:37:11,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2019-11-23 22:37:11,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148374231] [2019-11-23 22:37:11,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:37:11,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:37:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:37:11,079 INFO L87 Difference]: Start difference. First operand 642 states and 822 transitions. Second operand 19 states. [2019-11-23 22:37:36,852 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-11-23 22:37:47,876 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-11-23 22:37:51,987 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-23 22:37:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:56,000 INFO L93 Difference]: Finished difference Result 19537 states and 25738 transitions. [2019-11-23 22:37:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 948 states. [2019-11-23 22:37:56,001 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 226 [2019-11-23 22:37:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:57,455 INFO L225 Difference]: With dead ends: 19537 [2019-11-23 22:37:57,455 INFO L226 Difference]: Without dead ends: 19145 [2019-11-23 22:37:57,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1183 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 962 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443379 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=62902, Invalid=865430, Unknown=0, NotChecked=0, Total=928332 [2019-11-23 22:37:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19145 states. [2019-11-23 22:37:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19145 to 1978. [2019-11-23 22:37:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-11-23 22:37:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2503 transitions. [2019-11-23 22:37:57,864 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2503 transitions. Word has length 226 [2019-11-23 22:37:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:57,864 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 2503 transitions. [2019-11-23 22:37:57,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:37:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2503 transitions. [2019-11-23 22:37:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-23 22:37:57,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:57,872 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:58,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:37:58,076 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:58,076 INFO L82 PathProgramCache]: Analyzing trace with hash 27498942, now seen corresponding path program 1 times [2019-11-23 22:37:58,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:58,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109988930] [2019-11-23 22:37:58,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-23 22:37:58,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109988930] [2019-11-23 22:37:58,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:58,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:58,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283828984] [2019-11-23 22:37:58,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:58,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:58,180 INFO L87 Difference]: Start difference. First operand 1978 states and 2503 transitions. Second operand 3 states. [2019-11-23 22:37:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:58,500 INFO L93 Difference]: Finished difference Result 3901 states and 4927 transitions. [2019-11-23 22:37:58,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:58,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-23 22:37:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:58,506 INFO L225 Difference]: With dead ends: 3901 [2019-11-23 22:37:58,506 INFO L226 Difference]: Without dead ends: 2203 [2019-11-23 22:37:58,509 INFO L630 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-11-23 22:37:58,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2019-11-23 22:37:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1972. [2019-11-23 22:37:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1972 states. [2019-11-23 22:37:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2407 transitions. [2019-11-23 22:37:58,732 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2407 transitions. Word has length 226 [2019-11-23 22:37:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:58,732 INFO L462 AbstractCegarLoop]: Abstraction has 1972 states and 2407 transitions. [2019-11-23 22:37:58,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2407 transitions. [2019-11-23 22:37:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-23 22:37:58,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:58,738 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:58,739 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1407792312, now seen corresponding path program 1 times [2019-11-23 22:37:58,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:58,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35068392] [2019-11-23 22:37:58,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-23 22:37:58,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35068392] [2019-11-23 22:37:58,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:58,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:58,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129011610] [2019-11-23 22:37:58,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:58,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:58,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:58,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:58,859 INFO L87 Difference]: Start difference. First operand 1972 states and 2407 transitions. Second operand 3 states. [2019-11-23 22:37:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:59,159 INFO L93 Difference]: Finished difference Result 5171 states and 6280 transitions. [2019-11-23 22:37:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:59,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-23 22:37:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:59,165 INFO L225 Difference]: With dead ends: 5171 [2019-11-23 22:37:59,165 INFO L226 Difference]: Without dead ends: 3559 [2019-11-23 22:37:59,167 INFO L630 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-11-23 22:37:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2019-11-23 22:37:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 2154. [2019-11-23 22:37:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-11-23 22:37:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2633 transitions. [2019-11-23 22:37:59,553 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2633 transitions. Word has length 226 [2019-11-23 22:37:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:59,554 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 2633 transitions. [2019-11-23 22:37:59,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2633 transitions. [2019-11-23 22:37:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-23 22:37:59,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:59,560 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:59,560 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:59,561 INFO L82 PathProgramCache]: Analyzing trace with hash 440441658, now seen corresponding path program 1 times [2019-11-23 22:37:59,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:59,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870381894] [2019-11-23 22:37:59,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:37:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:37:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-23 22:37:59,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870381894] [2019-11-23 22:37:59,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:37:59,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:37:59,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844301450] [2019-11-23 22:37:59,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:37:59,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:37:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:37:59,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:37:59,654 INFO L87 Difference]: Start difference. First operand 2154 states and 2633 transitions. Second operand 3 states. [2019-11-23 22:37:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:37:59,812 INFO L93 Difference]: Finished difference Result 3944 states and 4828 transitions. [2019-11-23 22:37:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:37:59,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-23 22:37:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:37:59,816 INFO L225 Difference]: With dead ends: 3944 [2019-11-23 22:37:59,816 INFO L226 Difference]: Without dead ends: 2049 [2019-11-23 22:37:59,819 INFO L630 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-11-23 22:37:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2019-11-23 22:37:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2049. [2019-11-23 22:37:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-11-23 22:37:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2484 transitions. [2019-11-23 22:37:59,982 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2484 transitions. Word has length 226 [2019-11-23 22:37:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:37:59,983 INFO L462 AbstractCegarLoop]: Abstraction has 2049 states and 2484 transitions. [2019-11-23 22:37:59,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:37:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2484 transitions. [2019-11-23 22:37:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-23 22:37:59,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:37:59,987 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:37:59,987 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:37:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:37:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1186673582, now seen corresponding path program 1 times [2019-11-23 22:37:59,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:37:59,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523598031] [2019-11-23 22:37:59,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:38:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-23 22:38:00,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523598031] [2019-11-23 22:38:00,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683307554] [2019-11-23 22:38:00,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:38:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:00,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 22:38:00,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:38:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:38:00,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:38:00,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-23 22:38:00,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250349349] [2019-11-23 22:38:00,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 22:38:00,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:38:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 22:38:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:38:00,591 INFO L87 Difference]: Start difference. First operand 2049 states and 2484 transitions. Second operand 16 states. [2019-11-23 22:38:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:38:04,854 INFO L93 Difference]: Finished difference Result 8461 states and 10546 transitions. [2019-11-23 22:38:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-11-23 22:38:04,854 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 227 [2019-11-23 22:38:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:38:04,866 INFO L225 Difference]: With dead ends: 8461 [2019-11-23 22:38:04,867 INFO L226 Difference]: Without dead ends: 6790 [2019-11-23 22:38:04,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4759 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1357, Invalid=12215, Unknown=0, NotChecked=0, Total=13572 [2019-11-23 22:38:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2019-11-23 22:38:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 2666. [2019-11-23 22:38:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2666 states. [2019-11-23 22:38:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 3219 transitions. [2019-11-23 22:38:05,308 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 3219 transitions. Word has length 227 [2019-11-23 22:38:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:38:05,308 INFO L462 AbstractCegarLoop]: Abstraction has 2666 states and 3219 transitions. [2019-11-23 22:38:05,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 22:38:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 3219 transitions. [2019-11-23 22:38:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-23 22:38:05,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:38:05,312 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:38:05,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:38:05,517 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:38:05,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:38:05,518 INFO L82 PathProgramCache]: Analyzing trace with hash -390808351, now seen corresponding path program 1 times [2019-11-23 22:38:05,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:38:05,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070492844] [2019-11-23 22:38:05,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:38:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-11-23 22:38:05,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070492844] [2019-11-23 22:38:05,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:38:05,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:38:05,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878420015] [2019-11-23 22:38:05,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:38:05,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:38:05,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:38:05,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:38:05,580 INFO L87 Difference]: Start difference. First operand 2666 states and 3219 transitions. Second operand 3 states. [2019-11-23 22:38:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:38:05,860 INFO L93 Difference]: Finished difference Result 5026 states and 6057 transitions. [2019-11-23 22:38:05,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:38:05,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-23 22:38:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:38:05,862 INFO L225 Difference]: With dead ends: 5026 [2019-11-23 22:38:05,862 INFO L226 Difference]: Without dead ends: 2373 [2019-11-23 22:38:05,865 INFO L630 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-11-23 22:38:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2019-11-23 22:38:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2019-11-23 22:38:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2373 states. [2019-11-23 22:38:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 2844 transitions. [2019-11-23 22:38:06,270 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 2844 transitions. Word has length 235 [2019-11-23 22:38:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:38:06,271 INFO L462 AbstractCegarLoop]: Abstraction has 2373 states and 2844 transitions. [2019-11-23 22:38:06,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:38:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 2844 transitions. [2019-11-23 22:38:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-23 22:38:06,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:38:06,277 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:38:06,278 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:38:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:38:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1880928432, now seen corresponding path program 1 times [2019-11-23 22:38:06,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:38:06,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390692780] [2019-11-23 22:38:06,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:38:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:38:06,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390692780] [2019-11-23 22:38:06,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555390491] [2019-11-23 22:38:06,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:38:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:06,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 22:38:06,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:38:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-11-23 22:38:06,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:38:06,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-11-23 22:38:06,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492688474] [2019-11-23 22:38:06,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:38:06,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:38:06,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:38:06,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:38:06,678 INFO L87 Difference]: Start difference. First operand 2373 states and 2844 transitions. Second operand 5 states. [2019-11-23 22:38:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:38:06,908 INFO L93 Difference]: Finished difference Result 4434 states and 5339 transitions. [2019-11-23 22:38:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:38:06,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2019-11-23 22:38:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:38:06,910 INFO L225 Difference]: With dead ends: 4434 [2019-11-23 22:38:06,911 INFO L226 Difference]: Without dead ends: 2385 [2019-11-23 22:38:06,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:38:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-11-23 22:38:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2381. [2019-11-23 22:38:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-11-23 22:38:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2848 transitions. [2019-11-23 22:38:07,200 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2848 transitions. Word has length 238 [2019-11-23 22:38:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:38:07,201 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 2848 transitions. [2019-11-23 22:38:07,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:38:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2848 transitions. [2019-11-23 22:38:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 22:38:07,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:38:07,205 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:38:07,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:38:07,409 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:38:07,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:38:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash -189886281, now seen corresponding path program 1 times [2019-11-23 22:38:07,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:38:07,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226952395] [2019-11-23 22:38:07,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:38:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 22:38:07,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226952395] [2019-11-23 22:38:07,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684821390] [2019-11-23 22:38:07,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:38:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:38:07,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 22:38:07,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:38:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 38 proven. 30 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-23 22:38:08,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:38:08,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2019-11-23 22:38:08,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807505389] [2019-11-23 22:38:08,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 22:38:08,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:38:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 22:38:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-11-23 22:38:08,395 INFO L87 Difference]: Start difference. First operand 2381 states and 2848 transitions. Second operand 28 states.