java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:36:53,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:36:53,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:36:53,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:36:53,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:36:53,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:36:53,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:36:53,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:36:53,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:36:53,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:36:53,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:36:53,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:36:53,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:36:53,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:36:53,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:36:53,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:36:53,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:36:53,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:36:53,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:36:53,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:36:53,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:36:53,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:36:53,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:36:53,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:36:53,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:36:53,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:36:53,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:36:53,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:36:53,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:36:53,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:36:53,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:36:53,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:36:53,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:36:53,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:36:53,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:36:53,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:36:53,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:36:53,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:36:53,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:36:53,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:36:53,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:36:53,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:36:53,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:36:53,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:36:53,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:36:53,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:36:53,220 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:36:53,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:36:53,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:36:53,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:36:53,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:36:53,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:36:53,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:36:53,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:36:53,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:36:53,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:36:53,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:36:53,222 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:36:53,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:36:53,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:36:53,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:36:53,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:36:53,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:36:53,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:36:53,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:36:53,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:36:53,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:36:53,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:36:53,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:36:53,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:36:53,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:36:53,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:36:53,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:36:53,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:36:53,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:36:53,280 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:36:53,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:36:53,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3270409fd/4329a7fc890e43cab2eb7a36f05b784b/FLAGb3dcbcfeb [2019-09-08 13:36:54,034 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:36:54,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:36:54,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3270409fd/4329a7fc890e43cab2eb7a36f05b784b/FLAGb3dcbcfeb [2019-09-08 13:36:54,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3270409fd/4329a7fc890e43cab2eb7a36f05b784b [2019-09-08 13:36:54,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:36:54,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:36:54,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:36:54,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:36:54,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:36:54,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:36:54" (1/1) ... [2019-09-08 13:36:54,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61123b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:54, skipping insertion in model container [2019-09-08 13:36:54,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:36:54" (1/1) ... [2019-09-08 13:36:54,229 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:36:54,335 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:36:55,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:36:55,128 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:36:55,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:36:55,407 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:36:55,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55 WrapperNode [2019-09-08 13:36:55,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:36:55,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:36:55,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:36:55,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:36:55,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55" (1/1) ... [2019-09-08 13:36:55,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55" (1/1) ... [2019-09-08 13:36:55,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55" (1/1) ... [2019-09-08 13:36:55,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55" (1/1) ... [2019-09-08 13:36:55,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55" (1/1) ... [2019-09-08 13:36:55,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55" (1/1) ... [2019-09-08 13:36:55,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55" (1/1) ... [2019-09-08 13:36:55,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:36:55,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:36:55,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:36:55,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:36:55,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:36:55,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:36:55,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:36:55,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:36:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:36:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:36:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:36:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:36:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:36:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:36:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:36:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:36:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:36:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:36:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:36:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:36:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:36:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:36:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:36:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:36:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:36:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:36:58,310 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:36:58,310 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:36:58,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:36:58 BoogieIcfgContainer [2019-09-08 13:36:58,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:36:58,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:36:58,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:36:58,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:36:58,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:36:54" (1/3) ... [2019-09-08 13:36:58,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446de4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:36:58, skipping insertion in model container [2019-09-08 13:36:58,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:55" (2/3) ... [2019-09-08 13:36:58,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446de4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:36:58, skipping insertion in model container [2019-09-08 13:36:58,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:36:58" (3/3) ... [2019-09-08 13:36:58,322 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:36:58,333 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:36:58,343 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:36:58,363 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:36:58,407 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:36:58,408 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:36:58,408 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:36:58,409 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:36:58,409 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:36:58,409 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:36:58,409 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:36:58,410 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:36:58,410 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:36:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states. [2019-09-08 13:36:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 13:36:58,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:36:58,476 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] [2019-09-08 13:36:58,478 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:36:58,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:36:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1476174912, now seen corresponding path program 1 times [2019-09-08 13:36:58,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:36:58,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:36:58,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:58,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:36:58,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:36:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:36:59,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:36:59,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:36:59,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:36:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:36:59,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:36:59,460 INFO L87 Difference]: Start difference. First operand 785 states. Second operand 3 states. [2019-09-08 13:36:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:36:59,858 INFO L93 Difference]: Finished difference Result 1237 states and 2188 transitions. [2019-09-08 13:36:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:36:59,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-08 13:36:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:36:59,888 INFO L225 Difference]: With dead ends: 1237 [2019-09-08 13:36:59,888 INFO L226 Difference]: Without dead ends: 996 [2019-09-08 13:36:59,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:36:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-09-08 13:37:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 993. [2019-09-08 13:37:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 13:37:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1714 transitions. [2019-09-08 13:37:00,042 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1714 transitions. Word has length 217 [2019-09-08 13:37:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:00,046 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1714 transitions. [2019-09-08 13:37:00,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1714 transitions. [2019-09-08 13:37:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 13:37:00,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:00,060 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] [2019-09-08 13:37:00,061 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:00,062 INFO L82 PathProgramCache]: Analyzing trace with hash 590177669, now seen corresponding path program 1 times [2019-09-08 13:37:00,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:00,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:00,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:00,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:00,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:00,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:00,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:00,403 INFO L87 Difference]: Start difference. First operand 993 states and 1714 transitions. Second operand 3 states. [2019-09-08 13:37:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:00,492 INFO L93 Difference]: Finished difference Result 1851 states and 3154 transitions. [2019-09-08 13:37:00,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:00,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-09-08 13:37:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:00,511 INFO L225 Difference]: With dead ends: 1851 [2019-09-08 13:37:00,512 INFO L226 Difference]: Without dead ends: 1410 [2019-09-08 13:37:00,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2019-09-08 13:37:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1406. [2019-09-08 13:37:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1406 states. [2019-09-08 13:37:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2405 transitions. [2019-09-08 13:37:00,596 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2405 transitions. Word has length 221 [2019-09-08 13:37:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:00,598 INFO L475 AbstractCegarLoop]: Abstraction has 1406 states and 2405 transitions. [2019-09-08 13:37:00,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2405 transitions. [2019-09-08 13:37:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 13:37:00,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:00,608 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] [2019-09-08 13:37:00,609 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash 993447882, now seen corresponding path program 1 times [2019-09-08 13:37:00,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:00,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:00,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:00,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:00,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:01,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:01,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:01,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:01,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:01,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:01,211 INFO L87 Difference]: Start difference. First operand 1406 states and 2405 transitions. Second operand 3 states. [2019-09-08 13:37:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:01,324 INFO L93 Difference]: Finished difference Result 3066 states and 5183 transitions. [2019-09-08 13:37:01,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:01,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-08 13:37:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:01,342 INFO L225 Difference]: With dead ends: 3066 [2019-09-08 13:37:01,351 INFO L226 Difference]: Without dead ends: 2212 [2019-09-08 13:37:01,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2019-09-08 13:37:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2206. [2019-09-08 13:37:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-09-08 13:37:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3737 transitions. [2019-09-08 13:37:01,456 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3737 transitions. Word has length 225 [2019-09-08 13:37:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:01,457 INFO L475 AbstractCegarLoop]: Abstraction has 2206 states and 3737 transitions. [2019-09-08 13:37:01,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3737 transitions. [2019-09-08 13:37:01,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 13:37:01,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:01,463 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 13:37:01,463 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:01,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:01,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2006883697, now seen corresponding path program 1 times [2019-09-08 13:37:01,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:01,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:01,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:01,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:01,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:01,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:01,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:01,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:01,755 INFO L87 Difference]: Start difference. First operand 2206 states and 3737 transitions. Second operand 3 states. [2019-09-08 13:37:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:01,951 INFO L93 Difference]: Finished difference Result 5418 states and 9091 transitions. [2019-09-08 13:37:01,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:01,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 13:37:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:01,975 INFO L225 Difference]: With dead ends: 5418 [2019-09-08 13:37:01,975 INFO L226 Difference]: Without dead ends: 3764 [2019-09-08 13:37:01,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2019-09-08 13:37:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3754. [2019-09-08 13:37:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2019-09-08 13:37:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 6301 transitions. [2019-09-08 13:37:02,237 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 6301 transitions. Word has length 229 [2019-09-08 13:37:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:02,238 INFO L475 AbstractCegarLoop]: Abstraction has 3754 states and 6301 transitions. [2019-09-08 13:37:02,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 6301 transitions. [2019-09-08 13:37:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 13:37:02,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:02,245 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 13:37:02,245 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1918804652, now seen corresponding path program 1 times [2019-09-08 13:37:02,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:02,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:02,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:02,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:02,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:02,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:02,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:02,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:02,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:02,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:02,494 INFO L87 Difference]: Start difference. First operand 3754 states and 6301 transitions. Second operand 3 states. [2019-09-08 13:37:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:02,792 INFO L93 Difference]: Finished difference Result 9966 states and 16607 transitions. [2019-09-08 13:37:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:02,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-08 13:37:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:02,828 INFO L225 Difference]: With dead ends: 9966 [2019-09-08 13:37:02,828 INFO L226 Difference]: Without dead ends: 6764 [2019-09-08 13:37:02,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2019-09-08 13:37:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 6746. [2019-09-08 13:37:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6746 states. [2019-09-08 13:37:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 11229 transitions. [2019-09-08 13:37:03,253 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 11229 transitions. Word has length 233 [2019-09-08 13:37:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:03,254 INFO L475 AbstractCegarLoop]: Abstraction has 6746 states and 11229 transitions. [2019-09-08 13:37:03,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 11229 transitions. [2019-09-08 13:37:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 13:37:03,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:03,265 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, 1, 1] [2019-09-08 13:37:03,265 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:03,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:03,266 INFO L82 PathProgramCache]: Analyzing trace with hash -262750311, now seen corresponding path program 1 times [2019-09-08 13:37:03,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:03,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:03,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:03,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:03,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:37:03,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:37:03,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:37:03,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:37:03,774 INFO L87 Difference]: Start difference. First operand 6746 states and 11229 transitions. Second operand 7 states. [2019-09-08 13:37:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:06,858 INFO L93 Difference]: Finished difference Result 41324 states and 68800 transitions. [2019-09-08 13:37:06,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 13:37:06,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2019-09-08 13:37:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:06,982 INFO L225 Difference]: With dead ends: 41324 [2019-09-08 13:37:06,982 INFO L226 Difference]: Without dead ends: 35130 [2019-09-08 13:37:07,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 13:37:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35130 states. [2019-09-08 13:37:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35130 to 12778. [2019-09-08 13:37:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12778 states. [2019-09-08 13:37:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12778 states to 12778 states and 21183 transitions. [2019-09-08 13:37:08,048 INFO L78 Accepts]: Start accepts. Automaton has 12778 states and 21183 transitions. Word has length 237 [2019-09-08 13:37:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:08,051 INFO L475 AbstractCegarLoop]: Abstraction has 12778 states and 21183 transitions. [2019-09-08 13:37:08,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:37:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 12778 states and 21183 transitions. [2019-09-08 13:37:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 13:37:08,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:08,061 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, 1, 1, 1] [2019-09-08 13:37:08,062 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash 373948977, now seen corresponding path program 1 times [2019-09-08 13:37:08,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:08,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:08,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:08,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:08,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:08,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:08,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:37:08,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:37:08,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:37:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:37:08,401 INFO L87 Difference]: Start difference. First operand 12778 states and 21183 transitions. Second operand 4 states. [2019-09-08 13:37:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:09,420 INFO L93 Difference]: Finished difference Result 34306 states and 56966 transitions. [2019-09-08 13:37:09,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:37:09,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-08 13:37:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:09,487 INFO L225 Difference]: With dead ends: 34306 [2019-09-08 13:37:09,488 INFO L226 Difference]: Without dead ends: 22080 [2019-09-08 13:37:09,522 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 13:37:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22080 states. [2019-09-08 13:37:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22080 to 19004. [2019-09-08 13:37:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19004 states. [2019-09-08 13:37:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19004 states to 19004 states and 31524 transitions. [2019-09-08 13:37:10,602 INFO L78 Accepts]: Start accepts. Automaton has 19004 states and 31524 transitions. Word has length 238 [2019-09-08 13:37:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:10,603 INFO L475 AbstractCegarLoop]: Abstraction has 19004 states and 31524 transitions. [2019-09-08 13:37:10,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 19004 states and 31524 transitions. [2019-09-08 13:37:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:37:10,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:10,615 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, 1, 1, 1, 1] [2019-09-08 13:37:10,616 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:10,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:10,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1358651552, now seen corresponding path program 1 times [2019-09-08 13:37:10,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:10,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:10,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:10,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:10,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:37:10,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:37:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:37:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:37:10,836 INFO L87 Difference]: Start difference. First operand 19004 states and 31524 transitions. Second operand 4 states. [2019-09-08 13:37:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:12,130 INFO L93 Difference]: Finished difference Result 51296 states and 85140 transitions. [2019-09-08 13:37:12,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:37:12,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-08 13:37:12,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:12,235 INFO L225 Difference]: With dead ends: 51296 [2019-09-08 13:37:12,235 INFO L226 Difference]: Without dead ends: 32844 [2019-09-08 13:37:12,290 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 13:37:12,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32844 states. [2019-09-08 13:37:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32844 to 28302. [2019-09-08 13:37:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28302 states. [2019-09-08 13:37:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28302 states to 28302 states and 46897 transitions. [2019-09-08 13:37:14,485 INFO L78 Accepts]: Start accepts. Automaton has 28302 states and 46897 transitions. Word has length 239 [2019-09-08 13:37:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:14,485 INFO L475 AbstractCegarLoop]: Abstraction has 28302 states and 46897 transitions. [2019-09-08 13:37:14,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28302 states and 46897 transitions. [2019-09-08 13:37:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 13:37:14,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:14,499 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, 1, 1, 1, 1, 1] [2019-09-08 13:37:14,499 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:14,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash 769864920, now seen corresponding path program 1 times [2019-09-08 13:37:14,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:14,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:14,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:14,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:14,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:14,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:14,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:37:14,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:37:14,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:37:14,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:37:14,896 INFO L87 Difference]: Start difference. First operand 28302 states and 46897 transitions. Second operand 4 states. [2019-09-08 13:37:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:16,746 INFO L93 Difference]: Finished difference Result 77344 states and 128268 transitions. [2019-09-08 13:37:16,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:37:16,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 13:37:16,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:16,825 INFO L225 Difference]: With dead ends: 77344 [2019-09-08 13:37:16,825 INFO L226 Difference]: Without dead ends: 49594 [2019-09-08 13:37:16,878 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 13:37:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49594 states. [2019-09-08 13:37:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49594 to 42178. [2019-09-08 13:37:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42178 states. [2019-09-08 13:37:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42178 states to 42178 states and 69829 transitions. [2019-09-08 13:37:20,080 INFO L78 Accepts]: Start accepts. Automaton has 42178 states and 69829 transitions. Word has length 240 [2019-09-08 13:37:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:20,081 INFO L475 AbstractCegarLoop]: Abstraction has 42178 states and 69829 transitions. [2019-09-08 13:37:20,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 42178 states and 69829 transitions. [2019-09-08 13:37:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 13:37:20,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:20,100 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, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:20,101 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:20,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:20,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1605280074, now seen corresponding path program 1 times [2019-09-08 13:37:20,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:20,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:20,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:20,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:20,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:20,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:20,268 INFO L87 Difference]: Start difference. First operand 42178 states and 69829 transitions. Second operand 3 states. [2019-09-08 13:37:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:22,532 INFO L93 Difference]: Finished difference Result 93834 states and 155374 transitions. [2019-09-08 13:37:22,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:22,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 13:37:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:22,634 INFO L225 Difference]: With dead ends: 93834 [2019-09-08 13:37:22,634 INFO L226 Difference]: Without dead ends: 65264 [2019-09-08 13:37:22,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65264 states. [2019-09-08 13:37:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65264 to 65262. [2019-09-08 13:37:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65262 states. [2019-09-08 13:37:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65262 states to 65262 states and 107804 transitions. [2019-09-08 13:37:27,135 INFO L78 Accepts]: Start accepts. Automaton has 65262 states and 107804 transitions. Word has length 241 [2019-09-08 13:37:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:27,136 INFO L475 AbstractCegarLoop]: Abstraction has 65262 states and 107804 transitions. [2019-09-08 13:37:27,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 65262 states and 107804 transitions. [2019-09-08 13:37:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 13:37:27,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:27,145 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, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:27,145 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1855446932, now seen corresponding path program 1 times [2019-09-08 13:37:27,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:27,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:27,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:27,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:27,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:27,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:27,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:27,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:27,308 INFO L87 Difference]: Start difference. First operand 65262 states and 107804 transitions. Second operand 3 states. [2019-09-08 13:37:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:30,801 INFO L93 Difference]: Finished difference Result 144944 states and 239508 transitions. [2019-09-08 13:37:30,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:30,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 13:37:30,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:30,958 INFO L225 Difference]: With dead ends: 144944 [2019-09-08 13:37:30,959 INFO L226 Difference]: Without dead ends: 100534 [2019-09-08 13:37:31,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100534 states. [2019-09-08 13:37:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100534 to 100532. [2019-09-08 13:37:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100532 states. [2019-09-08 13:37:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100532 states to 100532 states and 165663 transitions. [2019-09-08 13:37:37,260 INFO L78 Accepts]: Start accepts. Automaton has 100532 states and 165663 transitions. Word has length 241 [2019-09-08 13:37:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:37,261 INFO L475 AbstractCegarLoop]: Abstraction has 100532 states and 165663 transitions. [2019-09-08 13:37:37,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 100532 states and 165663 transitions. [2019-09-08 13:37:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 13:37:37,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:37,265 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, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:37,265 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:37,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:37,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1177705458, now seen corresponding path program 1 times [2019-09-08 13:37:37,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:37,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:37,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:37,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:37,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:37,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:37,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:37,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:37,437 INFO L87 Difference]: Start difference. First operand 100532 states and 165663 transitions. Second operand 3 states. [2019-09-08 13:37:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:44,474 INFO L93 Difference]: Finished difference Result 195192 states and 321929 transitions. [2019-09-08 13:37:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:44,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 13:37:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:44,679 INFO L225 Difference]: With dead ends: 195192 [2019-09-08 13:37:44,680 INFO L226 Difference]: Without dead ends: 141916 [2019-09-08 13:37:44,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141916 states. [2019-09-08 13:37:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141916 to 141914. [2019-09-08 13:37:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141914 states. [2019-09-08 13:37:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141914 states to 141914 states and 233379 transitions. [2019-09-08 13:37:50,400 INFO L78 Accepts]: Start accepts. Automaton has 141914 states and 233379 transitions. Word has length 241 [2019-09-08 13:37:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:50,401 INFO L475 AbstractCegarLoop]: Abstraction has 141914 states and 233379 transitions. [2019-09-08 13:37:50,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 141914 states and 233379 transitions. [2019-09-08 13:37:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 13:37:50,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:50,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:50,405 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1164563408, now seen corresponding path program 1 times [2019-09-08 13:37:50,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:50,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:50,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:50,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:50,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:50,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:50,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:50,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:50,601 INFO L87 Difference]: Start difference. First operand 141914 states and 233379 transitions. Second operand 3 states. [2019-09-08 13:38:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:00,504 INFO L93 Difference]: Finished difference Result 273794 states and 450735 transitions. [2019-09-08 13:38:00,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:38:00,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 13:38:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:00,827 INFO L225 Difference]: With dead ends: 273794 [2019-09-08 13:38:00,827 INFO L226 Difference]: Without dead ends: 198908 [2019-09-08 13:38:00,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 13:38:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198908 states. [2019-09-08 13:38:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198908 to 198906. [2019-09-08 13:38:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198906 states. [2019-09-08 13:38:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198906 states to 198906 states and 326390 transitions. [2019-09-08 13:38:12,798 INFO L78 Accepts]: Start accepts. Automaton has 198906 states and 326390 transitions. Word has length 241 [2019-09-08 13:38:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:12,798 INFO L475 AbstractCegarLoop]: Abstraction has 198906 states and 326390 transitions. [2019-09-08 13:38:12,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 198906 states and 326390 transitions. [2019-09-08 13:38:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 13:38:12,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38: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, 1, 1, 1, 1, 1, 1] [2019-09-08 13:38:12,801 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1961043161, now seen corresponding path program 1 times [2019-09-08 13:38:12,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:12,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:12,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:38:12,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:12,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:38:12,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:38:12,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:38:12,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:38:12,991 INFO L87 Difference]: Start difference. First operand 198906 states and 326390 transitions. Second operand 4 states. [2019-09-08 13:38:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:34,191 INFO L93 Difference]: Finished difference Result 583716 states and 959162 transitions. [2019-09-08 13:38:34,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:38:34,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-08 13:38:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:34,914 INFO L225 Difference]: With dead ends: 583716 [2019-09-08 13:38:34,914 INFO L226 Difference]: Without dead ends: 385750 [2019-09-08 13:38:35,103 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 13:38:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385750 states. [2019-09-08 13:38:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385750 to 324834. [2019-09-08 13:38:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324834 states. [2019-09-08 13:38:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324834 states to 324834 states and 532202 transitions. [2019-09-08 13:38:55,187 INFO L78 Accepts]: Start accepts. Automaton has 324834 states and 532202 transitions. Word has length 241 [2019-09-08 13:38:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:55,188 INFO L475 AbstractCegarLoop]: Abstraction has 324834 states and 532202 transitions. [2019-09-08 13:38:55,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:38:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 324834 states and 532202 transitions. [2019-09-08 13:38:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 13:38:55,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:55,190 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, 1, 1, 1, 1, 1, 1] [2019-09-08 13:38:55,190 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash 60152152, now seen corresponding path program 1 times [2019-09-08 13:38:55,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:55,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:55,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:38:55,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:55,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:38:55,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:38:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:38:55,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:55,347 INFO L87 Difference]: Start difference. First operand 324834 states and 532202 transitions. Second operand 3 states. [2019-09-08 13:39:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:21,053 INFO L93 Difference]: Finished difference Result 715355 states and 1176546 transitions. [2019-09-08 13:39:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:21,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 13:39:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:21,978 INFO L225 Difference]: With dead ends: 715355 [2019-09-08 13:39:21,978 INFO L226 Difference]: Without dead ends: 490722 [2019-09-08 13:39:23,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490722 states. [2019-09-08 13:39:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490722 to 490720. [2019-09-08 13:39:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490720 states. [2019-09-08 13:40:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490720 states to 490720 states and 803112 transitions. [2019-09-08 13:40:00,838 INFO L78 Accepts]: Start accepts. Automaton has 490720 states and 803112 transitions. Word has length 241 [2019-09-08 13:40:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:00,839 INFO L475 AbstractCegarLoop]: Abstraction has 490720 states and 803112 transitions. [2019-09-08 13:40:00,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 490720 states and 803112 transitions. [2019-09-08 13:40:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 13:40:00,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:00,841 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:00,841 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:00,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:00,841 INFO L82 PathProgramCache]: Analyzing trace with hash -715289729, now seen corresponding path program 1 times [2019-09-08 13:40:00,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:00,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:00,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:01,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:01,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:40:01,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:40:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:40:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:40:01,135 INFO L87 Difference]: Start difference. First operand 490720 states and 803112 transitions. Second operand 8 states. [2019-09-08 13:42:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:30,572 INFO L93 Difference]: Finished difference Result 2718180 states and 4459122 transitions. [2019-09-08 13:42:30,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 13:42:30,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-08 13:42:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:34,824 INFO L225 Difference]: With dead ends: 2718180 [2019-09-08 13:42:34,824 INFO L226 Difference]: Without dead ends: 2228126 [2019-09-08 13:42:35,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-08 13:42:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228126 states.