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/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:05:20,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:05:20,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:05:20,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:05:20,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:05:20,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:05:20,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:05:20,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:05:20,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:05:20,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:05:20,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:05:20,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:05:20,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:05:20,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:05:20,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:05:20,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:05:20,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:05:20,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:05:20,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:05:20,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:05:20,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:05:20,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:05:20,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:05:20,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:05:20,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:05:20,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:05:20,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:05:20,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:05:20,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:05:20,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:05:20,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:05:20,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:05:20,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:05:20,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:05:20,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:05:20,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:05:20,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:05:20,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:05:20,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:05:20,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:05:20,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:05:20,276 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 07:05:20,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:05:20,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:05:20,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:05:20,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:05:20,294 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:05:20,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:05:20,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:05:20,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:05:20,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:05:20,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:05:20,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:05:20,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:05:20,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:05:20,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:05:20,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:05:20,296 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:05:20,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:05:20,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:05:20,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:05:20,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:05:20,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:05:20,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:05:20,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:05:20,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:05:20,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:05:20,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:05:20,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:05:20,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:05:20,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:05:20,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:05:20,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:05:20,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:05:20,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:05:20,351 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:05:20,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2019-09-08 07:05:20,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8056456e/29235c0599334150b8eae8ac4a89dfd3/FLAGb8dcbe595 [2019-09-08 07:05:20,982 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:05:20,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2019-09-08 07:05:20,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8056456e/29235c0599334150b8eae8ac4a89dfd3/FLAGb8dcbe595 [2019-09-08 07:05:21,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8056456e/29235c0599334150b8eae8ac4a89dfd3 [2019-09-08 07:05:21,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:05:21,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:05:21,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:05:21,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:05:21,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:05:21,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:05:21" (1/1) ... [2019-09-08 07:05:21,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fdff94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21, skipping insertion in model container [2019-09-08 07:05:21,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:05:21" (1/1) ... [2019-09-08 07:05:21,315 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:05:21,368 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:05:21,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:05:21,742 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:05:21,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:05:21,826 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:05:21,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21 WrapperNode [2019-09-08 07:05:21,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:05:21,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:05:21,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:05:21,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:05:21,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21" (1/1) ... [2019-09-08 07:05:21,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21" (1/1) ... [2019-09-08 07:05:21,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21" (1/1) ... [2019-09-08 07:05:21,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21" (1/1) ... [2019-09-08 07:05:21,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21" (1/1) ... [2019-09-08 07:05:21,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21" (1/1) ... [2019-09-08 07:05:21,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21" (1/1) ... [2019-09-08 07:05:21,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:05:21,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:05:21,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:05:21,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:05:21,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21" (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 07:05:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:05:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:05:21,992 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-09-08 07:05:21,992 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-09-08 07:05:21,992 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-09-08 07:05:21,992 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-09-08 07:05:21,992 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-09-08 07:05:21,992 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:05:21,993 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:05:21,993 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-09-08 07:05:21,993 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-09-08 07:05:21,993 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-09-08 07:05:21,993 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-09-08 07:05:21,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:05:21,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:05:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:05:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:05:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:05:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:05:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:05:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:05:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:05:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-09-08 07:05:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-09-08 07:05:21,996 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-09-08 07:05:21,996 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-09-08 07:05:21,996 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-09-08 07:05:21,996 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:05:21,996 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:05:21,996 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-09-08 07:05:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-09-08 07:05:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-09-08 07:05:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-09-08 07:05:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:05:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:05:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:05:22,829 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:05:22,829 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 07:05:22,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:05:22 BoogieIcfgContainer [2019-09-08 07:05:22,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:05:22,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:05:22,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:05:22,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:05:22,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:05:21" (1/3) ... [2019-09-08 07:05:22,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229cfa6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:05:22, skipping insertion in model container [2019-09-08 07:05:22,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:21" (2/3) ... [2019-09-08 07:05:22,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229cfa6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:05:22, skipping insertion in model container [2019-09-08 07:05:22,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:05:22" (3/3) ... [2019-09-08 07:05:22,840 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2019-09-08 07:05:22,851 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:05:22,860 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:05:22,878 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:05:22,913 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:05:22,913 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:05:22,914 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:05:22,914 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:05:22,916 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:05:22,916 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:05:22,917 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:05:22,917 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:05:22,917 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:05:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-09-08 07:05:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 07:05:22,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:22,969 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] [2019-09-08 07:05:22,973 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:22,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:22,979 INFO L82 PathProgramCache]: Analyzing trace with hash -839663837, now seen corresponding path program 1 times [2019-09-08 07:05:22,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:22,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:23,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:23,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:23,280 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 07:05:23,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:23,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:23,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:23,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:23,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:23,309 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 4 states. [2019-09-08 07:05:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:23,507 INFO L93 Difference]: Finished difference Result 417 states and 675 transitions. [2019-09-08 07:05:23,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:23,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-08 07:05:23,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:23,537 INFO L225 Difference]: With dead ends: 417 [2019-09-08 07:05:23,538 INFO L226 Difference]: Without dead ends: 212 [2019-09-08 07:05:23,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-08 07:05:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-09-08 07:05:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-08 07:05:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 312 transitions. [2019-09-08 07:05:23,641 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 312 transitions. Word has length 21 [2019-09-08 07:05:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:23,642 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 312 transitions. [2019-09-08 07:05:23,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 312 transitions. [2019-09-08 07:05:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 07:05:23,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:23,648 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] [2019-09-08 07:05:23,648 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1544889538, now seen corresponding path program 1 times [2019-09-08 07:05:23,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:23,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:23,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:23,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:23,830 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 07:05:23,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:23,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:23,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:23,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:23,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:23,835 INFO L87 Difference]: Start difference. First operand 210 states and 312 transitions. Second operand 4 states. [2019-09-08 07:05:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:23,905 INFO L93 Difference]: Finished difference Result 427 states and 641 transitions. [2019-09-08 07:05:23,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:23,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-08 07:05:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:23,909 INFO L225 Difference]: With dead ends: 427 [2019-09-08 07:05:23,910 INFO L226 Difference]: Without dead ends: 226 [2019-09-08 07:05:23,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-08 07:05:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2019-09-08 07:05:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-08 07:05:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 328 transitions. [2019-09-08 07:05:23,948 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 328 transitions. Word has length 22 [2019-09-08 07:05:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:23,948 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 328 transitions. [2019-09-08 07:05:23,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2019-09-08 07:05:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 07:05:23,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:23,951 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:23,951 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2043974813, now seen corresponding path program 1 times [2019-09-08 07:05:23,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:23,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:23,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:05:24,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:24,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:05:24,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:05:24,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:05:24,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:05:24,058 INFO L87 Difference]: Start difference. First operand 223 states and 328 transitions. Second operand 3 states. [2019-09-08 07:05:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:24,102 INFO L93 Difference]: Finished difference Result 459 states and 687 transitions. [2019-09-08 07:05:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:05:24,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-08 07:05:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:24,113 INFO L225 Difference]: With dead ends: 459 [2019-09-08 07:05:24,114 INFO L226 Difference]: Without dead ends: 252 [2019-09-08 07:05:24,116 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 07:05:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-08 07:05:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 225. [2019-09-08 07:05:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-08 07:05:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 330 transitions. [2019-09-08 07:05:24,164 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 330 transitions. Word has length 30 [2019-09-08 07:05:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:24,164 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 330 transitions. [2019-09-08 07:05:24,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:05:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 330 transitions. [2019-09-08 07:05:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 07:05:24,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:24,167 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:24,167 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:24,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2005997524, now seen corresponding path program 1 times [2019-09-08 07:05:24,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:24,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:24,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:24,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:05:24,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:24,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:05:24,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:05:24,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:05:24,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:24,262 INFO L87 Difference]: Start difference. First operand 225 states and 330 transitions. Second operand 5 states. [2019-09-08 07:05:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:24,306 INFO L93 Difference]: Finished difference Result 436 states and 645 transitions. [2019-09-08 07:05:24,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:24,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-08 07:05:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:24,310 INFO L225 Difference]: With dead ends: 436 [2019-09-08 07:05:24,310 INFO L226 Difference]: Without dead ends: 233 [2019-09-08 07:05:24,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-08 07:05:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2019-09-08 07:05:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-08 07:05:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 334 transitions. [2019-09-08 07:05:24,327 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 334 transitions. Word has length 38 [2019-09-08 07:05:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:24,327 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 334 transitions. [2019-09-08 07:05:24,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:05:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 334 transitions. [2019-09-08 07:05:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 07:05:24,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:24,329 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] [2019-09-08 07:05:24,330 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash -263864755, now seen corresponding path program 1 times [2019-09-08 07:05:24,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:24,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:24,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:24,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:24,429 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 07:05:24,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:24,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:24,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:24,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:24,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:24,431 INFO L87 Difference]: Start difference. First operand 229 states and 334 transitions. Second operand 4 states. [2019-09-08 07:05:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:24,474 INFO L93 Difference]: Finished difference Result 397 states and 584 transitions. [2019-09-08 07:05:24,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:24,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-09-08 07:05:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:24,479 INFO L225 Difference]: With dead ends: 397 [2019-09-08 07:05:24,480 INFO L226 Difference]: Without dead ends: 225 [2019-09-08 07:05:24,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-08 07:05:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-09-08 07:05:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-08 07:05:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 325 transitions. [2019-09-08 07:05:24,503 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 325 transitions. Word has length 39 [2019-09-08 07:05:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:24,504 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 325 transitions. [2019-09-08 07:05:24,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 325 transitions. [2019-09-08 07:05:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 07:05:24,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:24,511 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:24,511 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1394570489, now seen corresponding path program 1 times [2019-09-08 07:05:24,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:24,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:24,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:24,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 07:05:24,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:24,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:24,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:24,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:24,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:24,591 INFO L87 Difference]: Start difference. First operand 225 states and 325 transitions. Second operand 4 states. [2019-09-08 07:05:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:24,656 INFO L93 Difference]: Finished difference Result 446 states and 654 transitions. [2019-09-08 07:05:24,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:24,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-08 07:05:24,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:24,662 INFO L225 Difference]: With dead ends: 446 [2019-09-08 07:05:24,662 INFO L226 Difference]: Without dead ends: 244 [2019-09-08 07:05:24,667 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 07:05:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-08 07:05:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-09-08 07:05:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-08 07:05:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 344 transitions. [2019-09-08 07:05:24,701 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 344 transitions. Word has length 41 [2019-09-08 07:05:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:24,703 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 344 transitions. [2019-09-08 07:05:24,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 344 transitions. [2019-09-08 07:05:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 07:05:24,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:24,705 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:24,705 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash 498130826, now seen corresponding path program 1 times [2019-09-08 07:05:24,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:24,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 07:05:24,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:24,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:24,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:24,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:24,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:24,768 INFO L87 Difference]: Start difference. First operand 241 states and 344 transitions. Second operand 4 states. [2019-09-08 07:05:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:24,828 INFO L93 Difference]: Finished difference Result 466 states and 682 transitions. [2019-09-08 07:05:24,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:24,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-08 07:05:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:24,831 INFO L225 Difference]: With dead ends: 466 [2019-09-08 07:05:24,832 INFO L226 Difference]: Without dead ends: 250 [2019-09-08 07:05:24,833 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 07:05:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-08 07:05:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-09-08 07:05:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-08 07:05:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2019-09-08 07:05:24,850 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 41 [2019-09-08 07:05:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:24,850 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2019-09-08 07:05:24,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2019-09-08 07:05:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 07:05:24,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:24,853 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:24,853 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash 201547255, now seen corresponding path program 1 times [2019-09-08 07:05:24,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:24,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:24,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:24,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 07:05:24,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:24,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:05:24,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:05:24,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:05:24,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:24,945 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand 5 states. [2019-09-08 07:05:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:24,983 INFO L93 Difference]: Finished difference Result 465 states and 669 transitions. [2019-09-08 07:05:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:24,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 07:05:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:25,004 INFO L225 Difference]: With dead ends: 465 [2019-09-08 07:05:25,004 INFO L226 Difference]: Without dead ends: 250 [2019-09-08 07:05:25,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-08 07:05:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-09-08 07:05:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-08 07:05:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 351 transitions. [2019-09-08 07:05:25,022 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 351 transitions. Word has length 59 [2019-09-08 07:05:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:25,024 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 351 transitions. [2019-09-08 07:05:25,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:05:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 351 transitions. [2019-09-08 07:05:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 07:05:25,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:25,026 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:25,026 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1479878478, now seen corresponding path program 1 times [2019-09-08 07:05:25,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:25,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:25,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:25,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 07:05:25,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:25,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:25,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:25,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:25,091 INFO L87 Difference]: Start difference. First operand 248 states and 351 transitions. Second operand 4 states. [2019-09-08 07:05:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:25,156 INFO L93 Difference]: Finished difference Result 479 states and 691 transitions. [2019-09-08 07:05:25,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:25,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-08 07:05:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:25,161 INFO L225 Difference]: With dead ends: 479 [2019-09-08 07:05:25,161 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 07:05:25,163 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 07:05:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 07:05:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-09-08 07:05:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-08 07:05:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2019-09-08 07:05:25,182 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 62 [2019-09-08 07:05:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:25,183 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2019-09-08 07:05:25,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2019-09-08 07:05:25,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 07:05:25,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:25,184 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:25,184 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:25,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash 726395952, now seen corresponding path program 1 times [2019-09-08 07:05:25,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:25,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:25,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:25,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 07:05:25,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:25,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:25,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:25,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:25,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:25,256 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand 4 states. [2019-09-08 07:05:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:25,317 INFO L93 Difference]: Finished difference Result 486 states and 695 transitions. [2019-09-08 07:05:25,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:25,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-08 07:05:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:25,321 INFO L225 Difference]: With dead ends: 486 [2019-09-08 07:05:25,321 INFO L226 Difference]: Without dead ends: 260 [2019-09-08 07:05:25,322 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 07:05:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-08 07:05:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-09-08 07:05:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-08 07:05:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 358 transitions. [2019-09-08 07:05:25,338 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 358 transitions. Word has length 63 [2019-09-08 07:05:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:25,339 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 358 transitions. [2019-09-08 07:05:25,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 358 transitions. [2019-09-08 07:05:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 07:05:25,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:25,342 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:25,342 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash -841683441, now seen corresponding path program 1 times [2019-09-08 07:05:25,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:25,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 07:05:25,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:25,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:05:25,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:05:25,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:05:25,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:25,451 INFO L87 Difference]: Start difference. First operand 260 states and 358 transitions. Second operand 5 states. [2019-09-08 07:05:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:25,483 INFO L93 Difference]: Finished difference Result 473 states and 662 transitions. [2019-09-08 07:05:25,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:25,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 07:05:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:25,487 INFO L225 Difference]: With dead ends: 473 [2019-09-08 07:05:25,488 INFO L226 Difference]: Without dead ends: 262 [2019-09-08 07:05:25,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-08 07:05:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-08 07:05:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-08 07:05:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 357 transitions. [2019-09-08 07:05:25,504 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 357 transitions. Word has length 82 [2019-09-08 07:05:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:25,506 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 357 transitions. [2019-09-08 07:05:25,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:05:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 357 transitions. [2019-09-08 07:05:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 07:05:25,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:25,508 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:25,508 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 635600950, now seen corresponding path program 1 times [2019-09-08 07:05:25,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:25,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 07:05:25,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:25,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:25,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:25,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:25,597 INFO L87 Difference]: Start difference. First operand 260 states and 357 transitions. Second operand 4 states. [2019-09-08 07:05:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:25,658 INFO L93 Difference]: Finished difference Result 462 states and 660 transitions. [2019-09-08 07:05:25,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:25,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-08 07:05:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:25,662 INFO L225 Difference]: With dead ends: 462 [2019-09-08 07:05:25,662 INFO L226 Difference]: Without dead ends: 258 [2019-09-08 07:05:25,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-08 07:05:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-09-08 07:05:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-08 07:05:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 353 transitions. [2019-09-08 07:05:25,675 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 353 transitions. Word has length 85 [2019-09-08 07:05:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:25,676 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 353 transitions. [2019-09-08 07:05:25,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 353 transitions. [2019-09-08 07:05:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 07:05:25,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:25,680 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:25,680 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:25,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:25,681 INFO L82 PathProgramCache]: Analyzing trace with hash -21283191, now seen corresponding path program 1 times [2019-09-08 07:05:25,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:25,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 07:05:25,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:25,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:05:25,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:25,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:05:25,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 07:05:26,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:05:26,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-08 07:05:26,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:05:26,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:05:26,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:05:26,025 INFO L87 Difference]: Start difference. First operand 258 states and 353 transitions. Second operand 6 states. [2019-09-08 07:05:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:26,265 INFO L93 Difference]: Finished difference Result 612 states and 850 transitions. [2019-09-08 07:05:26,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:05:26,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-08 07:05:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:26,269 INFO L225 Difference]: With dead ends: 612 [2019-09-08 07:05:26,269 INFO L226 Difference]: Without dead ends: 297 [2019-09-08 07:05:26,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:05:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-08 07:05:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 267. [2019-09-08 07:05:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-08 07:05:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 354 transitions. [2019-09-08 07:05:26,295 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 354 transitions. Word has length 100 [2019-09-08 07:05:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:26,295 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 354 transitions. [2019-09-08 07:05:26,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:05:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 354 transitions. [2019-09-08 07:05:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 07:05:26,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:26,297 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:26,297 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1994128386, now seen corresponding path program 1 times [2019-09-08 07:05:26,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:26,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:26,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-08 07:05:26,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:26,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:05:26,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:05:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:05:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:26,416 INFO L87 Difference]: Start difference. First operand 267 states and 354 transitions. Second operand 5 states. [2019-09-08 07:05:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:26,439 INFO L93 Difference]: Finished difference Result 438 states and 598 transitions. [2019-09-08 07:05:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:26,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 07:05:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:26,442 INFO L225 Difference]: With dead ends: 438 [2019-09-08 07:05:26,442 INFO L226 Difference]: Without dead ends: 267 [2019-09-08 07:05:26,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-08 07:05:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-09-08 07:05:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-08 07:05:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 352 transitions. [2019-09-08 07:05:26,457 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 352 transitions. Word has length 144 [2019-09-08 07:05:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:26,458 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 352 transitions. [2019-09-08 07:05:26,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:05:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 352 transitions. [2019-09-08 07:05:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 07:05:26,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:26,462 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:26,462 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash -978942154, now seen corresponding path program 1 times [2019-09-08 07:05:26,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:26,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:26,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:26,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:26,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-08 07:05:26,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:26,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:26,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:26,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:26,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:26,563 INFO L87 Difference]: Start difference. First operand 267 states and 352 transitions. Second operand 4 states. [2019-09-08 07:05:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:26,615 INFO L93 Difference]: Finished difference Result 437 states and 598 transitions. [2019-09-08 07:05:26,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:26,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 07:05:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:26,619 INFO L225 Difference]: With dead ends: 437 [2019-09-08 07:05:26,619 INFO L226 Difference]: Without dead ends: 273 [2019-09-08 07:05:26,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-08 07:05:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-09-08 07:05:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-08 07:05:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 355 transitions. [2019-09-08 07:05:26,641 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 355 transitions. Word has length 161 [2019-09-08 07:05:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:26,641 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 355 transitions. [2019-09-08 07:05:26,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 355 transitions. [2019-09-08 07:05:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 07:05:26,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:26,645 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:26,646 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash 328061885, now seen corresponding path program 1 times [2019-09-08 07:05:26,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:26,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:26,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:26,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-08 07:05:26,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:26,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:26,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:26,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:26,799 INFO L87 Difference]: Start difference. First operand 271 states and 355 transitions. Second operand 4 states. [2019-09-08 07:05:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:26,848 INFO L93 Difference]: Finished difference Result 446 states and 605 transitions. [2019-09-08 07:05:26,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:26,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 07:05:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:26,854 INFO L225 Difference]: With dead ends: 446 [2019-09-08 07:05:26,854 INFO L226 Difference]: Without dead ends: 278 [2019-09-08 07:05:26,856 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 07:05:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-08 07:05:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-09-08 07:05:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-08 07:05:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 359 transitions. [2019-09-08 07:05:26,875 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 359 transitions. Word has length 173 [2019-09-08 07:05:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:26,882 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 359 transitions. [2019-09-08 07:05:26,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 359 transitions. [2019-09-08 07:05:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 07:05:26,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:26,888 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:26,888 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:26,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash -596532013, now seen corresponding path program 1 times [2019-09-08 07:05:26,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:26,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:26,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:26,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:26,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-08 07:05:27,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:27,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:27,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:27,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:27,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:27,029 INFO L87 Difference]: Start difference. First operand 276 states and 359 transitions. Second operand 4 states. [2019-09-08 07:05:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:27,077 INFO L93 Difference]: Finished difference Result 448 states and 603 transitions. [2019-09-08 07:05:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:27,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-08 07:05:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:27,081 INFO L225 Difference]: With dead ends: 448 [2019-09-08 07:05:27,081 INFO L226 Difference]: Without dead ends: 275 [2019-09-08 07:05:27,083 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 07:05:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-08 07:05:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-09-08 07:05:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-08 07:05:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 354 transitions. [2019-09-08 07:05:27,097 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 354 transitions. Word has length 186 [2019-09-08 07:05:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:27,101 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 354 transitions. [2019-09-08 07:05:27,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2019-09-08 07:05:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 07:05:27,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:27,104 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:27,105 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash 403733103, now seen corresponding path program 1 times [2019-09-08 07:05:27,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:27,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:27,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-08 07:05:27,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:27,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:27,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:27,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:27,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:27,241 INFO L87 Difference]: Start difference. First operand 275 states and 354 transitions. Second operand 4 states. [2019-09-08 07:05:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:27,270 INFO L93 Difference]: Finished difference Result 446 states and 593 transitions. [2019-09-08 07:05:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:27,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-09-08 07:05:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:27,273 INFO L225 Difference]: With dead ends: 446 [2019-09-08 07:05:27,274 INFO L226 Difference]: Without dead ends: 274 [2019-09-08 07:05:27,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-08 07:05:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-09-08 07:05:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-08 07:05:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 351 transitions. [2019-09-08 07:05:27,295 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 351 transitions. Word has length 200 [2019-09-08 07:05:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:27,296 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 351 transitions. [2019-09-08 07:05:27,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 351 transitions. [2019-09-08 07:05:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 07:05:27,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:27,300 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:27,300 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:27,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1539691930, now seen corresponding path program 1 times [2019-09-08 07:05:27,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:27,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:27,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:27,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:27,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-08 07:05:27,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:27,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:27,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:27,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:27,457 INFO L87 Difference]: Start difference. First operand 274 states and 351 transitions. Second operand 4 states. [2019-09-08 07:05:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:27,831 INFO L93 Difference]: Finished difference Result 766 states and 1029 transitions. [2019-09-08 07:05:27,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:27,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-09-08 07:05:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:27,838 INFO L225 Difference]: With dead ends: 766 [2019-09-08 07:05:27,838 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 07:05:27,840 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 07:05:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 07:05:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 457. [2019-09-08 07:05:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-09-08 07:05:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 611 transitions. [2019-09-08 07:05:27,869 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 611 transitions. Word has length 200 [2019-09-08 07:05:27,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:27,872 INFO L475 AbstractCegarLoop]: Abstraction has 457 states and 611 transitions. [2019-09-08 07:05:27,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 611 transitions. [2019-09-08 07:05:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 07:05:27,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:27,877 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:27,878 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash -819200953, now seen corresponding path program 1 times [2019-09-08 07:05:27,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:27,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:27,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:27,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-08 07:05:28,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:28,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:28,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:28,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:28,032 INFO L87 Difference]: Start difference. First operand 457 states and 611 transitions. Second operand 4 states. [2019-09-08 07:05:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:28,284 INFO L93 Difference]: Finished difference Result 1175 states and 1618 transitions. [2019-09-08 07:05:28,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:28,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-09-08 07:05:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:28,290 INFO L225 Difference]: With dead ends: 1175 [2019-09-08 07:05:28,291 INFO L226 Difference]: Without dead ends: 821 [2019-09-08 07:05:28,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-09-08 07:05:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 806. [2019-09-08 07:05:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-09-08 07:05:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1089 transitions. [2019-09-08 07:05:28,353 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1089 transitions. Word has length 237 [2019-09-08 07:05:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:28,354 INFO L475 AbstractCegarLoop]: Abstraction has 806 states and 1089 transitions. [2019-09-08 07:05:28,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1089 transitions. [2019-09-08 07:05:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 07:05:28,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:28,362 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:28,362 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:28,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:28,362 INFO L82 PathProgramCache]: Analyzing trace with hash -465664165, now seen corresponding path program 1 times [2019-09-08 07:05:28,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:28,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:28,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-08 07:05:28,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:28,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:28,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:28,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:28,572 INFO L87 Difference]: Start difference. First operand 806 states and 1089 transitions. Second operand 4 states. [2019-09-08 07:05:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:28,881 INFO L93 Difference]: Finished difference Result 2150 states and 2975 transitions. [2019-09-08 07:05:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:28,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-08 07:05:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:28,894 INFO L225 Difference]: With dead ends: 2150 [2019-09-08 07:05:28,895 INFO L226 Difference]: Without dead ends: 1474 [2019-09-08 07:05:28,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-09-08 07:05:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1112. [2019-09-08 07:05:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-09-08 07:05:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1515 transitions. [2019-09-08 07:05:29,005 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1515 transitions. Word has length 238 [2019-09-08 07:05:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:29,006 INFO L475 AbstractCegarLoop]: Abstraction has 1112 states and 1515 transitions. [2019-09-08 07:05:29,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1515 transitions. [2019-09-08 07:05:29,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 07:05:29,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:29,017 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:29,017 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1558432926, now seen corresponding path program 1 times [2019-09-08 07:05:29,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:29,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:29,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:29,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:29,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-08 07:05:29,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:29,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:29,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:29,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:29,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:29,205 INFO L87 Difference]: Start difference. First operand 1112 states and 1515 transitions. Second operand 4 states. [2019-09-08 07:05:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:29,583 INFO L93 Difference]: Finished difference Result 3095 states and 4292 transitions. [2019-09-08 07:05:29,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:29,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-08 07:05:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:29,602 INFO L225 Difference]: With dead ends: 3095 [2019-09-08 07:05:29,602 INFO L226 Difference]: Without dead ends: 2113 [2019-09-08 07:05:29,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2019-09-08 07:05:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1401. [2019-09-08 07:05:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-09-08 07:05:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1919 transitions. [2019-09-08 07:05:29,743 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1919 transitions. Word has length 239 [2019-09-08 07:05:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:29,745 INFO L475 AbstractCegarLoop]: Abstraction has 1401 states and 1919 transitions. [2019-09-08 07:05:29,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1919 transitions. [2019-09-08 07:05:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 07:05:29,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:29,754 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:29,754 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash 492551072, now seen corresponding path program 1 times [2019-09-08 07:05:29,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:29,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:29,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-09-08 07:05:29,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:29,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:29,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:30,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 07:05:30,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-09-08 07:05:30,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:05:30,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 07:05:30,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:05:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:05:30,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:05:30,330 INFO L87 Difference]: Start difference. First operand 1401 states and 1919 transitions. Second operand 10 states. [2019-09-08 07:05:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:30,677 INFO L93 Difference]: Finished difference Result 2888 states and 3992 transitions. [2019-09-08 07:05:30,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:05:30,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 239 [2019-09-08 07:05:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:30,688 INFO L225 Difference]: With dead ends: 2888 [2019-09-08 07:05:30,689 INFO L226 Difference]: Without dead ends: 1428 [2019-09-08 07:05:30,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:05:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-09-08 07:05:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2019-09-08 07:05:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-09-08 07:05:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1908 transitions. [2019-09-08 07:05:30,788 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1908 transitions. Word has length 239 [2019-09-08 07:05:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:30,788 INFO L475 AbstractCegarLoop]: Abstraction has 1428 states and 1908 transitions. [2019-09-08 07:05:30,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:05:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1908 transitions. [2019-09-08 07:05:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 07:05:30,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:30,796 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:30,797 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1385755419, now seen corresponding path program 1 times [2019-09-08 07:05:30,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:30,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:30,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2019-09-08 07:05:31,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:31,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:05:31,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:31,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:05:31,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-09-08 07:05:31,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:31,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 07:05:31,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:05:31,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:05:31,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:05:31,337 INFO L87 Difference]: Start difference. First operand 1428 states and 1908 transitions. Second operand 9 states. [2019-09-08 07:05:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:31,534 INFO L93 Difference]: Finished difference Result 2794 states and 3870 transitions. [2019-09-08 07:05:31,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 07:05:31,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 293 [2019-09-08 07:05:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:31,550 INFO L225 Difference]: With dead ends: 2794 [2019-09-08 07:05:31,550 INFO L226 Difference]: Without dead ends: 1487 [2019-09-08 07:05:31,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:05:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-08 07:05:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1487. [2019-09-08 07:05:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-09-08 07:05:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1953 transitions. [2019-09-08 07:05:31,670 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1953 transitions. Word has length 293 [2019-09-08 07:05:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:31,671 INFO L475 AbstractCegarLoop]: Abstraction has 1487 states and 1953 transitions. [2019-09-08 07:05:31,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:05:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1953 transitions. [2019-09-08 07:05:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 07:05:31,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:31,684 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:31,685 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:31,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash 142020564, now seen corresponding path program 1 times [2019-09-08 07:05:31,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:31,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:31,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:31,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:31,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2019-09-08 07:05:31,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:31,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:05:31,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:05:31,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:05:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:05:31,955 INFO L87 Difference]: Start difference. First operand 1487 states and 1953 transitions. Second operand 3 states. [2019-09-08 07:05:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:32,020 INFO L93 Difference]: Finished difference Result 2566 states and 3389 transitions. [2019-09-08 07:05:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:05:32,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-09-08 07:05:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:32,030 INFO L225 Difference]: With dead ends: 2566 [2019-09-08 07:05:32,030 INFO L226 Difference]: Without dead ends: 1181 [2019-09-08 07:05:32,036 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 07:05:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-09-08 07:05:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2019-09-08 07:05:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-09-08 07:05:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1540 transitions. [2019-09-08 07:05:32,114 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1540 transitions. Word has length 294 [2019-09-08 07:05:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:32,115 INFO L475 AbstractCegarLoop]: Abstraction has 1181 states and 1540 transitions. [2019-09-08 07:05:32,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:05:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1540 transitions. [2019-09-08 07:05:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 07:05:32,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:32,122 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:32,122 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 605823779, now seen corresponding path program 1 times [2019-09-08 07:05:32,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:32,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-09-08 07:05:32,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:32,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:32,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:32,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:05:32,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:32,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:05:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2019-09-08 07:05:32,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:32,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2019-09-08 07:05:32,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 07:05:32,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 07:05:32,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:05:32,810 INFO L87 Difference]: Start difference. First operand 1181 states and 1540 transitions. Second operand 15 states. [2019-09-08 07:05:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:33,002 INFO L93 Difference]: Finished difference Result 1243 states and 1648 transitions. [2019-09-08 07:05:33,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:05:33,003 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 294 [2019-09-08 07:05:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:33,011 INFO L225 Difference]: With dead ends: 1243 [2019-09-08 07:05:33,011 INFO L226 Difference]: Without dead ends: 1241 [2019-09-08 07:05:33,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:05:33,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-09-08 07:05:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1205. [2019-09-08 07:05:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2019-09-08 07:05:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1567 transitions. [2019-09-08 07:05:33,092 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1567 transitions. Word has length 294 [2019-09-08 07:05:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:33,092 INFO L475 AbstractCegarLoop]: Abstraction has 1205 states and 1567 transitions. [2019-09-08 07:05:33,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 07:05:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1567 transitions. [2019-09-08 07:05:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 07:05:33,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:33,101 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:33,102 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:33,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:33,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2020399730, now seen corresponding path program 1 times [2019-09-08 07:05:33,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:33,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:33,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-09-08 07:05:33,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:33,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:33,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:33,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 07:05:33,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-08 07:05:34,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:05:34,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2019-09-08 07:05:34,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 07:05:34,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 07:05:34,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 07:05:34,012 INFO L87 Difference]: Start difference. First operand 1205 states and 1567 transitions. Second operand 21 states. [2019-09-08 07:05:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:40,251 INFO L93 Difference]: Finished difference Result 4383 states and 5853 transitions. [2019-09-08 07:05:40,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 07:05:40,254 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 302 [2019-09-08 07:05:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:40,273 INFO L225 Difference]: With dead ends: 4383 [2019-09-08 07:05:40,274 INFO L226 Difference]: Without dead ends: 3334 [2019-09-08 07:05:40,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 07:05:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-09-08 07:05:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2901. [2019-09-08 07:05:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2901 states. [2019-09-08 07:05:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3849 transitions. [2019-09-08 07:05:40,452 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 3849 transitions. Word has length 302 [2019-09-08 07:05:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:40,452 INFO L475 AbstractCegarLoop]: Abstraction has 2901 states and 3849 transitions. [2019-09-08 07:05:40,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 07:05:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3849 transitions. [2019-09-08 07:05:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 07:05:40,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:40,459 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:40,459 INFO L418 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:40,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1581465869, now seen corresponding path program 1 times [2019-09-08 07:05:40,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:40,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:40,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2019-09-08 07:05:40,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:40,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:05:40,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:40,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 07:05:40,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-09-08 07:05:40,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:40,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-08 07:05:40,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:40,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:40,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:40,857 INFO L87 Difference]: Start difference. First operand 2901 states and 3849 transitions. Second operand 4 states. [2019-09-08 07:05:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:41,028 INFO L93 Difference]: Finished difference Result 4607 states and 5992 transitions. [2019-09-08 07:05:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:41,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-08 07:05:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:41,043 INFO L225 Difference]: With dead ends: 4607 [2019-09-08 07:05:41,044 INFO L226 Difference]: Without dead ends: 2388 [2019-09-08 07:05:41,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 304 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 07:05:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-09-08 07:05:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2019-09-08 07:05:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-09-08 07:05:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 3018 transitions. [2019-09-08 07:05:41,231 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 3018 transitions. Word has length 302 [2019-09-08 07:05:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:41,232 INFO L475 AbstractCegarLoop]: Abstraction has 2388 states and 3018 transitions. [2019-09-08 07:05:41,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 3018 transitions. [2019-09-08 07:05:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 07:05:41,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:41,240 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:41,240 INFO L418 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:41,241 INFO L82 PathProgramCache]: Analyzing trace with hash -17234052, now seen corresponding path program 1 times [2019-09-08 07:05:41,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:41,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:41,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:41,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-08 07:05:41,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:41,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:05:41,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:05:41,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:05:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:05:41,482 INFO L87 Difference]: Start difference. First operand 2388 states and 3018 transitions. Second operand 10 states. [2019-09-08 07:05:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:42,151 INFO L93 Difference]: Finished difference Result 5130 states and 6564 transitions. [2019-09-08 07:05:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 07:05:42,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 317 [2019-09-08 07:05:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:42,172 INFO L225 Difference]: With dead ends: 5130 [2019-09-08 07:05:42,172 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 07:05:42,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:05:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 07:05:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3303. [2019-09-08 07:05:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3303 states. [2019-09-08 07:05:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4215 transitions. [2019-09-08 07:05:42,348 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4215 transitions. Word has length 317 [2019-09-08 07:05:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:42,349 INFO L475 AbstractCegarLoop]: Abstraction has 3303 states and 4215 transitions. [2019-09-08 07:05:42,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:05:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4215 transitions. [2019-09-08 07:05:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 07:05:42,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:42,355 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:42,356 INFO L418 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1891223738, now seen corresponding path program 1 times [2019-09-08 07:05:42,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:42,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:42,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:42,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:42,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-08 07:05:42,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:42,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:05:42,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:42,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:05:42,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2019-09-08 07:05:42,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:42,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-09-08 07:05:42,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:05:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:05:42,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:05:42,925 INFO L87 Difference]: Start difference. First operand 3303 states and 4215 transitions. Second operand 14 states. [2019-09-08 07:05:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:46,973 INFO L93 Difference]: Finished difference Result 5901 states and 7476 transitions. [2019-09-08 07:05:46,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 07:05:46,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 317 [2019-09-08 07:05:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:46,999 INFO L225 Difference]: With dead ends: 5901 [2019-09-08 07:05:46,999 INFO L226 Difference]: Without dead ends: 3328 [2019-09-08 07:05:47,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 07:05:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2019-09-08 07:05:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 2664. [2019-09-08 07:05:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-09-08 07:05:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3279 transitions. [2019-09-08 07:05:47,221 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3279 transitions. Word has length 317 [2019-09-08 07:05:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:47,221 INFO L475 AbstractCegarLoop]: Abstraction has 2664 states and 3279 transitions. [2019-09-08 07:05:47,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:05:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3279 transitions. [2019-09-08 07:05:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 07:05:47,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:47,227 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:47,227 INFO L418 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1568257053, now seen corresponding path program 1 times [2019-09-08 07:05:47,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:47,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-08 07:05:47,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:47,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:47,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:47,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 07:05:47,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:05:47,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:47,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-09-08 07:05:47,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:05:47,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:05:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:05:47,749 INFO L87 Difference]: Start difference. First operand 2664 states and 3279 transitions. Second operand 14 states. [2019-09-08 07:05:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:51,997 INFO L93 Difference]: Finished difference Result 4918 states and 6064 transitions. [2019-09-08 07:05:51,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 07:05:51,997 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 318 [2019-09-08 07:05:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:52,009 INFO L225 Difference]: With dead ends: 4918 [2019-09-08 07:05:52,009 INFO L226 Difference]: Without dead ends: 2780 [2019-09-08 07:05:52,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 07:05:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-09-08 07:05:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2415. [2019-09-08 07:05:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2415 states. [2019-09-08 07:05:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 2940 transitions. [2019-09-08 07:05:52,125 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 2940 transitions. Word has length 318 [2019-09-08 07:05:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:52,126 INFO L475 AbstractCegarLoop]: Abstraction has 2415 states and 2940 transitions. [2019-09-08 07:05:52,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:05:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 2940 transitions. [2019-09-08 07:05:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 07:05:52,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:52,132 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:52,132 INFO L418 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:52,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1552388376, now seen corresponding path program 1 times [2019-09-08 07:05:52,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:52,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:52,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:52,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:52,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-08 07:05:52,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:52,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:05:52,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:05:52,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:05:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:05:52,311 INFO L87 Difference]: Start difference. First operand 2415 states and 2940 transitions. Second operand 6 states. [2019-09-08 07:05:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:52,634 INFO L93 Difference]: Finished difference Result 5990 states and 7936 transitions. [2019-09-08 07:05:52,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:05:52,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 323 [2019-09-08 07:05:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:52,659 INFO L225 Difference]: With dead ends: 5990 [2019-09-08 07:05:52,659 INFO L226 Difference]: Without dead ends: 4041 [2019-09-08 07:05:52,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:05:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4041 states. [2019-09-08 07:05:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4041 to 2766. [2019-09-08 07:05:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 07:05:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3495 transitions. [2019-09-08 07:05:52,839 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3495 transitions. Word has length 323 [2019-09-08 07:05:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:52,840 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3495 transitions. [2019-09-08 07:05:52,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:05:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3495 transitions. [2019-09-08 07:05:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 07:05:52,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:52,844 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:52,844 INFO L418 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:52,845 INFO L82 PathProgramCache]: Analyzing trace with hash -834783340, now seen corresponding path program 1 times [2019-09-08 07:05:52,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:52,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:52,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:52,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2019-09-08 07:05:53,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:53,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:53,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:53,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 07:05:53,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-09-08 07:05:53,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:53,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2019-09-08 07:05:53,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 07:05:53,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 07:05:53,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-08 07:05:53,828 INFO L87 Difference]: Start difference. First operand 2766 states and 3495 transitions. Second operand 21 states. [2019-09-08 07:06:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:03,117 INFO L93 Difference]: Finished difference Result 7016 states and 9004 transitions. [2019-09-08 07:06:03,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 07:06:03,117 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 323 [2019-09-08 07:06:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:03,139 INFO L225 Difference]: With dead ends: 7016 [2019-09-08 07:06:03,140 INFO L226 Difference]: Without dead ends: 4698 [2019-09-08 07:06:03,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=364, Invalid=3176, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 07:06:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2019-09-08 07:06:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 2787. [2019-09-08 07:06:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2787 states. [2019-09-08 07:06:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 3405 transitions. [2019-09-08 07:06:03,334 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 3405 transitions. Word has length 323 [2019-09-08 07:06:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:03,335 INFO L475 AbstractCegarLoop]: Abstraction has 2787 states and 3405 transitions. [2019-09-08 07:06:03,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 07:06:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3405 transitions. [2019-09-08 07:06:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 07:06:03,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:03,345 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:06:03,346 INFO L418 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:03,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:03,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2099267353, now seen corresponding path program 1 times [2019-09-08 07:06:03,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:03,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:03,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:03,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:03,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-09-08 07:06:03,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:03,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:03,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:04,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1927 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 07:06:04,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 228 proven. 96 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-08 07:06:04,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:06:04,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-09-08 07:06:04,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 07:06:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 07:06:04,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:06:04,428 INFO L87 Difference]: Start difference. First operand 2787 states and 3405 transitions. Second operand 25 states. [2019-09-08 07:06:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:20,018 INFO L93 Difference]: Finished difference Result 10492 states and 13345 transitions. [2019-09-08 07:06:20,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-08 07:06:20,024 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 396 [2019-09-08 07:06:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:20,067 INFO L225 Difference]: With dead ends: 10492 [2019-09-08 07:06:20,068 INFO L226 Difference]: Without dead ends: 8240 [2019-09-08 07:06:20,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 424 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5628 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2267, Invalid=15025, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 07:06:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8240 states. [2019-09-08 07:06:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8240 to 6773. [2019-09-08 07:06:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6773 states. [2019-09-08 07:06:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6773 states to 6773 states and 8318 transitions. [2019-09-08 07:06:20,537 INFO L78 Accepts]: Start accepts. Automaton has 6773 states and 8318 transitions. Word has length 396 [2019-09-08 07:06:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:20,538 INFO L475 AbstractCegarLoop]: Abstraction has 6773 states and 8318 transitions. [2019-09-08 07:06:20,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 07:06:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 8318 transitions. [2019-09-08 07:06:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 07:06:20,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:20,558 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:06:20,559 INFO L418 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash 691068936, now seen corresponding path program 1 times [2019-09-08 07:06:20,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:20,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:20,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2019-09-08 07:06:20,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:20,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:20,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:21,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1924 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 07:06:21,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2019-09-08 07:06:21,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:06:21,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-08 07:06:21,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:06:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:06:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:06:21,151 INFO L87 Difference]: Start difference. First operand 6773 states and 8318 transitions. Second operand 4 states. [2019-09-08 07:06:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:21,611 INFO L93 Difference]: Finished difference Result 13471 states and 16558 transitions. [2019-09-08 07:06:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:06:21,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2019-09-08 07:06:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:21,643 INFO L225 Difference]: With dead ends: 13471 [2019-09-08 07:06:21,643 INFO L226 Difference]: Without dead ends: 6709 [2019-09-08 07:06:21,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 398 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 07:06:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-09-08 07:06:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 6709. [2019-09-08 07:06:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6709 states. [2019-09-08 07:06:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6709 states to 6709 states and 8034 transitions. [2019-09-08 07:06:22,277 INFO L78 Accepts]: Start accepts. Automaton has 6709 states and 8034 transitions. Word has length 396 [2019-09-08 07:06:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:22,278 INFO L475 AbstractCegarLoop]: Abstraction has 6709 states and 8034 transitions. [2019-09-08 07:06:22,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:06:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 6709 states and 8034 transitions. [2019-09-08 07:06:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-08 07:06:22,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:22,293 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:06:22,293 INFO L418 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1882507023, now seen corresponding path program 1 times [2019-09-08 07:06:22,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:22,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:22,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:22,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2019-09-08 07:06:22,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:22,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:23,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 1928 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 07:06:23,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 194 proven. 120 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2019-09-08 07:06:23,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:06:23,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13] total 37 [2019-09-08 07:06:23,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 07:06:23,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 07:06:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1256, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 07:06:23,772 INFO L87 Difference]: Start difference. First operand 6709 states and 8034 transitions. Second operand 37 states. [2019-09-08 07:07:12,839 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-08 07:07:13,142 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-08 07:07:13,544 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 07:07:14,237 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 07:07:17,327 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 07:07:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:38,558 INFO L93 Difference]: Finished difference Result 22748 states and 27467 transitions. [2019-09-08 07:07:38,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 556 states. [2019-09-08 07:07:38,558 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 397 [2019-09-08 07:07:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:38,612 INFO L225 Difference]: With dead ends: 22748 [2019-09-08 07:07:38,612 INFO L226 Difference]: Without dead ends: 16702 [2019-09-08 07:07:38,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1163 GetRequests, 573 SyntacticMatches, 1 SemanticMatches, 589 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152496 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=18409, Invalid=330281, Unknown=0, NotChecked=0, Total=348690 [2019-09-08 07:07:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16702 states. [2019-09-08 07:07:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16702 to 10302. [2019-09-08 07:07:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10302 states. [2019-09-08 07:07:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10302 states to 10302 states and 12159 transitions. [2019-09-08 07:07:39,642 INFO L78 Accepts]: Start accepts. Automaton has 10302 states and 12159 transitions. Word has length 397 [2019-09-08 07:07:39,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:39,643 INFO L475 AbstractCegarLoop]: Abstraction has 10302 states and 12159 transitions. [2019-09-08 07:07:39,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 07:07:39,643 INFO L276 IsEmpty]: Start isEmpty. Operand 10302 states and 12159 transitions. [2019-09-08 07:07:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-09-08 07:07:39,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:39,662 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:39,662 INFO L418 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash -201674962, now seen corresponding path program 1 times [2019-09-08 07:07:39,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:39,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:39,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:39,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:39,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 31 proven. 229 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2019-09-08 07:07:40,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:40,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:40,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:40,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 1950 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:07:40,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:40,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:07:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2019-09-08 07:07:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:07:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-09-08 07:07:40,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 07:07:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 07:07:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 07:07:40,639 INFO L87 Difference]: Start difference. First operand 10302 states and 12159 transitions. Second operand 21 states. [2019-09-08 07:07:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:45,359 INFO L93 Difference]: Finished difference Result 22033 states and 25875 transitions. [2019-09-08 07:07:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 07:07:45,360 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 406 [2019-09-08 07:07:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:45,396 INFO L225 Difference]: With dead ends: 22033 [2019-09-08 07:07:45,396 INFO L226 Difference]: Without dead ends: 12222 [2019-09-08 07:07:45,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=446, Invalid=2860, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 07:07:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12222 states. [2019-09-08 07:07:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12222 to 10487. [2019-09-08 07:07:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10487 states. [2019-09-08 07:07:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10487 states to 10487 states and 12331 transitions. [2019-09-08 07:07:46,255 INFO L78 Accepts]: Start accepts. Automaton has 10487 states and 12331 transitions. Word has length 406 [2019-09-08 07:07:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:46,257 INFO L475 AbstractCegarLoop]: Abstraction has 10487 states and 12331 transitions. [2019-09-08 07:07:46,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 07:07:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 10487 states and 12331 transitions. [2019-09-08 07:07:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-08 07:07:46,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:46,280 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:46,280 INFO L418 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:46,280 INFO L82 PathProgramCache]: Analyzing trace with hash -332017745, now seen corresponding path program 1 times [2019-09-08 07:07:46,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:46,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:46,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:46,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2019-09-08 07:07:46,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:46,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:46,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:47,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1978 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 07:07:47,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 485 proven. 183 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-09-08 07:07:47,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:07:47,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25] total 37 [2019-09-08 07:07:47,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 07:07:47,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 07:07:47,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 07:07:47,952 INFO L87 Difference]: Start difference. First operand 10487 states and 12331 transitions. Second operand 37 states. [2019-09-08 07:08:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:03,760 INFO L93 Difference]: Finished difference Result 24354 states and 28776 transitions. [2019-09-08 07:08:03,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 07:08:03,761 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 417 [2019-09-08 07:08:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:03,805 INFO L225 Difference]: With dead ends: 24354 [2019-09-08 07:08:03,805 INFO L226 Difference]: Without dead ends: 14594 [2019-09-08 07:08:03,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5357 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1656, Invalid=14856, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 07:08:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14594 states. [2019-09-08 07:08:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14594 to 10493. [2019-09-08 07:08:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10493 states. [2019-09-08 07:08:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10493 states to 10493 states and 12330 transitions. [2019-09-08 07:08:04,691 INFO L78 Accepts]: Start accepts. Automaton has 10493 states and 12330 transitions. Word has length 417 [2019-09-08 07:08:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:04,691 INFO L475 AbstractCegarLoop]: Abstraction has 10493 states and 12330 transitions. [2019-09-08 07:08:04,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 07:08:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 10493 states and 12330 transitions. [2019-09-08 07:08:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-08 07:08:04,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:04,710 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:04,711 INFO L418 AbstractCegarLoop]: === Iteration 39 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1083112781, now seen corresponding path program 1 times [2019-09-08 07:08:04,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:04,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:04,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2019-09-08 07:08:05,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:05,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:08:05,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:05,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 2005 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 07:08:05,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 569 proven. 217 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-08 07:08:06,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:08:06,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 24] total 36 [2019-09-08 07:08:06,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 07:08:06,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 07:08:06,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 07:08:06,290 INFO L87 Difference]: Start difference. First operand 10493 states and 12330 transitions. Second operand 36 states. [2019-09-08 07:08:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:23,431 INFO L93 Difference]: Finished difference Result 24345 states and 28758 transitions. [2019-09-08 07:08:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 07:08:23,432 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 429 [2019-09-08 07:08:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:23,466 INFO L225 Difference]: With dead ends: 24345 [2019-09-08 07:08:23,467 INFO L226 Difference]: Without dead ends: 14585 [2019-09-08 07:08:23,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5347 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1600, Invalid=14656, Unknown=0, NotChecked=0, Total=16256 [2019-09-08 07:08:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14585 states. [2019-09-08 07:08:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14585 to 10488. [2019-09-08 07:08:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10488 states. [2019-09-08 07:08:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10488 states to 10488 states and 12318 transitions. [2019-09-08 07:08:24,197 INFO L78 Accepts]: Start accepts. Automaton has 10488 states and 12318 transitions. Word has length 429 [2019-09-08 07:08:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:24,198 INFO L475 AbstractCegarLoop]: Abstraction has 10488 states and 12318 transitions. [2019-09-08 07:08:24,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 07:08:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 10488 states and 12318 transitions. [2019-09-08 07:08:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 07:08:24,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:24,216 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:24,216 INFO L418 AbstractCegarLoop]: === Iteration 40 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash 636120499, now seen corresponding path program 1 times [2019-09-08 07:08:24,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:24,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:24,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:24,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:24,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1205 trivial. 0 not checked. [2019-09-08 07:08:24,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:24,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:24,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:24,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 07:08:24,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 408 proven. 48 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2019-09-08 07:08:24,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:08:24,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 10] total 11 [2019-09-08 07:08:24,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:08:24,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:08:24,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:08:24,932 INFO L87 Difference]: Start difference. First operand 10488 states and 12318 transitions. Second operand 11 states. [2019-09-08 07:08:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:26,441 INFO L93 Difference]: Finished difference Result 15196 states and 17849 transitions. [2019-09-08 07:08:26,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 07:08:26,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 455 [2019-09-08 07:08:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:26,452 INFO L225 Difference]: With dead ends: 15196 [2019-09-08 07:08:26,452 INFO L226 Difference]: Without dead ends: 5376 [2019-09-08 07:08:26,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:08:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5376 states. [2019-09-08 07:08:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5376 to 5376. [2019-09-08 07:08:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2019-09-08 07:08:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 6262 transitions. [2019-09-08 07:08:26,795 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 6262 transitions. Word has length 455 [2019-09-08 07:08:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:26,797 INFO L475 AbstractCegarLoop]: Abstraction has 5376 states and 6262 transitions. [2019-09-08 07:08:26,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:08:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 6262 transitions. [2019-09-08 07:08:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-08 07:08:26,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:26,808 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:26,808 INFO L418 AbstractCegarLoop]: === Iteration 41 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash -67341668, now seen corresponding path program 1 times [2019-09-08 07:08:26,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:26,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:26,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:26,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2019-09-08 07:08:27,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:27,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:08:27,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:08:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:08:27,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:08:27,057 INFO L87 Difference]: Start difference. First operand 5376 states and 6262 transitions. Second operand 10 states. [2019-09-08 07:08:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:28,457 INFO L93 Difference]: Finished difference Result 11939 states and 14256 transitions. [2019-09-08 07:08:28,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 07:08:28,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 453 [2019-09-08 07:08:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:28,480 INFO L225 Difference]: With dead ends: 11939 [2019-09-08 07:08:28,480 INFO L226 Difference]: Without dead ends: 7294 [2019-09-08 07:08:28,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:08:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-09-08 07:08:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 5536. [2019-09-08 07:08:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5536 states. [2019-09-08 07:08:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5536 states to 5536 states and 6514 transitions. [2019-09-08 07:08:28,866 INFO L78 Accepts]: Start accepts. Automaton has 5536 states and 6514 transitions. Word has length 453 [2019-09-08 07:08:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:28,866 INFO L475 AbstractCegarLoop]: Abstraction has 5536 states and 6514 transitions. [2019-09-08 07:08:28,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:08:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5536 states and 6514 transitions. [2019-09-08 07:08:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 07:08:28,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:28,874 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:28,874 INFO L418 AbstractCegarLoop]: === Iteration 42 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:28,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:28,874 INFO L82 PathProgramCache]: Analyzing trace with hash -26199313, now seen corresponding path program 1 times [2019-09-08 07:08:28,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:28,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:28,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:28,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:28,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-09-08 07:08:29,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:29,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:29,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:30,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:08:30,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:30,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:08:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 408 proven. 4 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2019-09-08 07:08:30,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:08:30,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7] total 33 [2019-09-08 07:08:30,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 07:08:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 07:08:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:08:30,519 INFO L87 Difference]: Start difference. First operand 5536 states and 6514 transitions. Second operand 33 states. [2019-09-08 07:08:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:42,136 INFO L93 Difference]: Finished difference Result 14632 states and 17147 transitions. [2019-09-08 07:08:42,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 07:08:42,136 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 454 [2019-09-08 07:08:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:42,154 INFO L225 Difference]: With dead ends: 14632 [2019-09-08 07:08:42,154 INFO L226 Difference]: Without dead ends: 9578 [2019-09-08 07:08:42,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 469 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1061, Invalid=6595, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 07:08:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9578 states. [2019-09-08 07:08:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9578 to 5908. [2019-09-08 07:08:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5908 states. [2019-09-08 07:08:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5908 states to 5908 states and 6878 transitions. [2019-09-08 07:08:42,602 INFO L78 Accepts]: Start accepts. Automaton has 5908 states and 6878 transitions. Word has length 454 [2019-09-08 07:08:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:42,603 INFO L475 AbstractCegarLoop]: Abstraction has 5908 states and 6878 transitions. [2019-09-08 07:08:42,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 07:08:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 5908 states and 6878 transitions. [2019-09-08 07:08:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 07:08:42,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:42,610 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:42,610 INFO L418 AbstractCegarLoop]: === Iteration 43 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:42,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1061048046, now seen corresponding path program 1 times [2019-09-08 07:08:42,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:42,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2019-09-08 07:08:43,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:43,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:43,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:43,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 07:08:43,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 403 proven. 162 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-09-08 07:08:44,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:08:44,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 40 [2019-09-08 07:08:44,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 07:08:44,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 07:08:44,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1475, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 07:08:44,005 INFO L87 Difference]: Start difference. First operand 5908 states and 6878 transitions. Second operand 40 states. [2019-09-08 07:08:48,880 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-08 07:09:18,821 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-08 07:10:00,470 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-08 07:10:43,169 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-08 07:11:26,746 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-08 07:12:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:12:03,106 INFO L93 Difference]: Finished difference Result 86309 states and 102698 transitions. [2019-09-08 07:12:03,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1502 states. [2019-09-08 07:12:03,107 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 455 [2019-09-08 07:12:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:12:03,282 INFO L225 Difference]: With dead ends: 86309 [2019-09-08 07:12:03,282 INFO L226 Difference]: Without dead ends: 81156 [2019-09-08 07:12:03,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2398 GetRequests, 859 SyntacticMatches, 1 SemanticMatches, 1538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122592 ImplicationChecksByTransitivity, 87.0s TimeCoverageRelationStatistics Valid=78389, Invalid=2291671, Unknown=0, NotChecked=0, Total=2370060 [2019-09-08 07:12:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81156 states. [2019-09-08 07:12:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81156 to 16864. [2019-09-08 07:12:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16864 states. [2019-09-08 07:12:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16864 states to 16864 states and 19589 transitions. [2019-09-08 07:12:05,824 INFO L78 Accepts]: Start accepts. Automaton has 16864 states and 19589 transitions. Word has length 455 [2019-09-08 07:12:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:12:05,825 INFO L475 AbstractCegarLoop]: Abstraction has 16864 states and 19589 transitions. [2019-09-08 07:12:05,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 07:12:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 16864 states and 19589 transitions. [2019-09-08 07:12:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 07:12:05,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:12:05,852 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:12:05,853 INFO L418 AbstractCegarLoop]: === Iteration 44 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:12:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:12:05,853 INFO L82 PathProgramCache]: Analyzing trace with hash 629807131, now seen corresponding path program 1 times [2019-09-08 07:12:05,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:12:05,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:12:05,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:05,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:12:05,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:12:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-08 07:12:06,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:12:06,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:12:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:12:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:12:06,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 07:12:06,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:12:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 518 proven. 36 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-08 07:12:07,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:12:07,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 35 [2019-09-08 07:12:07,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 07:12:07,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 07:12:07,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 07:12:07,282 INFO L87 Difference]: Start difference. First operand 16864 states and 19589 transitions. Second operand 35 states. [2019-09-08 07:12:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:12:32,679 INFO L93 Difference]: Finished difference Result 57899 states and 67508 transitions. [2019-09-08 07:12:32,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 07:12:32,679 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 455 [2019-09-08 07:12:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:12:32,793 INFO L225 Difference]: With dead ends: 57899 [2019-09-08 07:12:32,793 INFO L226 Difference]: Without dead ends: 42015 [2019-09-08 07:12:32,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3518 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1572, Invalid=12000, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 07:12:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42015 states. [2019-09-08 07:12:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42015 to 16864. [2019-09-08 07:12:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16864 states. [2019-09-08 07:12:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16864 states to 16864 states and 19589 transitions. [2019-09-08 07:12:34,627 INFO L78 Accepts]: Start accepts. Automaton has 16864 states and 19589 transitions. Word has length 455 [2019-09-08 07:12:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:12:34,628 INFO L475 AbstractCegarLoop]: Abstraction has 16864 states and 19589 transitions. [2019-09-08 07:12:34,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 07:12:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 16864 states and 19589 transitions. [2019-09-08 07:12:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2019-09-08 07:12:34,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:12:34,654 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:12:34,654 INFO L418 AbstractCegarLoop]: === Iteration 45 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:12:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:12:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1487249780, now seen corresponding path program 1 times [2019-09-08 07:12:34,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:12:34,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:12:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:34,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:12:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:12:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-08 07:12:35,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:12:35,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:12:35,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:12:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:12:35,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 2092 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 07:12:35,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:12:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 518 proven. 36 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-08 07:12:36,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:12:36,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 34 [2019-09-08 07:12:36,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 07:12:36,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 07:12:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 07:12:36,319 INFO L87 Difference]: Start difference. First operand 16864 states and 19589 transitions. Second operand 34 states. [2019-09-08 07:13:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:02,842 INFO L93 Difference]: Finished difference Result 57849 states and 67458 transitions. [2019-09-08 07:13:02,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 07:13:02,842 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 456 [2019-09-08 07:13:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:02,923 INFO L225 Difference]: With dead ends: 57849 [2019-09-08 07:13:02,924 INFO L226 Difference]: Without dead ends: 41965 [2019-09-08 07:13:02,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3515 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1480, Invalid=11860, Unknown=0, NotChecked=0, Total=13340 [2019-09-08 07:13:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41965 states. [2019-09-08 07:13:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41965 to 16850. [2019-09-08 07:13:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16850 states. [2019-09-08 07:13:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16850 states to 16850 states and 19575 transitions. [2019-09-08 07:13:04,918 INFO L78 Accepts]: Start accepts. Automaton has 16850 states and 19575 transitions. Word has length 456 [2019-09-08 07:13:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:04,919 INFO L475 AbstractCegarLoop]: Abstraction has 16850 states and 19575 transitions. [2019-09-08 07:13:04,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 07:13:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 16850 states and 19575 transitions. [2019-09-08 07:13:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2019-09-08 07:13:04,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:04,936 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:04,936 INFO L418 AbstractCegarLoop]: === Iteration 46 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash 314886090, now seen corresponding path program 1 times [2019-09-08 07:13:04,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:04,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:04,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:04,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:04,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2019-09-08 07:13:05,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:05,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:05,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:05,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 07:13:05,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 427 proven. 52 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2019-09-08 07:13:05,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:13:05,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2019-09-08 07:13:05,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:13:05,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:13:05,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:13:05,667 INFO L87 Difference]: Start difference. First operand 16850 states and 19575 transitions. Second operand 13 states. [2019-09-08 07:13:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:08,797 INFO L93 Difference]: Finished difference Result 25714 states and 29906 transitions. [2019-09-08 07:13:08,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 07:13:08,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 456 [2019-09-08 07:13:08,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:08,818 INFO L225 Difference]: With dead ends: 25714 [2019-09-08 07:13:08,819 INFO L226 Difference]: Without dead ends: 9417 [2019-09-08 07:13:08,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-09-08 07:13:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2019-09-08 07:13:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 9291. [2019-09-08 07:13:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2019-09-08 07:13:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 10766 transitions. [2019-09-08 07:13:09,763 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 10766 transitions. Word has length 456 [2019-09-08 07:13:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:09,763 INFO L475 AbstractCegarLoop]: Abstraction has 9291 states and 10766 transitions. [2019-09-08 07:13:09,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:13:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 10766 transitions. [2019-09-08 07:13:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 07:13:09,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:09,773 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:09,773 INFO L418 AbstractCegarLoop]: === Iteration 47 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:09,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:09,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1850939226, now seen corresponding path program 1 times [2019-09-08 07:13:09,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:09,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:09,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:09,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:09,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2019-09-08 07:13:10,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:10,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:13:10,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:13:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:13:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:13:10,029 INFO L87 Difference]: Start difference. First operand 9291 states and 10766 transitions. Second operand 11 states. [2019-09-08 07:13:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:12,914 INFO L93 Difference]: Finished difference Result 20597 states and 24331 transitions. [2019-09-08 07:13:12,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:13:12,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 455 [2019-09-08 07:13:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:12,937 INFO L225 Difference]: With dead ends: 20597 [2019-09-08 07:13:12,937 INFO L226 Difference]: Without dead ends: 12038 [2019-09-08 07:13:12,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:13:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12038 states. [2019-09-08 07:13:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12038 to 6924. [2019-09-08 07:13:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6924 states. [2019-09-08 07:13:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6924 states to 6924 states and 7934 transitions. [2019-09-08 07:13:13,739 INFO L78 Accepts]: Start accepts. Automaton has 6924 states and 7934 transitions. Word has length 455 [2019-09-08 07:13:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:13,740 INFO L475 AbstractCegarLoop]: Abstraction has 6924 states and 7934 transitions. [2019-09-08 07:13:13,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:13:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6924 states and 7934 transitions. [2019-09-08 07:13:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-09-08 07:13:13,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:13,748 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:13,748 INFO L418 AbstractCegarLoop]: === Iteration 48 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash 360656079, now seen corresponding path program 1 times [2019-09-08 07:13:13,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:13,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:13,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:13,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2019-09-08 07:13:13,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:13,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:13,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:14,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 2122 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 07:13:14,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2019-09-08 07:13:14,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:13:14,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2019-09-08 07:13:14,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:13:14,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:13:14,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:13:14,492 INFO L87 Difference]: Start difference. First operand 6924 states and 7934 transitions. Second operand 13 states. [2019-09-08 07:13:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:16,618 INFO L93 Difference]: Finished difference Result 15921 states and 18322 transitions. [2019-09-08 07:13:16,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 07:13:16,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 464 [2019-09-08 07:13:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:16,637 INFO L225 Difference]: With dead ends: 15921 [2019-09-08 07:13:16,637 INFO L226 Difference]: Without dead ends: 9729 [2019-09-08 07:13:16,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:13:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9729 states. [2019-09-08 07:13:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9729 to 6420. [2019-09-08 07:13:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6420 states. [2019-09-08 07:13:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6420 states to 6420 states and 7246 transitions. [2019-09-08 07:13:17,373 INFO L78 Accepts]: Start accepts. Automaton has 6420 states and 7246 transitions. Word has length 464 [2019-09-08 07:13:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:17,374 INFO L475 AbstractCegarLoop]: Abstraction has 6420 states and 7246 transitions. [2019-09-08 07:13:17,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:13:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6420 states and 7246 transitions. [2019-09-08 07:13:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:13:17,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:17,381 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:17,381 INFO L418 AbstractCegarLoop]: === Iteration 49 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:17,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1754921271, now seen corresponding path program 1 times [2019-09-08 07:13:17,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:17,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:17,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:17,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 1233 trivial. 0 not checked. [2019-09-08 07:13:18,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:18,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:18,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:18,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 2114 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:13:18,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:18,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:13:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 470 proven. 9 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2019-09-08 07:13:18,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:13:18,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7] total 33 [2019-09-08 07:13:18,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 07:13:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 07:13:18,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:13:18,881 INFO L87 Difference]: Start difference. First operand 6420 states and 7246 transitions. Second operand 33 states. [2019-09-08 07:13:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:30,024 INFO L93 Difference]: Finished difference Result 16211 states and 18442 transitions. [2019-09-08 07:13:30,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 07:13:30,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 466 [2019-09-08 07:13:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:30,044 INFO L225 Difference]: With dead ends: 16211 [2019-09-08 07:13:30,044 INFO L226 Difference]: Without dead ends: 10193 [2019-09-08 07:13:30,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 479 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1061, Invalid=6595, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 07:13:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10193 states. [2019-09-08 07:13:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10193 to 6450. [2019-09-08 07:13:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6450 states. [2019-09-08 07:13:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6450 states to 6450 states and 7267 transitions. [2019-09-08 07:13:30,811 INFO L78 Accepts]: Start accepts. Automaton has 6450 states and 7267 transitions. Word has length 466 [2019-09-08 07:13:30,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:30,811 INFO L475 AbstractCegarLoop]: Abstraction has 6450 states and 7267 transitions. [2019-09-08 07:13:30,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 07:13:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6450 states and 7267 transitions. [2019-09-08 07:13:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:13:30,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:30,820 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:30,820 INFO L418 AbstractCegarLoop]: === Iteration 50 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:30,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1888604324, now seen corresponding path program 1 times [2019-09-08 07:13:30,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:30,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:30,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:30,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:30,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2019-09-08 07:13:31,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:31,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:31,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 2125 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 07:13:31,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2019-09-08 07:13:31,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:13:31,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 17 [2019-09-08 07:13:31,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 07:13:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 07:13:31,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:13:31,616 INFO L87 Difference]: Start difference. First operand 6450 states and 7267 transitions. Second operand 17 states. [2019-09-08 07:13:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:34,644 INFO L93 Difference]: Finished difference Result 15546 states and 17958 transitions. [2019-09-08 07:13:34,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 07:13:34,644 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 466 [2019-09-08 07:13:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:34,666 INFO L225 Difference]: With dead ends: 15546 [2019-09-08 07:13:34,666 INFO L226 Difference]: Without dead ends: 9834 [2019-09-08 07:13:34,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2019-09-08 07:13:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2019-09-08 07:13:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 6390. [2019-09-08 07:13:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6390 states. [2019-09-08 07:13:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 7171 transitions. [2019-09-08 07:13:35,511 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 7171 transitions. Word has length 466 [2019-09-08 07:13:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:35,511 INFO L475 AbstractCegarLoop]: Abstraction has 6390 states and 7171 transitions. [2019-09-08 07:13:35,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 07:13:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 7171 transitions. [2019-09-08 07:13:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:13:35,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:35,520 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:35,520 INFO L418 AbstractCegarLoop]: === Iteration 51 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash 334742131, now seen corresponding path program 1 times [2019-09-08 07:13:35,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:35,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:35,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:35,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-09-08 07:13:36,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:36,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:36,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 2117 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 07:13:36,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 537 proven. 89 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-09-08 07:13:37,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:13:37,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 44 [2019-09-08 07:13:37,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 07:13:37,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 07:13:37,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1751, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 07:13:37,507 INFO L87 Difference]: Start difference. First operand 6390 states and 7171 transitions. Second operand 44 states. [2019-09-08 07:14:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:14:48,451 INFO L93 Difference]: Finished difference Result 52027 states and 61267 transitions. [2019-09-08 07:14:48,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 396 states. [2019-09-08 07:14:48,453 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 467 [2019-09-08 07:14:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:14:48,544 INFO L225 Difference]: With dead ends: 52027 [2019-09-08 07:14:48,544 INFO L226 Difference]: Without dead ends: 46363 [2019-09-08 07:14:48,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 971 GetRequests, 538 SyntacticMatches, 1 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78574 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=12064, Invalid=175858, Unknown=0, NotChecked=0, Total=187922 [2019-09-08 07:14:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46363 states. [2019-09-08 07:14:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46363 to 14002. [2019-09-08 07:14:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14002 states. [2019-09-08 07:14:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14002 states to 14002 states and 15863 transitions. [2019-09-08 07:14:50,542 INFO L78 Accepts]: Start accepts. Automaton has 14002 states and 15863 transitions. Word has length 467 [2019-09-08 07:14:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:14:50,543 INFO L475 AbstractCegarLoop]: Abstraction has 14002 states and 15863 transitions. [2019-09-08 07:14:50,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 07:14:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 14002 states and 15863 transitions. [2019-09-08 07:14:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-08 07:14:50,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:14:50,557 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:50,557 INFO L418 AbstractCegarLoop]: === Iteration 52 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:14:50,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:14:50,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1269530092, now seen corresponding path program 1 times [2019-09-08 07:14:50,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:14:50,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:14:50,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:50,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:50,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-09-08 07:14:51,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:14:51,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:14:51,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:51,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 2118 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 07:14:51,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:14:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 537 proven. 89 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-09-08 07:14:52,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:14:52,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 43 [2019-09-08 07:14:52,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 07:14:52,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 07:14:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1682, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 07:14:52,911 INFO L87 Difference]: Start difference. First operand 14002 states and 15863 transitions. Second operand 43 states. [2019-09-08 07:16:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:36,359 INFO L93 Difference]: Finished difference Result 95882 states and 113508 transitions. [2019-09-08 07:16:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 396 states. [2019-09-08 07:16:36,359 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 468 [2019-09-08 07:16:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:36,542 INFO L225 Difference]: With dead ends: 95882 [2019-09-08 07:16:36,542 INFO L226 Difference]: Without dead ends: 82719 [2019-09-08 07:16:36,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 539 SyntacticMatches, 2 SemanticMatches, 431 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78388 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=11683, Invalid=175373, Unknown=0, NotChecked=0, Total=187056 [2019-09-08 07:16:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82719 states. [2019-09-08 07:16:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82719 to 19533. [2019-09-08 07:16:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-09-08 07:16:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 22207 transitions. [2019-09-08 07:16:39,859 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 22207 transitions. Word has length 468 [2019-09-08 07:16:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:39,860 INFO L475 AbstractCegarLoop]: Abstraction has 19533 states and 22207 transitions. [2019-09-08 07:16:39,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 07:16:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 22207 transitions. [2019-09-08 07:16:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:16:39,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:39,876 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:16:39,876 INFO L418 AbstractCegarLoop]: === Iteration 53 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash 805245276, now seen corresponding path program 1 times [2019-09-08 07:16:39,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 58 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2019-09-08 07:16:40,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:16:40,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:16:40,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:40,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 2125 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 07:16:40,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:16:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 532 proven. 98 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-09-08 07:16:40,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:16:40,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2019-09-08 07:16:40,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 07:16:40,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 07:16:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:16:40,876 INFO L87 Difference]: Start difference. First operand 19533 states and 22207 transitions. Second operand 18 states. [2019-09-08 07:16:42,507 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-08 07:16:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:48,059 INFO L93 Difference]: Finished difference Result 29640 states and 33789 transitions. [2019-09-08 07:16:48,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 07:16:48,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 466 [2019-09-08 07:16:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:48,085 INFO L225 Difference]: With dead ends: 29640 [2019-09-08 07:16:48,085 INFO L226 Difference]: Without dead ends: 11069 [2019-09-08 07:16:48,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 492 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=515, Invalid=3267, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 07:16:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11069 states. [2019-09-08 07:16:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11069 to 9370. [2019-09-08 07:16:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9370 states. [2019-09-08 07:16:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9370 states to 9370 states and 10487 transitions. [2019-09-08 07:16:49,820 INFO L78 Accepts]: Start accepts. Automaton has 9370 states and 10487 transitions. Word has length 466 [2019-09-08 07:16:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:49,821 INFO L475 AbstractCegarLoop]: Abstraction has 9370 states and 10487 transitions. [2019-09-08 07:16:49,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 07:16:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 9370 states and 10487 transitions. [2019-09-08 07:16:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-08 07:16:49,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:49,833 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:16:49,833 INFO L418 AbstractCegarLoop]: === Iteration 54 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:49,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:49,833 INFO L82 PathProgramCache]: Analyzing trace with hash 354689746, now seen corresponding path program 1 times [2019-09-08 07:16:49,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:49,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:49,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:49,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:49,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-09-08 07:16:50,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:16:50,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:16:50,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:16:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:50,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 2117 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 07:16:50,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:16:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 489 proven. 56 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-09-08 07:16:50,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:16:50,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2019-09-08 07:16:50,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:16:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:16:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:16:50,667 INFO L87 Difference]: Start difference. First operand 9370 states and 10487 transitions. Second operand 13 states. [2019-09-08 07:16:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:53,285 INFO L93 Difference]: Finished difference Result 16507 states and 18535 transitions. [2019-09-08 07:16:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 07:16:53,286 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 468 [2019-09-08 07:16:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:53,301 INFO L225 Difference]: With dead ends: 16507 [2019-09-08 07:16:53,302 INFO L226 Difference]: Without dead ends: 7730 [2019-09-08 07:16:53,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-09-08 07:16:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7730 states. [2019-09-08 07:16:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7730 to 7238. [2019-09-08 07:16:54,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-09-08 07:16:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 8064 transitions. [2019-09-08 07:16:54,678 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 8064 transitions. Word has length 468 [2019-09-08 07:16:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:54,678 INFO L475 AbstractCegarLoop]: Abstraction has 7238 states and 8064 transitions. [2019-09-08 07:16:54,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:16:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 8064 transitions. [2019-09-08 07:16:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:16:54,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:54,685 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:16:54,685 INFO L418 AbstractCegarLoop]: === Iteration 55 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:54,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash 404292146, now seen corresponding path program 1 times [2019-09-08 07:16:54,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:54,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:54,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:54,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:54,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2019-09-08 07:16:54,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:54,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:16:54,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:16:54,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:16:54,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:16:54,969 INFO L87 Difference]: Start difference. First operand 7238 states and 8064 transitions. Second operand 11 states. [2019-09-08 07:16:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:59,061 INFO L93 Difference]: Finished difference Result 21440 states and 24570 transitions. [2019-09-08 07:16:59,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 07:16:59,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 466 [2019-09-08 07:16:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:59,088 INFO L225 Difference]: With dead ends: 21440 [2019-09-08 07:16:59,088 INFO L226 Difference]: Without dead ends: 14767 [2019-09-08 07:16:59,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2019-09-08 07:16:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14767 states. [2019-09-08 07:17:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14767 to 7950. [2019-09-08 07:17:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7950 states. [2019-09-08 07:17:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7950 states to 7950 states and 8766 transitions. [2019-09-08 07:17:00,369 INFO L78 Accepts]: Start accepts. Automaton has 7950 states and 8766 transitions. Word has length 466 [2019-09-08 07:17:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:00,369 INFO L475 AbstractCegarLoop]: Abstraction has 7950 states and 8766 transitions. [2019-09-08 07:17:00,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:17:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 7950 states and 8766 transitions. [2019-09-08 07:17:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:17:00,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:00,376 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:17:00,376 INFO L418 AbstractCegarLoop]: === Iteration 56 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash -453343696, now seen corresponding path program 1 times [2019-09-08 07:17:00,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:00,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:00,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2019-09-08 07:17:00,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:17:00,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:17:00,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:17:00,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:17:00,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:17:00,520 INFO L87 Difference]: Start difference. First operand 7950 states and 8766 transitions. Second operand 4 states. [2019-09-08 07:17:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:02,763 INFO L93 Difference]: Finished difference Result 18680 states and 21087 transitions. [2019-09-08 07:17:02,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:17:02,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2019-09-08 07:17:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:02,783 INFO L225 Difference]: With dead ends: 18680 [2019-09-08 07:17:02,784 INFO L226 Difference]: Without dead ends: 11575 [2019-09-08 07:17:02,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:17:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11575 states. [2019-09-08 07:17:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11575 to 7880. [2019-09-08 07:17:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7880 states. [2019-09-08 07:17:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7880 states to 7880 states and 8656 transitions. [2019-09-08 07:17:04,030 INFO L78 Accepts]: Start accepts. Automaton has 7880 states and 8656 transitions. Word has length 466 [2019-09-08 07:17:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:04,030 INFO L475 AbstractCegarLoop]: Abstraction has 7880 states and 8656 transitions. [2019-09-08 07:17:04,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:17:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7880 states and 8656 transitions. [2019-09-08 07:17:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:17:04,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:04,037 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:17:04,037 INFO L418 AbstractCegarLoop]: === Iteration 57 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash -569565640, now seen corresponding path program 1 times [2019-09-08 07:17:04,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:04,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:04,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:04,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2019-09-08 07:17:04,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:17:04,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:17:04,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:17:04,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:17:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:17:04,325 INFO L87 Difference]: Start difference. First operand 7880 states and 8656 transitions. Second operand 11 states. [2019-09-08 07:17:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:07,818 INFO L93 Difference]: Finished difference Result 20697 states and 23560 transitions. [2019-09-08 07:17:07,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 07:17:07,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 467 [2019-09-08 07:17:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:07,850 INFO L225 Difference]: With dead ends: 20697 [2019-09-08 07:17:07,850 INFO L226 Difference]: Without dead ends: 13652 [2019-09-08 07:17:07,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:17:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13652 states. [2019-09-08 07:17:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13652 to 7880. [2019-09-08 07:17:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7880 states. [2019-09-08 07:17:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7880 states to 7880 states and 8636 transitions. [2019-09-08 07:17:09,273 INFO L78 Accepts]: Start accepts. Automaton has 7880 states and 8636 transitions. Word has length 467 [2019-09-08 07:17:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:09,274 INFO L475 AbstractCegarLoop]: Abstraction has 7880 states and 8636 transitions. [2019-09-08 07:17:09,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:17:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 7880 states and 8636 transitions. [2019-09-08 07:17:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:17:09,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:09,281 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:17:09,281 INFO L418 AbstractCegarLoop]: === Iteration 58 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:09,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash -311400202, now seen corresponding path program 1 times [2019-09-08 07:17:09,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:09,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:09,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2019-09-08 07:17:09,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:17:09,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:17:09,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:17:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:17:09,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:17:09,447 INFO L87 Difference]: Start difference. First operand 7880 states and 8636 transitions. Second operand 4 states. [2019-09-08 07:17:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:10,714 INFO L93 Difference]: Finished difference Result 14960 states and 16457 transitions. [2019-09-08 07:17:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:17:10,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2019-09-08 07:17:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:10,730 INFO L225 Difference]: With dead ends: 14960 [2019-09-08 07:17:10,730 INFO L226 Difference]: Without dead ends: 7950 [2019-09-08 07:17:10,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:17:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7950 states. [2019-09-08 07:17:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7950 to 7880. [2019-09-08 07:17:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7880 states. [2019-09-08 07:17:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7880 states to 7880 states and 8626 transitions. [2019-09-08 07:17:12,112 INFO L78 Accepts]: Start accepts. Automaton has 7880 states and 8626 transitions. Word has length 467 [2019-09-08 07:17:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:12,113 INFO L475 AbstractCegarLoop]: Abstraction has 7880 states and 8626 transitions. [2019-09-08 07:17:12,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:17:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7880 states and 8626 transitions. [2019-09-08 07:17:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:17:12,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:12,120 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:17:12,120 INFO L418 AbstractCegarLoop]: === Iteration 59 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1384494513, now seen corresponding path program 1 times [2019-09-08 07:17:12,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:12,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:12,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:12,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:12,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 85 proven. 52 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-09-08 07:17:12,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:17:12,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:17:12,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:12,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 2124 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 07:17:12,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:17:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 544 proven. 98 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2019-09-08 07:17:12,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:17:12,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2019-09-08 07:17:12,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 07:17:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 07:17:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:17:12,999 INFO L87 Difference]: Start difference. First operand 7880 states and 8626 transitions. Second operand 18 states. [2019-09-08 07:17:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:20,755 INFO L93 Difference]: Finished difference Result 21622 states and 23804 transitions. [2019-09-08 07:17:20,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 07:17:20,756 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 467 [2019-09-08 07:17:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:20,785 INFO L225 Difference]: With dead ends: 21622 [2019-09-08 07:17:20,785 INFO L226 Difference]: Without dead ends: 14560 [2019-09-08 07:17:20,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 502 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=591, Invalid=3699, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 07:17:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14560 states. [2019-09-08 07:17:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14560 to 12370. [2019-09-08 07:17:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12370 states. [2019-09-08 07:17:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12370 states to 12370 states and 13501 transitions. [2019-09-08 07:17:23,645 INFO L78 Accepts]: Start accepts. Automaton has 12370 states and 13501 transitions. Word has length 467 [2019-09-08 07:17:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:23,645 INFO L475 AbstractCegarLoop]: Abstraction has 12370 states and 13501 transitions. [2019-09-08 07:17:23,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 07:17:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 12370 states and 13501 transitions. [2019-09-08 07:17:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-08 07:17:23,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:23,658 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:17:23,658 INFO L418 AbstractCegarLoop]: === Iteration 60 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1880621623, now seen corresponding path program 1 times [2019-09-08 07:17:23,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:23,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:23,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:23,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:23,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2019-09-08 07:17:24,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:17:24,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:17:24,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:17:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:24,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 07:17:24,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:17:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 536 proven. 92 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2019-09-08 07:17:24,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:17:24,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2019-09-08 07:17:24,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 07:17:24,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 07:17:24,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2019-09-08 07:17:24,789 INFO L87 Difference]: Start difference. First operand 12370 states and 13501 transitions. Second operand 27 states.