/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:34:38,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:34:38,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:34:38,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:34:38,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:34:38,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:34:38,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:34:38,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:34:38,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:34:38,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:34:38,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:34:38,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:34:38,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:34:38,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:34:38,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:34:38,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:34:38,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:34:38,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:34:38,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:34:38,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:34:38,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:34:38,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:34:38,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:34:38,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:34:38,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:34:38,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:34:38,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:34:38,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:34:38,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:34:38,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:34:38,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:34:38,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:34:38,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:34:38,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:34:38,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:34:38,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:34:38,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:34:38,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:34:38,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:34:38,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:34:38,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:34:38,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:34:39,024 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:34:39,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:34:39,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:34:39,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:34:39,027 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:34:39,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:34:39,030 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:34:39,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:34:39,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:34:39,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:34:39,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:34:39,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:34:39,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:34:39,032 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:34:39,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:34:39,032 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:34:39,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:34:39,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:34:39,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:34:39,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:34:39,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:34:39,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:34:39,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:34:39,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:34:39,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:34:39,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:34:39,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:34:39,037 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:34:39,037 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:34:39,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:34:39,037 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:34:39,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:34:39,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:34:39,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:34:39,390 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:34:39,390 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:34:39,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-10-22 00:34:39,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdad3227/67ad7695c73f4baf9e8e2c116e2e37b4/FLAG37a033626 [2020-10-22 00:34:40,056 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:34:40,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-10-22 00:34:40,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdad3227/67ad7695c73f4baf9e8e2c116e2e37b4/FLAG37a033626 [2020-10-22 00:34:40,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdad3227/67ad7695c73f4baf9e8e2c116e2e37b4 [2020-10-22 00:34:40,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:34:40,327 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:34:40,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:34:40,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:34:40,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:34:40,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:34:40" (1/1) ... [2020-10-22 00:34:40,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1a2643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:40, skipping insertion in model container [2020-10-22 00:34:40,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:34:40" (1/1) ... [2020-10-22 00:34:40,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:34:40,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:34:40,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:34:40,999 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:34:41,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:34:41,184 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:34:41,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41 WrapperNode [2020-10-22 00:34:41,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:34:41,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:34:41,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:34:41,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:34:41,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (1/1) ... [2020-10-22 00:34:41,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (1/1) ... [2020-10-22 00:34:41,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:34:41,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:34:41,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:34:41,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:34:41,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (1/1) ... [2020-10-22 00:34:41,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (1/1) ... [2020-10-22 00:34:41,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (1/1) ... [2020-10-22 00:34:41,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (1/1) ... [2020-10-22 00:34:41,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (1/1) ... [2020-10-22 00:34:41,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (1/1) ... [2020-10-22 00:34:41,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (1/1) ... [2020-10-22 00:34:41,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:34:41,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:34:41,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:34:41,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:34:41,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (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 [2020-10-22 00:34:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:34:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:34:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:34:41,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:34:41,433 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:34:41,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:34:41,433 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:34:41,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:34:41,434 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:34:41,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:34:41,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:34:41,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:34:41,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:34:41,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:34:41,437 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:34:43,684 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:34:43,685 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:34:43,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:34:43 BoogieIcfgContainer [2020-10-22 00:34:43,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:34:43,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:34:43,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:34:43,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:34:43,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:34:40" (1/3) ... [2020-10-22 00:34:43,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c16609c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:34:43, skipping insertion in model container [2020-10-22 00:34:43,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:41" (2/3) ... [2020-10-22 00:34:43,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c16609c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:34:43, skipping insertion in model container [2020-10-22 00:34:43,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:34:43" (3/3) ... [2020-10-22 00:34:43,697 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2020-10-22 00:34:43,710 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:34:43,710 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:34:43,719 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:34:43,720 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:34:43,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,752 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,752 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,753 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,754 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,757 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,757 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,760 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,760 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,767 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,768 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,773 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,773 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,779 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,780 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:43,783 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:34:43,797 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:34:43,820 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:34:43,820 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:34:43,820 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:34:43,820 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:34:43,820 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:34:43,821 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:34:43,821 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:34:43,821 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:34:43,836 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:34:43,837 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 00:34:43,840 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 00:34:43,842 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-22 00:34:43,892 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-22 00:34:43,892 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:34:43,898 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-22 00:34:43,901 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-22 00:34:45,665 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-22 00:34:45,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 00:34:45,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:34:45,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-22 00:34:45,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:34:46,474 WARN L193 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-22 00:34:47,043 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 00:34:47,176 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 00:34:48,397 WARN L193 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-22 00:34:48,725 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-22 00:34:50,198 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-22 00:34:50,536 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-22 00:34:50,960 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-22 00:34:51,135 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 00:34:51,176 INFO L131 LiptonReduction]: Checked pairs total: 4956 [2020-10-22 00:34:51,176 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-22 00:34:51,184 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-22 00:34:51,235 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-22 00:34:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-22 00:34:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 00:34:51,245 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:51,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 00:34:51,246 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:51,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1092291, now seen corresponding path program 1 times [2020-10-22 00:34:51,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:51,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781047164] [2020-10-22 00:34:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:34:51,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781047164] [2020-10-22 00:34:51,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:51,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:34:51,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2021797543] [2020-10-22 00:34:51,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:51,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:51,531 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 00:34:51,532 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:51,536 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:51,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:34:51,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:34:51,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:51,555 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-22 00:34:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:51,653 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-22 00:34:51,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:51,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 00:34:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:51,683 INFO L225 Difference]: With dead ends: 687 [2020-10-22 00:34:51,683 INFO L226 Difference]: Without dead ends: 562 [2020-10-22 00:34:51,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-22 00:34:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-22 00:34:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-22 00:34:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-22 00:34:51,786 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-22 00:34:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:51,786 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-22 00:34:51,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:34:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-22 00:34:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:34:51,788 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:51,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:51,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:34:51,788 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1825720558, now seen corresponding path program 1 times [2020-10-22 00:34:51,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:51,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323042599] [2020-10-22 00:34:51,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:34:51,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323042599] [2020-10-22 00:34:51,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:51,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:34:51,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1874201352] [2020-10-22 00:34:51,934 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:51,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:51,937 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:34:51,938 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:51,938 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:51,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:34:51,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:51,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:34:51,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:51,944 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-22 00:34:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:51,968 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-10-22 00:34:51,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:51,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 00:34:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:51,975 INFO L225 Difference]: With dead ends: 537 [2020-10-22 00:34:51,976 INFO L226 Difference]: Without dead ends: 537 [2020-10-22 00:34:51,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-22 00:34:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-10-22 00:34:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-10-22 00:34:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-10-22 00:34:52,012 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 9 [2020-10-22 00:34:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:52,019 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-10-22 00:34:52,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:34:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-10-22 00:34:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:34:52,024 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:52,024 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:52,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:34:52,025 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash -762762965, now seen corresponding path program 1 times [2020-10-22 00:34:52,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:52,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572652632] [2020-10-22 00:34:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:34:52,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572652632] [2020-10-22 00:34:52,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:52,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:34:52,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [156914444] [2020-10-22 00:34:52,132 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:52,133 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:52,138 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions. [2020-10-22 00:34:52,138 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:52,202 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:52,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:34:52,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:34:52,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:52,206 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 3 states. [2020-10-22 00:34:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:52,223 INFO L93 Difference]: Finished difference Result 529 states and 1605 transitions. [2020-10-22 00:34:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:52,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 00:34:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:52,235 INFO L225 Difference]: With dead ends: 529 [2020-10-22 00:34:52,235 INFO L226 Difference]: Without dead ends: 529 [2020-10-22 00:34:52,236 INFO L677 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 [2020-10-22 00:34:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-22 00:34:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2020-10-22 00:34:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-22 00:34:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions. [2020-10-22 00:34:52,257 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 10 [2020-10-22 00:34:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:52,257 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions. [2020-10-22 00:34:52,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:34:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions. [2020-10-22 00:34:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:34:52,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:52,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:52,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:34:52,265 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2124151563, now seen corresponding path program 1 times [2020-10-22 00:34:52,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:52,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543107498] [2020-10-22 00:34:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:34:52,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543107498] [2020-10-22 00:34:52,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:52,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:34:52,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1000227528] [2020-10-22 00:34:52,417 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:52,419 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:52,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 31 transitions. [2020-10-22 00:34:52,423 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:52,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:52,459 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:52,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:52,488 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:52,497 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:52,515 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:34:52,724 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:52,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:34:52,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:34:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:34:52,726 INFO L87 Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand 4 states. [2020-10-22 00:34:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:52,806 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions. [2020-10-22 00:34:52,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:34:52,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 00:34:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:52,810 INFO L225 Difference]: With dead ends: 677 [2020-10-22 00:34:52,811 INFO L226 Difference]: Without dead ends: 377 [2020-10-22 00:34:52,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:34:52,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-10-22 00:34:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-10-22 00:34:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-22 00:34:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions. [2020-10-22 00:34:52,823 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 11 [2020-10-22 00:34:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:52,824 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions. [2020-10-22 00:34:52,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:34:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions. [2020-10-22 00:34:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:34:52,825 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:52,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:52,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:34:52,825 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:52,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1424343219, now seen corresponding path program 1 times [2020-10-22 00:34:52,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:52,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479519520] [2020-10-22 00:34:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:34:52,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479519520] [2020-10-22 00:34:52,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:52,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:34:52,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271935442] [2020-10-22 00:34:52,898 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:52,900 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:52,904 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 32 transitions. [2020-10-22 00:34:52,904 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:52,921 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 00:34:52,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:52,922 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:34:52,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:52,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:52,931 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:34:53,139 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:53,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:34:53,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:53,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:34:53,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:53,140 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand 3 states. [2020-10-22 00:34:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:53,173 INFO L93 Difference]: Finished difference Result 374 states and 1066 transitions. [2020-10-22 00:34:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:53,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 00:34:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:53,177 INFO L225 Difference]: With dead ends: 374 [2020-10-22 00:34:53,178 INFO L226 Difference]: Without dead ends: 374 [2020-10-22 00:34:53,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2020-10-22 00:34:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2020-10-22 00:34:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-10-22 00:34:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1066 transitions. [2020-10-22 00:34:53,193 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1066 transitions. Word has length 12 [2020-10-22 00:34:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:53,193 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 1066 transitions. [2020-10-22 00:34:53,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:34:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1066 transitions. [2020-10-22 00:34:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:34:53,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:53,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:53,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:34:53,195 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:53,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1605853390, now seen corresponding path program 1 times [2020-10-22 00:34:53,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:53,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642193673] [2020-10-22 00:34:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:34:53,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642193673] [2020-10-22 00:34:53,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:53,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:34:53,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1168780826] [2020-10-22 00:34:53,356 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:53,360 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:53,369 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-10-22 00:34:53,369 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:53,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:53,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:53,391 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:53,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:53,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,023 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:54,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:34:54,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:54,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:34:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:34:54,025 INFO L87 Difference]: Start difference. First operand 374 states and 1066 transitions. Second operand 5 states. [2020-10-22 00:34:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:54,068 INFO L93 Difference]: Finished difference Result 372 states and 1058 transitions. [2020-10-22 00:34:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:54,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:34:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:54,074 INFO L225 Difference]: With dead ends: 372 [2020-10-22 00:34:54,074 INFO L226 Difference]: Without dead ends: 372 [2020-10-22 00:34:54,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:34:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-10-22 00:34:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2020-10-22 00:34:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-10-22 00:34:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1058 transitions. [2020-10-22 00:34:54,088 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1058 transitions. Word has length 13 [2020-10-22 00:34:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:54,089 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 1058 transitions. [2020-10-22 00:34:54,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:34:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1058 transitions. [2020-10-22 00:34:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:34:54,090 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:54,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:54,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:34:54,091 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1204965012, now seen corresponding path program 1 times [2020-10-22 00:34:54,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:54,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602870705] [2020-10-22 00:34:54,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:34:54,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602870705] [2020-10-22 00:34:54,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:54,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:34:54,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873579849] [2020-10-22 00:34:54,182 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:54,187 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:54,191 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 33 transitions. [2020-10-22 00:34:54,192 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:54,225 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:54,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,408 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:54,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:34:54,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:54,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:34:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:34:54,410 INFO L87 Difference]: Start difference. First operand 372 states and 1058 transitions. Second operand 4 states. [2020-10-22 00:34:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:54,488 INFO L93 Difference]: Finished difference Result 379 states and 1080 transitions. [2020-10-22 00:34:54,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:34:54,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 00:34:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:54,493 INFO L225 Difference]: With dead ends: 379 [2020-10-22 00:34:54,493 INFO L226 Difference]: Without dead ends: 379 [2020-10-22 00:34:54,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:34:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-10-22 00:34:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2020-10-22 00:34:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-10-22 00:34:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1066 transitions. [2020-10-22 00:34:54,508 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1066 transitions. Word has length 13 [2020-10-22 00:34:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:54,509 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 1066 transitions. [2020-10-22 00:34:54,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:34:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1066 transitions. [2020-10-22 00:34:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:34:54,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:54,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:54,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:34:54,512 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:54,512 INFO L82 PathProgramCache]: Analyzing trace with hash 438940752, now seen corresponding path program 2 times [2020-10-22 00:34:54,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:54,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014247224] [2020-10-22 00:34:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:34:54,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014247224] [2020-10-22 00:34:54,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:54,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:34:54,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [719577669] [2020-10-22 00:34:54,642 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:54,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:54,649 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-22 00:34:54,649 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:54,856 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:54,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:34:54,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:34:54,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:34:54,858 INFO L87 Difference]: Start difference. First operand 375 states and 1066 transitions. Second operand 5 states. [2020-10-22 00:34:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:54,931 INFO L93 Difference]: Finished difference Result 370 states and 1050 transitions. [2020-10-22 00:34:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:34:54,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:34:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:54,935 INFO L225 Difference]: With dead ends: 370 [2020-10-22 00:34:54,935 INFO L226 Difference]: Without dead ends: 370 [2020-10-22 00:34:54,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:34:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-10-22 00:34:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 363. [2020-10-22 00:34:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-10-22 00:34:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 1028 transitions. [2020-10-22 00:34:54,947 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 1028 transitions. Word has length 13 [2020-10-22 00:34:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:54,948 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 1028 transitions. [2020-10-22 00:34:54,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:34:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 1028 transitions. [2020-10-22 00:34:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:34:54,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:54,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:54,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:34:54,953 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:54,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1758105819, now seen corresponding path program 1 times [2020-10-22 00:34:54,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:54,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809258577] [2020-10-22 00:34:54,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:34:55,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809258577] [2020-10-22 00:34:55,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:55,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:34:55,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932367637] [2020-10-22 00:34:55,077 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:55,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:55,088 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 73 transitions. [2020-10-22 00:34:55,089 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:55,108 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-22 00:34:55,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,110 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 00:34:55,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,112 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:34:55,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:34:55,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:55,142 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:34:55,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:55,207 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 00:34:55,370 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 00:34:55,624 INFO L721 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 00:34:56,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:56,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:56,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:56,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:56,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:57,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:57,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:57,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:57,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:57,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:57,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:57,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:58,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:58,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:58,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:58,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:58,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:58,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:58,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:58,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:58,847 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:34:58,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:58,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:59,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:00,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:00,913 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:00,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:00,922 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:00,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:00,927 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:01,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:01,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:01,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:01,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:01,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:01,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:01,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:01,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:01,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:02,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:02,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:02,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:02,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:02,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:02,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:02,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:02,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,296 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:03,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:03,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:03,333 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:03,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:03,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:04,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:05,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:05,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:05,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:35:05,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:05,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:35:05,191 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:35:05,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:05,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:05,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:05,228 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:05,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:05,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:05,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:05,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:05,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:05,323 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:05,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:05,374 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 00:35:05,440 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 00:35:05,542 INFO L721 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 00:35:05,714 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:05,802 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:05,883 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:05,963 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,082 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,161 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,279 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,370 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,468 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,546 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,626 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,723 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,798 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,888 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:06,962 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,055 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,226 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,365 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,462 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,541 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,580 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,581 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:07,676 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,739 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,796 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,849 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,926 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:07,999 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,072 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,142 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,216 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,259 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,320 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,373 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,430 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,483 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,527 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,635 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,708 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,789 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,839 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,924 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:08,983 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,025 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,077 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,159 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,201 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,254 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,296 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,348 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,390 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,436 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,489 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,531 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,583 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,627 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,669 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,721 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,772 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,823 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,874 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:09,947 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,003 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,067 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,119 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,172 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,214 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,265 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,308 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,367 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,408 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,450 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,502 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,544 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,599 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,655 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,718 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,770 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,812 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,869 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,910 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:10,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:35:10,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:10,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:10,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:10,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:10,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:10,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,014 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 00:35:11,070 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 00:35:11,136 INFO L721 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 00:35:11,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:11,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,059 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:12,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:12,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:12,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:13,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:14,804 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:14,855 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:14,896 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:14,937 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:14,989 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,030 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,081 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,123 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,185 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,226 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,268 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,319 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,360 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,411 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,453 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,494 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,544 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,585 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,636 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,677 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:15,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:15,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:15,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:15,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:15,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:15,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:15,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:16,582 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:16,634 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:16,675 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:16,716 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:16,767 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:16,809 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:16,860 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:16,901 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:16,957 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,005 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,053 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,112 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,156 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,207 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,248 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,290 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,341 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,382 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,434 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,475 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,546 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,598 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,639 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,681 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,732 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,773 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,824 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,880 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:17,973 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,015 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,066 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,107 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,161 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,203 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,244 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,296 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,337 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,389 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,430 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:35:18,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:18,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:19,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:19,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:19,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:19,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:19,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:19,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:19,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:35:19,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:19,265 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:19,653 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 29 [2020-10-22 00:35:19,671 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-10-22 00:35:19,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:19,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 3, 2, 1] term [2020-10-22 00:35:19,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:19,673 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 2, 1] term [2020-10-22 00:35:19,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:19,674 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:35:19,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:19,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:19,951 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2020-10-22 00:35:19,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-10-22 00:35:19,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:19,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-10-22 00:35:19,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:19,970 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:35:19,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:19,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:21,027 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [12700#(and (= ~z$r_buff0_thd0~0 0) (or (= ~z$w_buff1~0 ~z~0) (not (= (mod ~z$r_buff1_thd2~0 256) 0))) (or (= ~z$w_buff1~0 ~z$w_buff0~0) (= (mod ~z$r_buff0_thd2~0 256) 0)) (not (= ~z$w_buff1~0 2)) (or (= ~z$w_buff1~0 ~z~0) (not (= (mod ~z$w_buff1_used~0 256) 0))) (= ~z$r_buff1_thd0~0 0)), 12701#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 2)) (= (mod ~z$r_buff0_thd2~0 256) 0)), 12702#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd2~0 0) (not (= ~z$w_buff0~0 2)))] [2020-10-22 00:35:21,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:35:21,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:35:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:35:21,029 INFO L87 Difference]: Start difference. First operand 363 states and 1028 transitions. Second operand 9 states. [2020-10-22 00:35:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:21,170 INFO L93 Difference]: Finished difference Result 359 states and 1014 transitions. [2020-10-22 00:35:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:35:21,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-22 00:35:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:21,176 INFO L225 Difference]: With dead ends: 359 [2020-10-22 00:35:21,176 INFO L226 Difference]: Without dead ends: 359 [2020-10-22 00:35:21,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:35:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-10-22 00:35:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2020-10-22 00:35:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-10-22 00:35:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1014 transitions. [2020-10-22 00:35:21,188 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1014 transitions. Word has length 14 [2020-10-22 00:35:21,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:21,188 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 1014 transitions. [2020-10-22 00:35:21,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:35:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1014 transitions. [2020-10-22 00:35:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:35:21,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:21,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:21,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:35:21,190 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:21,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1758150645, now seen corresponding path program 1 times [2020-10-22 00:35:21,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:21,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199743731] [2020-10-22 00:35:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:35:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:35:21,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199743731] [2020-10-22 00:35:21,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:35:21,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:35:21,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339161675] [2020-10-22 00:35:21,268 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:35:21,270 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:35:21,276 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 71 transitions. [2020-10-22 00:35:21,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:35:21,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:21,291 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:21,296 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:35:21,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:21,302 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:35:21,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:35:21,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:35:21,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:21,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:35:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:35:21,820 INFO L87 Difference]: Start difference. First operand 359 states and 1014 transitions. Second operand 5 states. [2020-10-22 00:35:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:21,922 INFO L93 Difference]: Finished difference Result 404 states and 1144 transitions. [2020-10-22 00:35:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:35:21,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 00:35:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:21,926 INFO L225 Difference]: With dead ends: 404 [2020-10-22 00:35:21,927 INFO L226 Difference]: Without dead ends: 404 [2020-10-22 00:35:21,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:35:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-10-22 00:35:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 374. [2020-10-22 00:35:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-10-22 00:35:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1051 transitions. [2020-10-22 00:35:21,940 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1051 transitions. Word has length 14 [2020-10-22 00:35:21,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:21,940 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 1051 transitions. [2020-10-22 00:35:21,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:35:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1051 transitions. [2020-10-22 00:35:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:35:21,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:21,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:21,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:35:21,942 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:21,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:21,942 INFO L82 PathProgramCache]: Analyzing trace with hash 992126385, now seen corresponding path program 2 times [2020-10-22 00:35:21,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:21,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227264102] [2020-10-22 00:35:21,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:35:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:35:22,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227264102] [2020-10-22 00:35:22,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:35:22,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:35:22,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2047513637] [2020-10-22 00:35:22,058 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:35:22,060 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:35:22,066 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 72 transitions. [2020-10-22 00:35:22,066 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:35:22,741 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14949#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1))] [2020-10-22 00:35:22,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:35:22,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:35:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:35:22,742 INFO L87 Difference]: Start difference. First operand 374 states and 1051 transitions. Second operand 7 states. [2020-10-22 00:35:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:22,921 INFO L93 Difference]: Finished difference Result 414 states and 1164 transitions. [2020-10-22 00:35:22,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:35:22,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-22 00:35:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:22,926 INFO L225 Difference]: With dead ends: 414 [2020-10-22 00:35:22,926 INFO L226 Difference]: Without dead ends: 414 [2020-10-22 00:35:22,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:35:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-10-22 00:35:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 393. [2020-10-22 00:35:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-10-22 00:35:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1114 transitions. [2020-10-22 00:35:22,939 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1114 transitions. Word has length 14 [2020-10-22 00:35:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:22,940 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 1114 transitions. [2020-10-22 00:35:22,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:35:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1114 transitions. [2020-10-22 00:35:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:35:22,941 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:22,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:22,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:35:22,941 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:22,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906856, now seen corresponding path program 1 times [2020-10-22 00:35:22,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:22,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501814427] [2020-10-22 00:35:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:35:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:35:23,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501814427] [2020-10-22 00:35:23,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:35:23,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:35:23,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878576180] [2020-10-22 00:35:23,070 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:35:23,072 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:35:23,080 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 72 transitions. [2020-10-22 00:35:23,081 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:35:23,093 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:35:23,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:23,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:23,103 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:35:23,104 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:35:23,106 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:35:23,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:23,112 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:35:23,674 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:35:23,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:35:23,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:23,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:35:23,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:35:23,676 INFO L87 Difference]: Start difference. First operand 393 states and 1114 transitions. Second operand 6 states. [2020-10-22 00:35:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:23,742 INFO L93 Difference]: Finished difference Result 407 states and 1145 transitions. [2020-10-22 00:35:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:35:23,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 00:35:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:23,753 INFO L225 Difference]: With dead ends: 407 [2020-10-22 00:35:23,753 INFO L226 Difference]: Without dead ends: 407 [2020-10-22 00:35:23,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:35:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-10-22 00:35:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 371. [2020-10-22 00:35:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-10-22 00:35:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1043 transitions. [2020-10-22 00:35:23,771 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1043 transitions. Word has length 15 [2020-10-22 00:35:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:23,772 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 1043 transitions. [2020-10-22 00:35:23,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:35:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1043 transitions. [2020-10-22 00:35:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:35:23,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:23,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:23,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:35:23,774 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:23,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906639, now seen corresponding path program 1 times [2020-10-22 00:35:23,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:23,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246430167] [2020-10-22 00:35:23,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:35:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:35:23,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246430167] [2020-10-22 00:35:23,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:35:23,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:35:23,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1635662839] [2020-10-22 00:35:23,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:35:23,938 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:35:23,945 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 72 transitions. [2020-10-22 00:35:23,945 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:35:23,957 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:35:23,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:23,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:23,965 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 00:35:23,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:23,975 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:35:24,581 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:35:24,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:35:24,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:24,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:35:24,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:35:24,583 INFO L87 Difference]: Start difference. First operand 371 states and 1043 transitions. Second operand 6 states. [2020-10-22 00:35:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:24,702 INFO L93 Difference]: Finished difference Result 502 states and 1374 transitions. [2020-10-22 00:35:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:35:24,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 00:35:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:24,708 INFO L225 Difference]: With dead ends: 502 [2020-10-22 00:35:24,708 INFO L226 Difference]: Without dead ends: 490 [2020-10-22 00:35:24,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:35:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-22 00:35:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 404. [2020-10-22 00:35:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-10-22 00:35:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1115 transitions. [2020-10-22 00:35:24,722 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1115 transitions. Word has length 15 [2020-10-22 00:35:24,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:24,722 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 1115 transitions. [2020-10-22 00:35:24,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:35:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1115 transitions. [2020-10-22 00:35:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:35:24,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:24,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:24,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:35:24,724 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:24,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1331920527, now seen corresponding path program 1 times [2020-10-22 00:35:24,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:24,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157024205] [2020-10-22 00:35:24,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:35:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:35:24,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157024205] [2020-10-22 00:35:24,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:35:24,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:35:24,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [879536920] [2020-10-22 00:35:24,781 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:35:24,783 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:35:24,796 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 120 transitions. [2020-10-22 00:35:24,796 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:35:24,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:35:25,520 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:35:25,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:35:25,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:25,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:35:25,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:35:25,522 INFO L87 Difference]: Start difference. First operand 404 states and 1115 transitions. Second operand 5 states. [2020-10-22 00:35:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:25,596 INFO L93 Difference]: Finished difference Result 623 states and 1686 transitions. [2020-10-22 00:35:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:35:25,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 00:35:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:25,601 INFO L225 Difference]: With dead ends: 623 [2020-10-22 00:35:25,601 INFO L226 Difference]: Without dead ends: 402 [2020-10-22 00:35:25,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:35:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-22 00:35:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 384. [2020-10-22 00:35:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-10-22 00:35:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1002 transitions. [2020-10-22 00:35:25,615 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1002 transitions. Word has length 15 [2020-10-22 00:35:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:25,615 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 1002 transitions. [2020-10-22 00:35:25,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:35:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1002 transitions. [2020-10-22 00:35:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:35:25,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:25,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:25,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 00:35:25,617 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:25,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1154086099, now seen corresponding path program 2 times [2020-10-22 00:35:25,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:25,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273431950] [2020-10-22 00:35:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:35:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:35:25,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273431950] [2020-10-22 00:35:25,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:35:25,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:35:25,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [30063200] [2020-10-22 00:35:25,699 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:35:25,701 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:35:25,714 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 113 transitions. [2020-10-22 00:35:25,714 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:35:25,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:25,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:25,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:25,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:26,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:35:26,143 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20031#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 00:35:26,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:35:26,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:26,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:35:26,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:35:26,145 INFO L87 Difference]: Start difference. First operand 384 states and 1002 transitions. Second operand 5 states. [2020-10-22 00:35:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:26,205 INFO L93 Difference]: Finished difference Result 277 states and 651 transitions. [2020-10-22 00:35:26,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:35:26,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 00:35:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:26,209 INFO L225 Difference]: With dead ends: 277 [2020-10-22 00:35:26,209 INFO L226 Difference]: Without dead ends: 186 [2020-10-22 00:35:26,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:35:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-22 00:35:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-10-22 00:35:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-22 00:35:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 387 transitions. [2020-10-22 00:35:26,219 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 387 transitions. Word has length 15 [2020-10-22 00:35:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:26,219 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 387 transitions. [2020-10-22 00:35:26,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:35:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 387 transitions. [2020-10-22 00:35:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:35:26,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:26,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:26,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 00:35:26,221 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:26,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1909702425, now seen corresponding path program 1 times [2020-10-22 00:35:26,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:26,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318127725] [2020-10-22 00:35:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:35:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:35:26,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318127725] [2020-10-22 00:35:26,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:35:26,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:35:26,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [115911079] [2020-10-22 00:35:26,353 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:35:26,359 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:35:26,368 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 68 transitions. [2020-10-22 00:35:26,368 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:35:26,963 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:35:26,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:35:26,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:26,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:35:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:35:26,965 INFO L87 Difference]: Start difference. First operand 186 states and 387 transitions. Second operand 6 states. [2020-10-22 00:35:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:27,109 INFO L93 Difference]: Finished difference Result 245 states and 485 transitions. [2020-10-22 00:35:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:35:27,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-22 00:35:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:27,111 INFO L225 Difference]: With dead ends: 245 [2020-10-22 00:35:27,111 INFO L226 Difference]: Without dead ends: 179 [2020-10-22 00:35:27,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:35:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-22 00:35:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2020-10-22 00:35:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-22 00:35:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 351 transitions. [2020-10-22 00:35:27,117 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 351 transitions. Word has length 18 [2020-10-22 00:35:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:27,118 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 351 transitions. [2020-10-22 00:35:27,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:35:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 351 transitions. [2020-10-22 00:35:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:35:27,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:27,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:27,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 00:35:27,119 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2038631197, now seen corresponding path program 2 times [2020-10-22 00:35:27,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:27,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463104594] [2020-10-22 00:35:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:35:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:35:27,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463104594] [2020-10-22 00:35:27,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:35:27,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:35:27,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1525607199] [2020-10-22 00:35:27,321 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:35:27,324 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:35:27,331 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2020-10-22 00:35:27,331 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:35:27,878 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [21301#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0))] [2020-10-22 00:35:27,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:35:27,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:27,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:35:27,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:35:27,879 INFO L87 Difference]: Start difference. First operand 176 states and 351 transitions. Second operand 8 states. [2020-10-22 00:35:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:28,078 INFO L93 Difference]: Finished difference Result 193 states and 375 transitions. [2020-10-22 00:35:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:35:28,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-22 00:35:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:28,080 INFO L225 Difference]: With dead ends: 193 [2020-10-22 00:35:28,080 INFO L226 Difference]: Without dead ends: 135 [2020-10-22 00:35:28,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:35:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-22 00:35:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2020-10-22 00:35:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-22 00:35:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 249 transitions. [2020-10-22 00:35:28,085 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 249 transitions. Word has length 18 [2020-10-22 00:35:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:28,085 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 249 transitions. [2020-10-22 00:35:28,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:35:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions. [2020-10-22 00:35:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:35:28,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:28,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:28,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-22 00:35:28,087 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1448239176, now seen corresponding path program 1 times [2020-10-22 00:35:28,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:28,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580073521] [2020-10-22 00:35:28,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:35:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:35:28,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580073521] [2020-10-22 00:35:28,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:35:28,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:35:28,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1371195417] [2020-10-22 00:35:28,191 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:35:28,193 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:35:28,212 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 150 transitions. [2020-10-22 00:35:28,212 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:35:29,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [21755#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:35:29,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:35:29,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:35:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:35:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:35:29,107 INFO L87 Difference]: Start difference. First operand 124 states and 249 transitions. Second operand 7 states. [2020-10-22 00:35:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:35:29,170 INFO L93 Difference]: Finished difference Result 111 states and 222 transitions. [2020-10-22 00:35:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:35:29,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-22 00:35:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:35:29,171 INFO L225 Difference]: With dead ends: 111 [2020-10-22 00:35:29,172 INFO L226 Difference]: Without dead ends: 62 [2020-10-22 00:35:29,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:35:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-22 00:35:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-22 00:35:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-22 00:35:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-22 00:35:29,176 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2020-10-22 00:35:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:35:29,176 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-22 00:35:29,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:35:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-22 00:35:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:35:29,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:35:29,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:35:29,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-22 00:35:29,178 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:35:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:35:29,178 INFO L82 PathProgramCache]: Analyzing trace with hash 357676392, now seen corresponding path program 1 times [2020-10-22 00:35:29,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:35:29,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113912636] [2020-10-22 00:35:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:35:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:35:29,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:35:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:35:29,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:35:29,289 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:35:29,289 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:35:29,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-22 00:35:29,291 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:35:29,303 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L2-->L834: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In2053213957 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In2053213957 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In2053213957 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In2053213957 256) 0))) (let ((.cse3 (not .cse8)) (.cse4 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (or (and .cse0 (= ~z$w_buff1_used~0_Out2053213957 ~z$w_buff1_used~0_In2053213957)) (and .cse1 (= ~z$w_buff1_used~0_Out2053213957 0) .cse2)) (= ~z$r_buff0_thd0~0_Out2053213957 ~z$r_buff0_thd0~0_In2053213957) (= ULTIMATE.start_assume_abort_if_not_~cond_Out2053213957 |ULTIMATE.start_assume_abort_if_not_#in~cond_In2053213957|) (= ~z$r_buff1_thd0~0_Out2053213957 ~z$r_buff1_thd0~0_In2053213957) (or (and (= ~z$w_buff0_used~0_Out2053213957 0) .cse3 .cse4) (and (= ~z$w_buff0_used~0_In2053213957 ~z$w_buff0_used~0_Out2053213957) .cse5)) (or (and (= ~z~0_Out2053213957 ~z$w_buff0~0_In2053213957) .cse3 .cse4) (and .cse5 (or (and .cse1 .cse2 (= ~z$w_buff1~0_In2053213957 ~z~0_Out2053213957)) (and .cse0 (= ~z~0_In2053213957 ~z~0_Out2053213957))))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out2053213957 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2053213957|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2053213957, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2053213957, ~z$w_buff0~0=~z$w_buff0~0_In2053213957, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2053213957, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2053213957, ~z$w_buff1~0=~z$w_buff1~0_In2053213957, ~z~0=~z~0_In2053213957} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out2053213957|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out2053213957, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out2053213957|, ~z$w_buff0~0=~z$w_buff0~0_In2053213957, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out2053213957, ~z$w_buff1~0=~z$w_buff1~0_In2053213957, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2053213957|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2053213957|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out2053213957|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2053213957|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out2053213957, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out2053213957|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out2053213957, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2053213957, ~z~0=~z~0_Out2053213957} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~z~0, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2020-10-22 00:35:29,308 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,309 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [740] [2020-10-22 00:35:29,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:35:29,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:35:29,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:35:29 BasicIcfg [2020-10-22 00:35:29,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:35:29,379 INFO L168 Benchmark]: Toolchain (without parser) took 49057.53 ms. Allocated memory was 140.0 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 101.7 MB in the beginning and 329.2 MB in the end (delta: -227.5 MB). Peak memory consumption was 848.3 MB. Max. memory is 7.1 GB. [2020-10-22 00:35:29,379 INFO L168 Benchmark]: CDTParser took 2.47 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 00:35:29,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 858.33 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 155.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-10-22 00:35:29,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.35 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:35:29,381 INFO L168 Benchmark]: Boogie Preprocessor took 46.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:35:29,382 INFO L168 Benchmark]: RCFGBuilder took 2326.17 ms. Allocated memory was 202.9 MB in the beginning and 249.0 MB in the end (delta: 46.1 MB). Free memory was 149.2 MB in the beginning and 161.9 MB in the end (delta: -12.6 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2020-10-22 00:35:29,382 INFO L168 Benchmark]: TraceAbstraction took 45688.64 ms. Allocated memory was 249.0 MB in the beginning and 1.2 GB in the end (delta: 966.8 MB). Free memory was 160.0 MB in the beginning and 329.2 MB in the end (delta: -169.2 MB). Peak memory consumption was 797.5 MB. Max. memory is 7.1 GB. [2020-10-22 00:35:29,386 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.47 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 858.33 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 155.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 127.35 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2326.17 ms. Allocated memory was 202.9 MB in the beginning and 249.0 MB in the end (delta: 46.1 MB). Free memory was 149.2 MB in the beginning and 161.9 MB in the end (delta: -12.6 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45688.64 ms. Allocated memory was 249.0 MB in the beginning and 1.2 GB in the end (delta: 966.8 MB). Free memory was 160.0 MB in the beginning and 329.2 MB in the end (delta: -169.2 MB). Peak memory consumption was 797.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1029 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 82 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.3s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4956 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2037; [L819] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2038; [L821] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2039; [L823] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe011_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 45.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 352 SDtfs, 375 SDslu, 615 SDs, 0 SdLazy, 449 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 321 SyntacticMatches, 20 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 216 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 29228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...