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_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:13:40,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:13:40,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:13:40,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:13:40,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:13:40,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:13:40,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:13:40,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:13:40,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:13:40,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:13:40,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:13:40,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:13:40,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:13:40,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:13:40,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:13:40,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:13:40,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:13:40,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:13:40,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:13:40,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:13:40,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:13:40,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:13:40,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:13:40,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:13:40,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:13:40,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:13:40,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:13:40,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:13:40,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:13:40,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:13:40,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:13:40,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:13:40,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:13:40,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:13:40,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:13:40,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:13:40,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:13:40,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:13:40,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:13:40,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:13:40,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:13:40,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:13:40,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:13:40,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:13:40,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:13:40,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:13:40,316 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:13:40,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:13:40,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:13:40,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:13:40,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:13:40,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:13:40,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:13:40,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:13:40,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:13:40,319 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:13:40,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:13:40,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:13:40,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:13:40,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:13:40,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:13:40,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:13:40,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:13:40,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:13:40,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:13:40,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:13:40,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:13:40,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:13:40,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:13:40,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:13:40,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:13:40,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:13:40,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:13:40,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:13:40,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:13:40,391 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:13:40,392 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:13:40,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6b34947/4bef89b7ad0e419381fab0fddcf21446/FLAG5eff8ba07 [2019-09-08 10:13:41,099 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:13:41,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:13:41,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6b34947/4bef89b7ad0e419381fab0fddcf21446/FLAG5eff8ba07 [2019-09-08 10:13:41,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6b34947/4bef89b7ad0e419381fab0fddcf21446 [2019-09-08 10:13:41,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:13:41,262 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:13:41,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:13:41,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:13:41,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:13:41,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:13:41" (1/1) ... [2019-09-08 10:13:41,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cc6343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:41, skipping insertion in model container [2019-09-08 10:13:41,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:13:41" (1/1) ... [2019-09-08 10:13:41,278 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:13:41,362 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:13:42,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:13:42,093 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:13:42,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:13:42,439 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:13:42,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42 WrapperNode [2019-09-08 10:13:42,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:13:42,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:13:42,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:13:42,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:13:42,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42" (1/1) ... [2019-09-08 10:13:42,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42" (1/1) ... [2019-09-08 10:13:42,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42" (1/1) ... [2019-09-08 10:13:42,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42" (1/1) ... [2019-09-08 10:13:42,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42" (1/1) ... [2019-09-08 10:13:42,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42" (1/1) ... [2019-09-08 10:13:42,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42" (1/1) ... [2019-09-08 10:13:42,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:13:42,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:13:42,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:13:42,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:13:42,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:13:42,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:13:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:13:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:13:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:13:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:13:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:13:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:13:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:13:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:13:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:13:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:13:42,721 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:13:42,721 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:13:42,722 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:13:42,722 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:13:42,722 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:13:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:13:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:13:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:13:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:13:45,168 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:13:45,169 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:13:45,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:13:45 BoogieIcfgContainer [2019-09-08 10:13:45,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:13:45,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:13:45,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:13:45,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:13:45,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:13:41" (1/3) ... [2019-09-08 10:13:45,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc6ad3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:13:45, skipping insertion in model container [2019-09-08 10:13:45,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:42" (2/3) ... [2019-09-08 10:13:45,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc6ad3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:13:45, skipping insertion in model container [2019-09-08 10:13:45,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:13:45" (3/3) ... [2019-09-08 10:13:45,180 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:13:45,190 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:13:45,199 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:13:45,216 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:13:45,254 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:13:45,255 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:13:45,255 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:13:45,255 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:13:45,255 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:13:45,256 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:13:45,256 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:13:45,256 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:13:45,256 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:13:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-09-08 10:13:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 10:13:45,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:45,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:45,325 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:45,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash 326812692, now seen corresponding path program 1 times [2019-09-08 10:13:45,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:45,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:45,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:46,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:46,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:46,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:46,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:46,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:46,192 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 3 states. [2019-09-08 10:13:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:46,433 INFO L93 Difference]: Finished difference Result 1116 states and 1990 transitions. [2019-09-08 10:13:46,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:46,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 10:13:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:46,457 INFO L225 Difference]: With dead ends: 1116 [2019-09-08 10:13:46,457 INFO L226 Difference]: Without dead ends: 914 [2019-09-08 10:13:46,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-08 10:13:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2019-09-08 10:13:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-08 10:13:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1584 transitions. [2019-09-08 10:13:46,576 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1584 transitions. Word has length 208 [2019-09-08 10:13:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:46,577 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1584 transitions. [2019-09-08 10:13:46,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1584 transitions. [2019-09-08 10:13:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 10:13:46,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:46,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:46,583 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:46,584 INFO L82 PathProgramCache]: Analyzing trace with hash -749134671, now seen corresponding path program 1 times [2019-09-08 10:13:46,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:46,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:46,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:46,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:46,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:46,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:46,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:46,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:46,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:46,958 INFO L87 Difference]: Start difference. First operand 912 states and 1584 transitions. Second operand 3 states. [2019-09-08 10:13:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:47,051 INFO L93 Difference]: Finished difference Result 1620 states and 2776 transitions. [2019-09-08 10:13:47,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:47,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 10:13:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:47,071 INFO L225 Difference]: With dead ends: 1620 [2019-09-08 10:13:47,071 INFO L226 Difference]: Without dead ends: 1255 [2019-09-08 10:13:47,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-09-08 10:13:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2019-09-08 10:13:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2019-09-08 10:13:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2156 transitions. [2019-09-08 10:13:47,175 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2156 transitions. Word has length 212 [2019-09-08 10:13:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:47,178 INFO L475 AbstractCegarLoop]: Abstraction has 1253 states and 2156 transitions. [2019-09-08 10:13:47,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2156 transitions. [2019-09-08 10:13:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 10:13:47,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:47,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:47,193 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:47,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:47,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1492476271, now seen corresponding path program 1 times [2019-09-08 10:13:47,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:47,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:47,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:47,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:47,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:47,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:47,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:47,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:47,572 INFO L87 Difference]: Start difference. First operand 1253 states and 2156 transitions. Second operand 3 states. [2019-09-08 10:13:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:47,681 INFO L93 Difference]: Finished difference Result 1954 states and 3340 transitions. [2019-09-08 10:13:47,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:47,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-08 10:13:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:47,703 INFO L225 Difference]: With dead ends: 1954 [2019-09-08 10:13:47,704 INFO L226 Difference]: Without dead ends: 1589 [2019-09-08 10:13:47,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2019-09-08 10:13:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1587. [2019-09-08 10:13:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-09-08 10:13:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2718 transitions. [2019-09-08 10:13:47,789 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2718 transitions. Word has length 216 [2019-09-08 10:13:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:47,790 INFO L475 AbstractCegarLoop]: Abstraction has 1587 states and 2718 transitions. [2019-09-08 10:13:47,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2718 transitions. [2019-09-08 10:13:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 10:13:47,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:47,799 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:47,799 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:47,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2071522764, now seen corresponding path program 1 times [2019-09-08 10:13:47,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:47,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:47,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:47,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:47,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:48,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:48,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:48,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:48,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:48,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:48,175 INFO L87 Difference]: Start difference. First operand 1587 states and 2718 transitions. Second operand 3 states. [2019-09-08 10:13:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:48,309 INFO L93 Difference]: Finished difference Result 3527 states and 5974 transitions. [2019-09-08 10:13:48,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:48,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-08 10:13:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:48,326 INFO L225 Difference]: With dead ends: 3527 [2019-09-08 10:13:48,327 INFO L226 Difference]: Without dead ends: 2524 [2019-09-08 10:13:48,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-09-08 10:13:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2522. [2019-09-08 10:13:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2019-09-08 10:13:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4276 transitions. [2019-09-08 10:13:48,496 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4276 transitions. Word has length 216 [2019-09-08 10:13:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:48,497 INFO L475 AbstractCegarLoop]: Abstraction has 2522 states and 4276 transitions. [2019-09-08 10:13:48,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4276 transitions. [2019-09-08 10:13:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 10:13:48,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:48,502 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:48,502 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:48,502 INFO L82 PathProgramCache]: Analyzing trace with hash -108508146, now seen corresponding path program 1 times [2019-09-08 10:13:48,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:48,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:48,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:48,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:48,721 INFO L87 Difference]: Start difference. First operand 2522 states and 4276 transitions. Second operand 3 states. [2019-09-08 10:13:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:48,890 INFO L93 Difference]: Finished difference Result 4376 states and 7394 transitions. [2019-09-08 10:13:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:48,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-08 10:13:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:48,909 INFO L225 Difference]: With dead ends: 4376 [2019-09-08 10:13:48,909 INFO L226 Difference]: Without dead ends: 3373 [2019-09-08 10:13:48,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2019-09-08 10:13:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3371. [2019-09-08 10:13:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3371 states. [2019-09-08 10:13:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 5694 transitions. [2019-09-08 10:13:49,071 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 5694 transitions. Word has length 220 [2019-09-08 10:13:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:49,071 INFO L475 AbstractCegarLoop]: Abstraction has 3371 states and 5694 transitions. [2019-09-08 10:13:49,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 5694 transitions. [2019-09-08 10:13:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 10:13:49,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:49,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:49,076 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:49,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash 959349905, now seen corresponding path program 1 times [2019-09-08 10:13:49,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:49,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:49,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:49,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:49,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:49,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:49,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:49,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:49,315 INFO L87 Difference]: Start difference. First operand 3371 states and 5694 transitions. Second operand 3 states. [2019-09-08 10:13:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:49,687 INFO L93 Difference]: Finished difference Result 8655 states and 14510 transitions. [2019-09-08 10:13:49,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:49,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-08 10:13:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:49,723 INFO L225 Difference]: With dead ends: 8655 [2019-09-08 10:13:49,723 INFO L226 Difference]: Without dead ends: 5914 [2019-09-08 10:13:49,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-09-08 10:13:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 5912. [2019-09-08 10:13:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-09-08 10:13:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 9894 transitions. [2019-09-08 10:13:50,029 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 9894 transitions. Word has length 220 [2019-09-08 10:13:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:50,031 INFO L475 AbstractCegarLoop]: Abstraction has 5912 states and 9894 transitions. [2019-09-08 10:13:50,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 9894 transitions. [2019-09-08 10:13:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 10:13:50,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:50,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:50,040 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:50,045 INFO L82 PathProgramCache]: Analyzing trace with hash 792658975, now seen corresponding path program 1 times [2019-09-08 10:13:50,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:50,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:50,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:50,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:50,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:50,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:50,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:50,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:50,266 INFO L87 Difference]: Start difference. First operand 5912 states and 9894 transitions. Second operand 3 states. [2019-09-08 10:13:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:50,589 INFO L93 Difference]: Finished difference Result 10846 states and 18152 transitions. [2019-09-08 10:13:50,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:50,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-08 10:13:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:50,663 INFO L225 Difference]: With dead ends: 10846 [2019-09-08 10:13:50,664 INFO L226 Difference]: Without dead ends: 8105 [2019-09-08 10:13:50,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8105 states. [2019-09-08 10:13:51,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8105 to 8103. [2019-09-08 10:13:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8103 states. [2019-09-08 10:13:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13534 transitions. [2019-09-08 10:13:51,285 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13534 transitions. Word has length 224 [2019-09-08 10:13:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:51,286 INFO L475 AbstractCegarLoop]: Abstraction has 8103 states and 13534 transitions. [2019-09-08 10:13:51,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13534 transitions. [2019-09-08 10:13:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 10:13:51,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:51,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:51,291 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:51,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:51,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1043249236, now seen corresponding path program 1 times [2019-09-08 10:13:51,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:51,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:51,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:51,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-09-08 10:13:51,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:51,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:51,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:51,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:51,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:51,488 INFO L87 Difference]: Start difference. First operand 8103 states and 13534 transitions. Second operand 3 states. [2019-09-08 10:13:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:52,173 INFO L93 Difference]: Finished difference Result 22363 states and 37134 transitions. [2019-09-08 10:13:52,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:52,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-08 10:13:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:52,215 INFO L225 Difference]: With dead ends: 22363 [2019-09-08 10:13:52,216 INFO L226 Difference]: Without dead ends: 14936 [2019-09-08 10:13:52,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14936 states. [2019-09-08 10:13:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14936 to 14934. [2019-09-08 10:13:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14934 states. [2019-09-08 10:13:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14934 states to 14934 states and 24712 transitions. [2019-09-08 10:13:53,425 INFO L78 Accepts]: Start accepts. Automaton has 14934 states and 24712 transitions. Word has length 224 [2019-09-08 10:13:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:53,426 INFO L475 AbstractCegarLoop]: Abstraction has 14934 states and 24712 transitions. [2019-09-08 10:13:53,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14934 states and 24712 transitions. [2019-09-08 10:13:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 10:13:53,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:53,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:53,431 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:53,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1254462577, now seen corresponding path program 1 times [2019-09-08 10:13:53,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:53,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:53,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:53,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:53,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:53,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:53,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:13:53,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:13:53,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:13:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:13:53,874 INFO L87 Difference]: Start difference. First operand 14934 states and 24712 transitions. Second operand 7 states. [2019-09-08 10:13:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:58,575 INFO L93 Difference]: Finished difference Result 104767 states and 174000 transitions. [2019-09-08 10:13:58,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:13:58,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2019-09-08 10:13:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:58,862 INFO L225 Difference]: With dead ends: 104767 [2019-09-08 10:13:58,863 INFO L226 Difference]: Without dead ends: 90509 [2019-09-08 10:13:58,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:13:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90509 states. [2019-09-08 10:14:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90509 to 29107. [2019-09-08 10:14:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29107 states. [2019-09-08 10:14:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29107 states to 29107 states and 47961 transitions. [2019-09-08 10:14:01,897 INFO L78 Accepts]: Start accepts. Automaton has 29107 states and 47961 transitions. Word has length 228 [2019-09-08 10:14:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:01,897 INFO L475 AbstractCegarLoop]: Abstraction has 29107 states and 47961 transitions. [2019-09-08 10:14:01,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:14:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 29107 states and 47961 transitions. [2019-09-08 10:14:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 10:14:01,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:01,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:01,903 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash 162908202, now seen corresponding path program 1 times [2019-09-08 10:14:01,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:01,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:01,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:01,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:01,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:02,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:02,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:14:02,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:14:02,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:14:02,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:14:02,103 INFO L87 Difference]: Start difference. First operand 29107 states and 47961 transitions. Second operand 4 states. [2019-09-08 10:14:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:04,850 INFO L93 Difference]: Finished difference Result 79691 states and 131925 transitions. [2019-09-08 10:14:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:14:04,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-08 10:14:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:04,958 INFO L225 Difference]: With dead ends: 79691 [2019-09-08 10:14:04,958 INFO L226 Difference]: Without dead ends: 51308 [2019-09-08 10:14:05,015 INFO L628 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-09-08 10:14:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51308 states. [2019-09-08 10:14:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51308 to 43862. [2019-09-08 10:14:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43862 states. [2019-09-08 10:14:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43862 states to 43862 states and 72426 transitions. [2019-09-08 10:14:08,135 INFO L78 Accepts]: Start accepts. Automaton has 43862 states and 72426 transitions. Word has length 229 [2019-09-08 10:14:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:08,135 INFO L475 AbstractCegarLoop]: Abstraction has 43862 states and 72426 transitions. [2019-09-08 10:14:08,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:14:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 43862 states and 72426 transitions. [2019-09-08 10:14:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 10:14:08,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:08,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:08,141 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:08,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:08,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1006966476, now seen corresponding path program 1 times [2019-09-08 10:14:08,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:08,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:08,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:08,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:08,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:08,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:08,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:08,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:08,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:08,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:08,311 INFO L87 Difference]: Start difference. First operand 43862 states and 72426 transitions. Second operand 3 states. [2019-09-08 10:14:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:10,422 INFO L93 Difference]: Finished difference Result 83756 states and 138614 transitions. [2019-09-08 10:14:10,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:10,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 10:14:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:10,522 INFO L225 Difference]: With dead ends: 83756 [2019-09-08 10:14:10,522 INFO L226 Difference]: Without dead ends: 61182 [2019-09-08 10:14:10,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61182 states. [2019-09-08 10:14:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61182 to 61180. [2019-09-08 10:14:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61180 states. [2019-09-08 10:14:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61180 states to 61180 states and 100889 transitions. [2019-09-08 10:14:14,169 INFO L78 Accepts]: Start accepts. Automaton has 61180 states and 100889 transitions. Word has length 229 [2019-09-08 10:14:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:14,170 INFO L475 AbstractCegarLoop]: Abstraction has 61180 states and 100889 transitions. [2019-09-08 10:14:14,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 61180 states and 100889 transitions. [2019-09-08 10:14:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 10:14:14,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:14,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:14,174 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash 133298612, now seen corresponding path program 1 times [2019-09-08 10:14:14,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:14,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:14,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:14,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:14,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:14,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:14,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:14,334 INFO L87 Difference]: Start difference. First operand 61180 states and 100889 transitions. Second operand 3 states. [2019-09-08 10:14:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:18,532 INFO L93 Difference]: Finished difference Result 133884 states and 222089 transitions. [2019-09-08 10:14:18,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:18,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 10:14:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:18,670 INFO L225 Difference]: With dead ends: 133884 [2019-09-08 10:14:18,670 INFO L226 Difference]: Without dead ends: 92060 [2019-09-08 10:14:18,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92060 states. [2019-09-08 10:14:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92060 to 92058. [2019-09-08 10:14:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92058 states. [2019-09-08 10:14:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92058 states to 92058 states and 151940 transitions. [2019-09-08 10:14:22,531 INFO L78 Accepts]: Start accepts. Automaton has 92058 states and 151940 transitions. Word has length 229 [2019-09-08 10:14:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:22,532 INFO L475 AbstractCegarLoop]: Abstraction has 92058 states and 151940 transitions. [2019-09-08 10:14:22,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 92058 states and 151940 transitions. [2019-09-08 10:14:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:14:22,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:22,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:22,535 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash 689018968, now seen corresponding path program 1 times [2019-09-08 10:14:22,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:22,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:22,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:22,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:22,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:22,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:22,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:14:22,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:14:22,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:14:22,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:14:22,733 INFO L87 Difference]: Start difference. First operand 92058 states and 151940 transitions. Second operand 4 states. [2019-09-08 10:14:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:31,009 INFO L93 Difference]: Finished difference Result 272320 states and 450330 transitions. [2019-09-08 10:14:31,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:14:31,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-08 10:14:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:31,277 INFO L225 Difference]: With dead ends: 272320 [2019-09-08 10:14:31,277 INFO L226 Difference]: Without dead ends: 180903 [2019-09-08 10:14:31,696 INFO L628 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-09-08 10:14:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180903 states. [2019-09-08 10:14:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180903 to 151264. [2019-09-08 10:14:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151264 states. [2019-09-08 10:14:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151264 states to 151264 states and 249210 transitions. [2019-09-08 10:14:41,254 INFO L78 Accepts]: Start accepts. Automaton has 151264 states and 249210 transitions. Word has length 230 [2019-09-08 10:14:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:41,255 INFO L475 AbstractCegarLoop]: Abstraction has 151264 states and 249210 transitions. [2019-09-08 10:14:41,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:14:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 151264 states and 249210 transitions. [2019-09-08 10:14:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 10:14:41,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:41,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:41,257 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash -176858447, now seen corresponding path program 1 times [2019-09-08 10:14:41,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:41,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:41,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:41,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:14:41,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:14:41,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:14:41,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:14:41,459 INFO L87 Difference]: Start difference. First operand 151264 states and 249210 transitions. Second operand 4 states. [2019-09-08 10:14:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:58,371 INFO L93 Difference]: Finished difference Result 446878 states and 737772 transitions. [2019-09-08 10:14:58,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:14:58,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-08 10:14:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:58,787 INFO L225 Difference]: With dead ends: 446878 [2019-09-08 10:14:58,787 INFO L226 Difference]: Without dead ends: 296255 [2019-09-08 10:14:58,900 INFO L628 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-09-08 10:14:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296255 states. [2019-09-08 10:15:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296255 to 248194. [2019-09-08 10:15:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248194 states. [2019-09-08 10:15:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248194 states to 248194 states and 408192 transitions. [2019-09-08 10:15:16,189 INFO L78 Accepts]: Start accepts. Automaton has 248194 states and 408192 transitions. Word has length 231 [2019-09-08 10:15:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:16,189 INFO L475 AbstractCegarLoop]: Abstraction has 248194 states and 408192 transitions. [2019-09-08 10:15:16,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:15:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 248194 states and 408192 transitions. [2019-09-08 10:15:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 10:15:16,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:16,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:15:16,191 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1244696513, now seen corresponding path program 1 times [2019-09-08 10:15:16,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:16,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:16,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:16,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:15:16,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:16,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:15:16,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:15:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:15:16,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:15:16,442 INFO L87 Difference]: Start difference. First operand 248194 states and 408192 transitions. Second operand 4 states. [2019-09-08 10:15:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:43,912 INFO L93 Difference]: Finished difference Result 736225 states and 1213317 transitions. [2019-09-08 10:15:43,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:15:43,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-08 10:15:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:44,673 INFO L225 Difference]: With dead ends: 736225 [2019-09-08 10:15:44,673 INFO L226 Difference]: Without dead ends: 488672 [2019-09-08 10:15:44,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:15:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488672 states. [2019-09-08 10:16:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488672 to 405720. [2019-09-08 10:16:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405720 states. [2019-09-08 10:16:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405720 states to 405720 states and 666142 transitions. [2019-09-08 10:16:19,298 INFO L78 Accepts]: Start accepts. Automaton has 405720 states and 666142 transitions. Word has length 232 [2019-09-08 10:16:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:19,299 INFO L475 AbstractCegarLoop]: Abstraction has 405720 states and 666142 transitions. [2019-09-08 10:16:19,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:16:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 405720 states and 666142 transitions. [2019-09-08 10:16:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 10:16:19,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:19,301 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:19,301 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:19,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:19,302 INFO L82 PathProgramCache]: Analyzing trace with hash 16619832, now seen corresponding path program 1 times [2019-09-08 10:16:19,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:19,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:19,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:19,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:19,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:16:19,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:16:19,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:16:19,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:16:19,571 INFO L87 Difference]: Start difference. First operand 405720 states and 666142 transitions. Second operand 8 states. [2019-09-08 10:18:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:50,793 INFO L93 Difference]: Finished difference Result 2237226 states and 3686619 transitions. [2019-09-08 10:18:50,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 10:18:50,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 233 [2019-09-08 10:18:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:53,867 INFO L225 Difference]: With dead ends: 2237226 [2019-09-08 10:18:53,868 INFO L226 Difference]: Without dead ends: 1832147 [2019-09-08 10:18:54,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-08 10:18:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832147 states. [2019-09-08 10:20:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832147 to 1110422. [2019-09-08 10:20:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110422 states. [2019-09-08 10:21:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110422 states to 1110422 states and 1815836 transitions. [2019-09-08 10:21:00,505 INFO L78 Accepts]: Start accepts. Automaton has 1110422 states and 1815836 transitions. Word has length 233 [2019-09-08 10:21:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:21:00,506 INFO L475 AbstractCegarLoop]: Abstraction has 1110422 states and 1815836 transitions. [2019-09-08 10:21:00,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:21:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1110422 states and 1815836 transitions. [2019-09-08 10:21:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 10:21:12,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:21:12,801 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:21:12,802 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:21:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:21:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1597136680, now seen corresponding path program 1 times [2019-09-08 10:21:12,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:21:12,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:21:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:12,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:21:12,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:21:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:21:13,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:21:13,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:21:13,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:21:13,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:21:13,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:21:13,345 INFO L87 Difference]: Start difference. First operand 1110422 states and 1815836 transitions. Second operand 7 states. [2019-09-08 10:23:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:46,735 INFO L93 Difference]: Finished difference Result 2686663 states and 4398473 transitions. [2019-09-08 10:23:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:23:46,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-09-08 10:23:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:49,563 INFO L225 Difference]: With dead ends: 2686663 [2019-09-08 10:23:49,563 INFO L226 Difference]: Without dead ends: 1576882 [2019-09-08 10:23:50,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:23:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576882 states.