java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:45:17,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:45:17,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:45:17,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:45:17,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:45:17,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:45:17,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:45:17,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:45:17,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:45:17,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:45:17,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:45:17,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:45:17,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:45:17,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:45:17,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:45:17,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:45:17,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:45:17,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:45:17,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:45:17,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:45:17,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:45:17,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:45:17,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:45:17,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:45:17,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:45:17,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:45:17,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:45:17,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:45:17,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:45:17,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:45:17,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:45:17,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:45:17,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:45:17,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:45:17,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:45:17,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:45:17,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:45:17,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:45:17,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:45:17,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:45:17,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:45:17,177 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-10-14 23:45:17,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:45:17,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:45:17,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:45:17,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:45:17,215 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:45:17,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:45:17,215 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:45:17,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:45:17,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:45:17,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:45:17,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:45:17,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:45:17,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:45:17,218 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:45:17,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:45:17,218 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:45:17,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:45:17,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:45:17,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:45:17,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:45:17,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:45:17,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:45:17,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:45:17,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:45:17,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:45:17,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:45:17,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:45:17,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:45:17,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:45:17,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:45:17,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:45:17,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:45:17,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:45:17,521 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:45:17,522 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-14 23:45:17,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb71fe0f/24cb6c6bb02040dfaae2b78f116b92ec/FLAGfbc2e81ba [2019-10-14 23:45:18,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:45:18,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-14 23:45:18,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb71fe0f/24cb6c6bb02040dfaae2b78f116b92ec/FLAGfbc2e81ba [2019-10-14 23:45:18,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb71fe0f/24cb6c6bb02040dfaae2b78f116b92ec [2019-10-14 23:45:18,418 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:45:18,420 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:45:18,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:18,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:45:18,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:45:18,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:18" (1/1) ... [2019-10-14 23:45:18,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d3fd5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:18, skipping insertion in model container [2019-10-14 23:45:18,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:18" (1/1) ... [2019-10-14 23:45:18,434 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:45:18,499 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:45:19,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:19,077 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:45:19,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:19,508 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:45:19,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19 WrapperNode [2019-10-14 23:45:19,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:19,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:45:19,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:45:19,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:45:19,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19" (1/1) ... [2019-10-14 23:45:19,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19" (1/1) ... [2019-10-14 23:45:19,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19" (1/1) ... [2019-10-14 23:45:19,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19" (1/1) ... [2019-10-14 23:45:19,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19" (1/1) ... [2019-10-14 23:45:19,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19" (1/1) ... [2019-10-14 23:45:19,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19" (1/1) ... [2019-10-14 23:45:19,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:45:19,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:45:19,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:45:19,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:45:19,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19" (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-10-14 23:45:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:45:19,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:45:19,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:45:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:45:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:45:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:45:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:45:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:45:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:45:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:45:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:45:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:45:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:45:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:45:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:45:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:45:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:45:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:45:21,166 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:45:21,167 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:45:21,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:21 BoogieIcfgContainer [2019-10-14 23:45:21,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:45:21,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:45:21,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:45:21,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:45:21,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:45:18" (1/3) ... [2019-10-14 23:45:21,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d5a326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:21, skipping insertion in model container [2019-10-14 23:45:21,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:19" (2/3) ... [2019-10-14 23:45:21,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d5a326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:21, skipping insertion in model container [2019-10-14 23:45:21,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:21" (3/3) ... [2019-10-14 23:45:21,177 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-14 23:45:21,189 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:45:21,199 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:45:21,212 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:45:21,245 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:45:21,245 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:45:21,245 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:45:21,245 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:45:21,245 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:45:21,245 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:45:21,246 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:45:21,246 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:45:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2019-10-14 23:45:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-14 23:45:21,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:21,289 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:21,291 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:21,297 INFO L82 PathProgramCache]: Analyzing trace with hash 424996304, now seen corresponding path program 1 times [2019-10-14 23:45:21,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:21,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298511290] [2019-10-14 23:45:21,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:21,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:21,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:22,282 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:22,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298511290] [2019-10-14 23:45:22,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:22,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:22,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965412464] [2019-10-14 23:45:22,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:22,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:22,380 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 4 states. [2019-10-14 23:45:22,723 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-14 23:45:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:24,564 INFO L93 Difference]: Finished difference Result 655 states and 1134 transitions. [2019-10-14 23:45:24,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:24,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-14 23:45:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:24,587 INFO L225 Difference]: With dead ends: 655 [2019-10-14 23:45:24,587 INFO L226 Difference]: Without dead ends: 540 [2019-10-14 23:45:24,595 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-14 23:45:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-10-14 23:45:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-14 23:45:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 803 transitions. [2019-10-14 23:45:24,755 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 803 transitions. Word has length 157 [2019-10-14 23:45:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:24,756 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 803 transitions. [2019-10-14 23:45:24,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 803 transitions. [2019-10-14 23:45:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-14 23:45:24,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:24,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:24,762 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1469457116, now seen corresponding path program 1 times [2019-10-14 23:45:24,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:24,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138572110] [2019-10-14 23:45:24,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:24,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:24,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:25,419 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:25,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138572110] [2019-10-14 23:45:25,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:25,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:25,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155070496] [2019-10-14 23:45:25,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:25,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:25,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:25,491 INFO L87 Difference]: Start difference. First operand 538 states and 803 transitions. Second operand 5 states. [2019-10-14 23:45:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:27,894 INFO L93 Difference]: Finished difference Result 1561 states and 2326 transitions. [2019-10-14 23:45:27,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:27,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-14 23:45:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:27,902 INFO L225 Difference]: With dead ends: 1561 [2019-10-14 23:45:27,902 INFO L226 Difference]: Without dead ends: 1036 [2019-10-14 23:45:27,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-10-14 23:45:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2019-10-14 23:45:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-14 23:45:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1529 transitions. [2019-10-14 23:45:27,971 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1529 transitions. Word has length 157 [2019-10-14 23:45:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:27,972 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1529 transitions. [2019-10-14 23:45:27,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1529 transitions. [2019-10-14 23:45:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-14 23:45:27,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:27,976 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:27,977 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash -790671312, now seen corresponding path program 1 times [2019-10-14 23:45:27,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:27,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824550966] [2019-10-14 23:45:27,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:27,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:27,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:28,334 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:28,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824550966] [2019-10-14 23:45:28,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:28,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:28,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834057131] [2019-10-14 23:45:28,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:28,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:28,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:28,396 INFO L87 Difference]: Start difference. First operand 1034 states and 1529 transitions. Second operand 4 states. [2019-10-14 23:45:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:30,461 INFO L93 Difference]: Finished difference Result 3056 states and 4517 transitions. [2019-10-14 23:45:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:30,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-14 23:45:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:30,474 INFO L225 Difference]: With dead ends: 3056 [2019-10-14 23:45:30,474 INFO L226 Difference]: Without dead ends: 2054 [2019-10-14 23:45:30,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2019-10-14 23:45:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1036. [2019-10-14 23:45:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-10-14 23:45:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1531 transitions. [2019-10-14 23:45:30,547 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1531 transitions. Word has length 158 [2019-10-14 23:45:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:30,548 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1531 transitions. [2019-10-14 23:45:30,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1531 transitions. [2019-10-14 23:45:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-14 23:45:30,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:30,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:30,553 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1966932605, now seen corresponding path program 1 times [2019-10-14 23:45:30,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:30,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139374709] [2019-10-14 23:45:30,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:30,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:30,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:31,074 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:31,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139374709] [2019-10-14 23:45:31,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:31,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:31,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257213099] [2019-10-14 23:45:31,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:31,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:31,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:31,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:31,143 INFO L87 Difference]: Start difference. First operand 1036 states and 1531 transitions. Second operand 5 states. [2019-10-14 23:45:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:32,796 INFO L93 Difference]: Finished difference Result 2054 states and 3037 transitions. [2019-10-14 23:45:32,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:32,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-14 23:45:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:32,807 INFO L225 Difference]: With dead ends: 2054 [2019-10-14 23:45:32,807 INFO L226 Difference]: Without dead ends: 1036 [2019-10-14 23:45:32,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-10-14 23:45:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1035. [2019-10-14 23:45:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-10-14 23:45:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1528 transitions. [2019-10-14 23:45:32,881 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1528 transitions. Word has length 159 [2019-10-14 23:45:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:32,882 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1528 transitions. [2019-10-14 23:45:32,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1528 transitions. [2019-10-14 23:45:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-14 23:45:32,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:32,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:32,888 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash 745680526, now seen corresponding path program 1 times [2019-10-14 23:45:32,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:32,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011309427] [2019-10-14 23:45:32,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:32,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:32,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:33,258 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:33,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011309427] [2019-10-14 23:45:33,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:33,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:33,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234201920] [2019-10-14 23:45:33,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:33,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:33,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:33,317 INFO L87 Difference]: Start difference. First operand 1035 states and 1528 transitions. Second operand 4 states. [2019-10-14 23:45:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:35,813 INFO L93 Difference]: Finished difference Result 2834 states and 4197 transitions. [2019-10-14 23:45:35,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:35,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-14 23:45:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:35,825 INFO L225 Difference]: With dead ends: 2834 [2019-10-14 23:45:35,825 INFO L226 Difference]: Without dead ends: 1997 [2019-10-14 23:45:35,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:35,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-10-14 23:45:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1995. [2019-10-14 23:45:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-10-14 23:45:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2918 transitions. [2019-10-14 23:45:35,910 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2918 transitions. Word has length 159 [2019-10-14 23:45:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:35,911 INFO L462 AbstractCegarLoop]: Abstraction has 1995 states and 2918 transitions. [2019-10-14 23:45:35,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2918 transitions. [2019-10-14 23:45:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-14 23:45:35,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:35,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:35,917 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:35,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1379415471, now seen corresponding path program 1 times [2019-10-14 23:45:35,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:35,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499861873] [2019-10-14 23:45:35,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:35,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:35,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:36,394 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:36,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499861873] [2019-10-14 23:45:36,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:36,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:36,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901900456] [2019-10-14 23:45:36,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:36,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:36,479 INFO L87 Difference]: Start difference. First operand 1995 states and 2918 transitions. Second operand 5 states. [2019-10-14 23:45:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:37,924 INFO L93 Difference]: Finished difference Result 3337 states and 4898 transitions. [2019-10-14 23:45:37,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:37,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-14 23:45:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:37,934 INFO L225 Difference]: With dead ends: 3337 [2019-10-14 23:45:37,934 INFO L226 Difference]: Without dead ends: 1528 [2019-10-14 23:45:37,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2019-10-14 23:45:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2019-10-14 23:45:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-10-14 23:45:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2228 transitions. [2019-10-14 23:45:38,019 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2228 transitions. Word has length 159 [2019-10-14 23:45:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:38,019 INFO L462 AbstractCegarLoop]: Abstraction has 1528 states and 2228 transitions. [2019-10-14 23:45:38,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2228 transitions. [2019-10-14 23:45:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-14 23:45:38,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:38,024 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:38,024 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash -51426036, now seen corresponding path program 1 times [2019-10-14 23:45:38,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:38,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940194622] [2019-10-14 23:45:38,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:38,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:38,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:38,383 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:38,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940194622] [2019-10-14 23:45:38,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:38,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:38,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212025816] [2019-10-14 23:45:38,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:38,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:38,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:38,419 INFO L87 Difference]: Start difference. First operand 1528 states and 2228 transitions. Second operand 4 states. [2019-10-14 23:45:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:40,320 INFO L93 Difference]: Finished difference Result 3607 states and 5375 transitions. [2019-10-14 23:45:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:40,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-14 23:45:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:40,332 INFO L225 Difference]: With dead ends: 3607 [2019-10-14 23:45:40,332 INFO L226 Difference]: Without dead ends: 2268 [2019-10-14 23:45:40,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-10-14 23:45:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1952. [2019-10-14 23:45:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-10-14 23:45:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2916 transitions. [2019-10-14 23:45:40,418 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2916 transitions. Word has length 161 [2019-10-14 23:45:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:40,418 INFO L462 AbstractCegarLoop]: Abstraction has 1952 states and 2916 transitions. [2019-10-14 23:45:40,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2916 transitions. [2019-10-14 23:45:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-14 23:45:40,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:40,422 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:40,423 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash -541662678, now seen corresponding path program 1 times [2019-10-14 23:45:40,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:40,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413705619] [2019-10-14 23:45:40,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:40,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:40,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:40,733 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:40,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413705619] [2019-10-14 23:45:40,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:40,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:40,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277447887] [2019-10-14 23:45:40,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:40,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:40,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:40,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:40,779 INFO L87 Difference]: Start difference. First operand 1952 states and 2916 transitions. Second operand 4 states. [2019-10-14 23:45:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:42,591 INFO L93 Difference]: Finished difference Result 4665 states and 7121 transitions. [2019-10-14 23:45:42,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:42,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-14 23:45:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:42,604 INFO L225 Difference]: With dead ends: 4665 [2019-10-14 23:45:42,604 INFO L226 Difference]: Without dead ends: 2986 [2019-10-14 23:45:42,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-10-14 23:45:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2706. [2019-10-14 23:45:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-10-14 23:45:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4137 transitions. [2019-10-14 23:45:42,726 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4137 transitions. Word has length 163 [2019-10-14 23:45:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:42,727 INFO L462 AbstractCegarLoop]: Abstraction has 2706 states and 4137 transitions. [2019-10-14 23:45:42,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4137 transitions. [2019-10-14 23:45:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-14 23:45:42,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:42,730 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:42,731 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:42,731 INFO L82 PathProgramCache]: Analyzing trace with hash 911873176, now seen corresponding path program 1 times [2019-10-14 23:45:42,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:42,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099821781] [2019-10-14 23:45:42,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:42,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:42,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:43,157 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:43,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099821781] [2019-10-14 23:45:43,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:43,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:43,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857312836] [2019-10-14 23:45:43,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:45:43,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:43,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:45:43,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:43,213 INFO L87 Difference]: Start difference. First operand 2706 states and 4137 transitions. Second operand 6 states. [2019-10-14 23:45:43,484 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-10-14 23:45:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:45,032 INFO L93 Difference]: Finished difference Result 7601 states and 11754 transitions. [2019-10-14 23:45:45,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:45:45,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-10-14 23:45:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:45,060 INFO L225 Difference]: With dead ends: 7601 [2019-10-14 23:45:45,061 INFO L226 Difference]: Without dead ends: 5078 [2019-10-14 23:45:45,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:45:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-10-14 23:45:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5076. [2019-10-14 23:45:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-10-14 23:45:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7791 transitions. [2019-10-14 23:45:45,303 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7791 transitions. Word has length 164 [2019-10-14 23:45:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:45,303 INFO L462 AbstractCegarLoop]: Abstraction has 5076 states and 7791 transitions. [2019-10-14 23:45:45,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:45:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7791 transitions. [2019-10-14 23:45:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-14 23:45:45,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:45,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:45,312 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:45,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2112908957, now seen corresponding path program 1 times [2019-10-14 23:45:45,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:45,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542506149] [2019-10-14 23:45:45,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:45,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:45,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:45,762 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:45,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542506149] [2019-10-14 23:45:45,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:45,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:45,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454949508] [2019-10-14 23:45:45,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:45,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:45,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:45,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:45,814 INFO L87 Difference]: Start difference. First operand 5076 states and 7791 transitions. Second operand 5 states. [2019-10-14 23:45:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:48,230 INFO L93 Difference]: Finished difference Result 13239 states and 20333 transitions. [2019-10-14 23:45:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:48,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-10-14 23:45:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:48,263 INFO L225 Difference]: With dead ends: 13239 [2019-10-14 23:45:48,263 INFO L226 Difference]: Without dead ends: 8194 [2019-10-14 23:45:48,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states. [2019-10-14 23:45:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8192. [2019-10-14 23:45:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8192 states. [2019-10-14 23:45:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 12471 transitions. [2019-10-14 23:45:48,688 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 12471 transitions. Word has length 164 [2019-10-14 23:45:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:48,689 INFO L462 AbstractCegarLoop]: Abstraction has 8192 states and 12471 transitions. [2019-10-14 23:45:48,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 12471 transitions. [2019-10-14 23:45:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-14 23:45:48,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:48,696 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:48,696 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:48,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1008257189, now seen corresponding path program 1 times [2019-10-14 23:45:48,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:48,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130764282] [2019-10-14 23:45:48,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:48,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:48,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:49,027 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:49,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130764282] [2019-10-14 23:45:49,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:49,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:49,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640643770] [2019-10-14 23:45:49,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:49,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:49,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:49,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:49,087 INFO L87 Difference]: Start difference. First operand 8192 states and 12471 transitions. Second operand 4 states. [2019-10-14 23:45:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:51,020 INFO L93 Difference]: Finished difference Result 20555 states and 31330 transitions. [2019-10-14 23:45:51,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:51,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-14 23:45:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:51,050 INFO L225 Difference]: With dead ends: 20555 [2019-10-14 23:45:51,050 INFO L226 Difference]: Without dead ends: 12739 [2019-10-14 23:45:51,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2019-10-14 23:45:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 12737. [2019-10-14 23:45:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12737 states. [2019-10-14 23:45:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 19158 transitions. [2019-10-14 23:45:51,640 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 19158 transitions. Word has length 166 [2019-10-14 23:45:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:51,641 INFO L462 AbstractCegarLoop]: Abstraction has 12737 states and 19158 transitions. [2019-10-14 23:45:51,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 19158 transitions. [2019-10-14 23:45:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-14 23:45:51,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:51,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:51,659 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1356015054, now seen corresponding path program 1 times [2019-10-14 23:45:51,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:51,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340571518] [2019-10-14 23:45:51,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:51,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:51,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:51,998 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:52,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340571518] [2019-10-14 23:45:52,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:52,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:52,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853263495] [2019-10-14 23:45:52,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:52,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:52,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:52,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:52,038 INFO L87 Difference]: Start difference. First operand 12737 states and 19158 transitions. Second operand 4 states.