/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 21:55:12,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 21:55:12,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 21:55:12,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 21:55:12,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 21:55:12,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 21:55:12,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 21:55:12,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 21:55:12,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 21:55:12,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 21:55:12,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 21:55:12,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 21:55:12,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 21:55:12,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 21:55:12,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 21:55:12,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 21:55:12,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 21:55:12,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 21:55:12,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 21:55:12,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 21:55:12,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 21:55:12,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 21:55:12,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 21:55:12,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 21:55:12,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 21:55:12,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 21:55:12,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 21:55:12,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 21:55:12,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 21:55:12,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 21:55:12,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 21:55:12,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 21:55:12,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 21:55:12,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 21:55:12,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 21:55:12,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 21:55:12,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 21:55:12,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 21:55:12,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 21:55:12,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 21:55:12,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 21:55:12,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 21:55:13,030 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 21:55:13,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 21:55:13,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 21:55:13,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 21:55:13,032 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 21:55:13,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 21:55:13,032 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 21:55:13,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 21:55:13,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 21:55:13,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 21:55:13,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 21:55:13,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 21:55:13,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 21:55:13,035 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 21:55:13,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 21:55:13,036 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 21:55:13,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 21:55:13,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 21:55:13,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 21:55:13,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 21:55:13,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 21:55:13,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:55:13,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 21:55:13,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 21:55:13,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 21:55:13,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 21:55:13,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 21:55:13,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 21:55:13,038 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 21:55:13,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 21:55:13,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 21:55:13,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 21:55:13,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 21:55:13,354 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 21:55:13,356 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 21:55:13,357 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.oepc.i [2020-10-21 21:55:13,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ac1d455/f218e3874ad74c04a8594bb147d60081/FLAG7bd780a31 [2020-10-21 21:55:13,897 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 21:55:13,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.oepc.i [2020-10-21 21:55:13,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ac1d455/f218e3874ad74c04a8594bb147d60081/FLAG7bd780a31 [2020-10-21 21:55:14,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ac1d455/f218e3874ad74c04a8594bb147d60081 [2020-10-21 21:55:14,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 21:55:14,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 21:55:14,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 21:55:14,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 21:55:14,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 21:55:14,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:55:14" (1/1) ... [2020-10-21 21:55:14,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6956cf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:14, skipping insertion in model container [2020-10-21 21:55:14,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:55:14" (1/1) ... [2020-10-21 21:55:14,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 21:55:14,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 21:55:14,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:55:14,856 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 21:55:14,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:55:15,033 INFO L208 MainTranslator]: Completed translation [2020-10-21 21:55:15,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15 WrapperNode [2020-10-21 21:55:15,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 21:55:15,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 21:55:15,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 21:55:15,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 21:55:15,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 21:55:15,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 21:55:15,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 21:55:15,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 21:55:15,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 21:55:15,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 21:55:15,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 21:55:15,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 21:55:15,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (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-21 21:55:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 21:55:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 21:55:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 21:55:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 21:55:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 21:55:15,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 21:55:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 21:55:15,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 21:55:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 21:55:15,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 21:55:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 21:55:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 21:55:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 21:55:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 21:55:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 21:55:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 21:55:15,279 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 21:55:17,641 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 21:55:17,642 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 21:55:17,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:55:17 BoogieIcfgContainer [2020-10-21 21:55:17,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 21:55:17,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 21:55:17,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 21:55:17,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 21:55:17,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 09:55:14" (1/3) ... [2020-10-21 21:55:17,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd6c0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:55:17, skipping insertion in model container [2020-10-21 21:55:17,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15" (2/3) ... [2020-10-21 21:55:17,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd6c0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:55:17, skipping insertion in model container [2020-10-21 21:55:17,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:55:17" (3/3) ... [2020-10-21 21:55:17,654 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_tso.oepc.i [2020-10-21 21:55:17,666 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 21:55:17,667 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 21:55:17,676 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 21:55:17,677 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 21:55:17,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,715 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,716 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,719 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,719 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,722 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,722 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,725 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,725 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,740 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,740 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,746 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,747 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,754 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,754 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,754 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,754 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,761 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,763 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,764 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:17,765 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 21:55:17,780 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 21:55:17,802 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 21:55:17,802 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 21:55:17,803 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 21:55:17,803 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 21:55:17,803 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 21:55:17,803 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 21:55:17,803 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 21:55:17,803 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 21:55:17,818 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 21:55:17,821 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 123 transitions, 266 flow [2020-10-21 21:55:17,824 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 123 transitions, 266 flow [2020-10-21 21:55:17,826 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 123 transitions, 266 flow [2020-10-21 21:55:17,885 INFO L129 PetriNetUnfolder]: 3/119 cut-off events. [2020-10-21 21:55:17,886 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 21:55:17,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 99 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-10-21 21:55:17,902 INFO L116 LiptonReduction]: Number of co-enabled transitions 3124 [2020-10-21 21:55:18,284 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-21 21:55:18,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:18,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:18,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:18,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:18,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:18,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:18,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:18,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:18,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:18,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:18,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:18,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:18,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:18,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:55:18,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:18,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:18,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:18,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:55:18,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:18,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:55:18,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:18,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:18,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:18,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:18,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:18,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:18,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:55:18,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:55:18,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:18,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:18,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:18,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:18,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:18,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:18,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:18,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:18,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:18,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:18,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:18,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:18,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:55:19,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:19,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:55:19,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:55:19,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:19,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:55:19,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:19,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:19,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:19,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:55:19,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:19,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:55:19,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:19,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:19,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:19,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:19,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:20,459 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 21:55:20,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:20,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:20,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:20,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:20,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:20,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:20,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:20,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:20,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:20,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:20,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:20,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:20,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:20,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:20,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:20,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:20,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:20,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:20,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:20,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:20,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:20,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:20,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:55:21,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:55:21,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:21,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:21,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:21,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:55:21,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:21,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:21,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:55:21,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:55:21,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:55:21,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:55:21,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:55:21,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:21,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:21,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:21,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:21,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:22,134 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-21 21:55:23,092 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-21 21:55:23,300 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-21 21:55:23,407 INFO L131 LiptonReduction]: Checked pairs total: 8235 [2020-10-21 21:55:23,408 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-21 21:55:23,417 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-21 21:55:23,810 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4874 states. [2020-10-21 21:55:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states. [2020-10-21 21:55:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-21 21:55:23,822 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:23,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-21 21:55:23,823 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1248956, now seen corresponding path program 1 times [2020-10-21 21:55:23,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:23,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430992208] [2020-10-21 21:55:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:24,088 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-21 21:55:24,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430992208] [2020-10-21 21:55:24,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:24,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:55:24,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870411683] [2020-10-21 21:55:24,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:55:24,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:24,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:55:24,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:55:24,113 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3 states. [2020-10-21 21:55:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:24,273 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-21 21:55:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:55:24,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-21 21:55:24,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:24,330 INFO L225 Difference]: With dead ends: 4062 [2020-10-21 21:55:24,331 INFO L226 Difference]: Without dead ends: 3312 [2020-10-21 21:55:24,332 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-21 21:55:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-21 21:55:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-21 21:55:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-21 21:55:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-21 21:55:24,563 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2020-10-21 21:55:24,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:24,563 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-21 21:55:24,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:55:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-21 21:55:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 21:55:24,569 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:24,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:24,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 21:55:24,570 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2053809436, now seen corresponding path program 1 times [2020-10-21 21:55:24,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:24,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794476168] [2020-10-21 21:55:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:24,701 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-21 21:55:24,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794476168] [2020-10-21 21:55:24,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:24,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:55:24,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281105859] [2020-10-21 21:55:24,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:55:24,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:24,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:55:24,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:55:24,704 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-21 21:55:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:24,746 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2020-10-21 21:55:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:55:24,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 21:55:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:24,774 INFO L225 Difference]: With dead ends: 3062 [2020-10-21 21:55:24,774 INFO L226 Difference]: Without dead ends: 3062 [2020-10-21 21:55:24,775 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-21 21:55:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2020-10-21 21:55:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2020-10-21 21:55:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2020-10-21 21:55:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2020-10-21 21:55:24,899 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 11 [2020-10-21 21:55:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:24,901 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2020-10-21 21:55:24,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:55:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2020-10-21 21:55:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 21:55:24,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:24,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:24,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 21:55:24,906 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1927309425, now seen corresponding path program 1 times [2020-10-21 21:55:24,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:24,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789185208] [2020-10-21 21:55:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:24,977 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-21 21:55:24,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789185208] [2020-10-21 21:55:24,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:24,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:55:24,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388030574] [2020-10-21 21:55:24,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:55:24,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:24,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:55:24,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:55:24,981 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 3 states. [2020-10-21 21:55:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:25,028 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions. [2020-10-21 21:55:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:55:25,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-21 21:55:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:25,057 INFO L225 Difference]: With dead ends: 3022 [2020-10-21 21:55:25,058 INFO L226 Difference]: Without dead ends: 3022 [2020-10-21 21:55:25,059 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-21 21:55:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-10-21 21:55:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2020-10-21 21:55:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-10-21 21:55:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-10-21 21:55:25,282 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13 [2020-10-21 21:55:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:25,282 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-10-21 21:55:25,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:55:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-10-21 21:55:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 21:55:25,286 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:25,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:25,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 21:55:25,286 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -382982227, now seen corresponding path program 1 times [2020-10-21 21:55:25,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:25,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565201116] [2020-10-21 21:55:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:25,399 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-21 21:55:25,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565201116] [2020-10-21 21:55:25,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:25,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:55:25,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541290182] [2020-10-21 21:55:25,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:55:25,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:55:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:55:25,403 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 4 states. [2020-10-21 21:55:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:25,472 INFO L93 Difference]: Finished difference Result 2964 states and 10373 transitions. [2020-10-21 21:55:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:55:25,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 21:55:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:25,490 INFO L225 Difference]: With dead ends: 2964 [2020-10-21 21:55:25,490 INFO L226 Difference]: Without dead ends: 2214 [2020-10-21 21:55:25,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-21 21:55:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2020-10-21 21:55:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2214. [2020-10-21 21:55:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2020-10-21 21:55:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 7628 transitions. [2020-10-21 21:55:25,569 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 7628 transitions. Word has length 14 [2020-10-21 21:55:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:25,569 INFO L481 AbstractCegarLoop]: Abstraction has 2214 states and 7628 transitions. [2020-10-21 21:55:25,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:55:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 7628 transitions. [2020-10-21 21:55:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 21:55:25,574 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:25,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:25,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 21:55:25,574 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:25,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1079458941, now seen corresponding path program 1 times [2020-10-21 21:55:25,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:25,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050611538] [2020-10-21 21:55:25,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:25,624 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-21 21:55:25,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050611538] [2020-10-21 21:55:25,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:25,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 21:55:25,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260262212] [2020-10-21 21:55:25,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:55:25,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:25,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:55:25,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:55:25,626 INFO L87 Difference]: Start difference. First operand 2214 states and 7628 transitions. Second operand 3 states. [2020-10-21 21:55:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:25,659 INFO L93 Difference]: Finished difference Result 3270 states and 11011 transitions. [2020-10-21 21:55:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:55:25,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-21 21:55:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:25,678 INFO L225 Difference]: With dead ends: 3270 [2020-10-21 21:55:25,679 INFO L226 Difference]: Without dead ends: 2310 [2020-10-21 21:55:25,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 21:55:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2020-10-21 21:55:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2178. [2020-10-21 21:55:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2020-10-21 21:55:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 7215 transitions. [2020-10-21 21:55:25,773 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 7215 transitions. Word has length 17 [2020-10-21 21:55:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:25,773 INFO L481 AbstractCegarLoop]: Abstraction has 2178 states and 7215 transitions. [2020-10-21 21:55:25,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:55:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 7215 transitions. [2020-10-21 21:55:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 21:55:25,778 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:25,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:25,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 21:55:25,778 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1005001136, now seen corresponding path program 1 times [2020-10-21 21:55:25,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:25,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149646133] [2020-10-21 21:55:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:25,822 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-21 21:55:25,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149646133] [2020-10-21 21:55:25,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:25,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 21:55:25,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807567737] [2020-10-21 21:55:25,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:55:25,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:25,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:55:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:55:25,824 INFO L87 Difference]: Start difference. First operand 2178 states and 7215 transitions. Second operand 3 states. [2020-10-21 21:55:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:25,858 INFO L93 Difference]: Finished difference Result 3203 states and 10351 transitions. [2020-10-21 21:55:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:55:25,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-21 21:55:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:25,871 INFO L225 Difference]: With dead ends: 3203 [2020-10-21 21:55:25,872 INFO L226 Difference]: Without dead ends: 2334 [2020-10-21 21:55:25,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 21:55:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2020-10-21 21:55:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2178. [2020-10-21 21:55:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2020-10-21 21:55:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 6968 transitions. [2020-10-21 21:55:25,953 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 6968 transitions. Word has length 17 [2020-10-21 21:55:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:25,954 INFO L481 AbstractCegarLoop]: Abstraction has 2178 states and 6968 transitions. [2020-10-21 21:55:25,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:55:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 6968 transitions. [2020-10-21 21:55:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 21:55:25,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:25,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:25,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 21:55:25,958 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash -676228949, now seen corresponding path program 1 times [2020-10-21 21:55:25,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:25,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042382] [2020-10-21 21:55:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:26,085 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-21 21:55:26,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042382] [2020-10-21 21:55:26,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:26,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:55:26,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168180597] [2020-10-21 21:55:26,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:55:26,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:26,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:55:26,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:55:26,089 INFO L87 Difference]: Start difference. First operand 2178 states and 6968 transitions. Second operand 5 states. [2020-10-21 21:55:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:26,169 INFO L93 Difference]: Finished difference Result 1832 states and 5382 transitions. [2020-10-21 21:55:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:55:26,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-21 21:55:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:26,182 INFO L225 Difference]: With dead ends: 1832 [2020-10-21 21:55:26,182 INFO L226 Difference]: Without dead ends: 1402 [2020-10-21 21:55:26,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:55:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-10-21 21:55:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2020-10-21 21:55:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2020-10-21 21:55:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 4054 transitions. [2020-10-21 21:55:26,236 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 4054 transitions. Word has length 17 [2020-10-21 21:55:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:26,236 INFO L481 AbstractCegarLoop]: Abstraction has 1402 states and 4054 transitions. [2020-10-21 21:55:26,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:55:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 4054 transitions. [2020-10-21 21:55:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 21:55:26,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:26,242 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] [2020-10-21 21:55:26,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 21:55:26,242 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:26,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1166926340, now seen corresponding path program 1 times [2020-10-21 21:55:26,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:26,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622755410] [2020-10-21 21:55:26,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:26,388 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-21 21:55:26,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622755410] [2020-10-21 21:55:26,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:26,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:55:26,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105987829] [2020-10-21 21:55:26,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:55:26,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:26,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:55:26,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:55:26,391 INFO L87 Difference]: Start difference. First operand 1402 states and 4054 transitions. Second operand 6 states. [2020-10-21 21:55:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:26,538 INFO L93 Difference]: Finished difference Result 1239 states and 3550 transitions. [2020-10-21 21:55:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:55:26,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-21 21:55:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:26,543 INFO L225 Difference]: With dead ends: 1239 [2020-10-21 21:55:26,543 INFO L226 Difference]: Without dead ends: 1063 [2020-10-21 21:55:26,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2020-10-21 21:55:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1063. [2020-10-21 21:55:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2020-10-21 21:55:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 3070 transitions. [2020-10-21 21:55:26,580 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 3070 transitions. Word has length 20 [2020-10-21 21:55:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:26,581 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 3070 transitions. [2020-10-21 21:55:26,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:55:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 3070 transitions. [2020-10-21 21:55:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 21:55:26,584 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:26,584 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, 1, 1, 1] [2020-10-21 21:55:26,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 21:55:26,584 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:26,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:26,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1772040044, now seen corresponding path program 1 times [2020-10-21 21:55:26,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:26,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500768780] [2020-10-21 21:55:26,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:26,799 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-21 21:55:26,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500768780] [2020-10-21 21:55:26,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:26,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:55:26,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96233913] [2020-10-21 21:55:26,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:55:26,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:26,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:55:26,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:26,802 INFO L87 Difference]: Start difference. First operand 1063 states and 3070 transitions. Second operand 7 states. [2020-10-21 21:55:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:26,875 INFO L93 Difference]: Finished difference Result 1033 states and 3010 transitions. [2020-10-21 21:55:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 21:55:26,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-21 21:55:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:26,878 INFO L225 Difference]: With dead ends: 1033 [2020-10-21 21:55:26,879 INFO L226 Difference]: Without dead ends: 545 [2020-10-21 21:55:26,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:55:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-10-21 21:55:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2020-10-21 21:55:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2020-10-21 21:55:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1592 transitions. [2020-10-21 21:55:26,893 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1592 transitions. Word has length 24 [2020-10-21 21:55:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:26,893 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 1592 transitions. [2020-10-21 21:55:26,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:55:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1592 transitions. [2020-10-21 21:55:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-21 21:55:26,895 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:26,895 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:26,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 21:55:26,896 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash -457680553, now seen corresponding path program 1 times [2020-10-21 21:55:26,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:26,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761428170] [2020-10-21 21:55:26,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:26,965 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-21 21:55:26,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761428170] [2020-10-21 21:55:26,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:26,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:55:26,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43260893] [2020-10-21 21:55:26,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:55:26,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:26,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:55:26,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:55:26,967 INFO L87 Difference]: Start difference. First operand 545 states and 1592 transitions. Second operand 4 states. [2020-10-21 21:55:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:26,988 INFO L93 Difference]: Finished difference Result 850 states and 2456 transitions. [2020-10-21 21:55:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 21:55:26,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-21 21:55:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:26,990 INFO L225 Difference]: With dead ends: 850 [2020-10-21 21:55:26,990 INFO L226 Difference]: Without dead ends: 343 [2020-10-21 21:55:26,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-21 21:55:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-10-21 21:55:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2020-10-21 21:55:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-10-21 21:55:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 940 transitions. [2020-10-21 21:55:27,002 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 940 transitions. Word has length 28 [2020-10-21 21:55:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:27,003 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 940 transitions. [2020-10-21 21:55:27,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:55:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 940 transitions. [2020-10-21 21:55:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-21 21:55:27,006 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:27,006 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:27,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 21:55:27,007 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:27,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1525900279, now seen corresponding path program 2 times [2020-10-21 21:55:27,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:27,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861833060] [2020-10-21 21:55:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:27,275 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-21 21:55:27,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861833060] [2020-10-21 21:55:27,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:27,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:55:27,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846830640] [2020-10-21 21:55:27,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:55:27,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:27,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:55:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:27,278 INFO L87 Difference]: Start difference. First operand 343 states and 940 transitions. Second operand 7 states. [2020-10-21 21:55:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:27,455 INFO L93 Difference]: Finished difference Result 511 states and 1377 transitions. [2020-10-21 21:55:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:55:27,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-21 21:55:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:27,456 INFO L225 Difference]: With dead ends: 511 [2020-10-21 21:55:27,457 INFO L226 Difference]: Without dead ends: 293 [2020-10-21 21:55:27,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:55:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-10-21 21:55:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2020-10-21 21:55:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-10-21 21:55:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 780 transitions. [2020-10-21 21:55:27,465 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 780 transitions. Word has length 28 [2020-10-21 21:55:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:27,465 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 780 transitions. [2020-10-21 21:55:27,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:55:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 780 transitions. [2020-10-21 21:55:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-21 21:55:27,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:27,468 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:27,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 21:55:27,468 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1526047503, now seen corresponding path program 3 times [2020-10-21 21:55:27,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:27,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123406005] [2020-10-21 21:55:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:27,673 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-21 21:55:27,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123406005] [2020-10-21 21:55:27,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:27,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:55:27,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896328252] [2020-10-21 21:55:27,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:55:27,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:55:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:27,675 INFO L87 Difference]: Start difference. First operand 293 states and 780 transitions. Second operand 7 states. [2020-10-21 21:55:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:27,859 INFO L93 Difference]: Finished difference Result 331 states and 866 transitions. [2020-10-21 21:55:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:55:27,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-21 21:55:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:27,861 INFO L225 Difference]: With dead ends: 331 [2020-10-21 21:55:27,861 INFO L226 Difference]: Without dead ends: 293 [2020-10-21 21:55:27,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:55:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-10-21 21:55:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2020-10-21 21:55:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-10-21 21:55:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 776 transitions. [2020-10-21 21:55:27,869 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 776 transitions. Word has length 28 [2020-10-21 21:55:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:27,869 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 776 transitions. [2020-10-21 21:55:27,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:55:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 776 transitions. [2020-10-21 21:55:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-21 21:55:27,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:27,871 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:27,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 21:55:27,871 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash 109981471, now seen corresponding path program 4 times [2020-10-21 21:55:27,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:27,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982771111] [2020-10-21 21:55:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:28,099 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-21 21:55:28,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982771111] [2020-10-21 21:55:28,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:28,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:55:28,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396703057] [2020-10-21 21:55:28,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 21:55:28,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:28,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 21:55:28,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:55:28,101 INFO L87 Difference]: Start difference. First operand 293 states and 776 transitions. Second operand 8 states. [2020-10-21 21:55:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:28,327 INFO L93 Difference]: Finished difference Result 433 states and 1102 transitions. [2020-10-21 21:55:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:55:28,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-21 21:55:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:28,328 INFO L225 Difference]: With dead ends: 433 [2020-10-21 21:55:28,329 INFO L226 Difference]: Without dead ends: 310 [2020-10-21 21:55:28,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-21 21:55:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-10-21 21:55:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 273. [2020-10-21 21:55:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-10-21 21:55:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 686 transitions. [2020-10-21 21:55:28,337 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 686 transitions. Word has length 28 [2020-10-21 21:55:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:28,337 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 686 transitions. [2020-10-21 21:55:28,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 21:55:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 686 transitions. [2020-10-21 21:55:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-21 21:55:28,338 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:28,338 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:28,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 21:55:28,339 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1265034487, now seen corresponding path program 5 times [2020-10-21 21:55:28,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:28,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030193734] [2020-10-21 21:55:28,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:55:28,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:55:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:55:28,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:55:28,514 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 21:55:28,514 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 21:55:28,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 21:55:28,516 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 21:55:28,546 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1207] [1207] L2-->L887: Formula: (let ((.cse7 (= (mod ~b$w_buff0_used~0_In-448965379 256) 0)) (.cse6 (= (mod ~b$r_buff0_thd0~0_In-448965379 256) 0)) (.cse8 (= (mod ~b$r_buff1_thd0~0_In-448965379 256) 0)) (.cse9 (= (mod ~b$w_buff1_used~0_In-448965379 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (or (and (= ~b$w_buff1_used~0_Out-448965379 0) .cse0 .cse1) (and (= ~b$w_buff1_used~0_Out-448965379 ~b$w_buff1_used~0_In-448965379) .cse2)) (= ~b$r_buff1_thd0~0_In-448965379 ~b$r_buff1_thd0~0_Out-448965379) (= ~b$r_buff0_thd0~0_Out-448965379 ~b$r_buff0_thd0~0_In-448965379) (or (and .cse3 (= ~b$w_buff0~0_In-448965379 ~b~0_Out-448965379) .cse4) (and (or (and .cse0 .cse1 (= ~b$w_buff1~0_In-448965379 ~b~0_Out-448965379)) (and (= ~b~0_Out-448965379 ~b~0_In-448965379) .cse2)) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-448965379 0)) (or (and .cse3 .cse4 (= ~b$w_buff0_used~0_Out-448965379 0)) (and (= ~b$w_buff0_used~0_In-448965379 ~b$w_buff0_used~0_Out-448965379) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-448965379 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-448965379|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-448965379, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-448965379|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-448965379, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-448965379, ~b~0=~b~0_In-448965379, ~b$w_buff1~0=~b$w_buff1~0_In-448965379, ~b$w_buff0~0=~b$w_buff0~0_In-448965379, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-448965379} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-448965379, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-448965379|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-448965379|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-448965379|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out-448965379|, ~b$w_buff0_used~0=~b$w_buff0_used~0_Out-448965379, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-448965379|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-448965379|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-448965379|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-448965379, ~b$w_buff1_used~0=~b$w_buff1_used~0_Out-448965379, ~b~0=~b~0_Out-448965379, ~b$w_buff1~0=~b$w_buff1~0_In-448965379, ~b$w_buff0~0=~b$w_buff0~0_In-448965379, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_Out-448965379} AuxVars[] AssignedVars[~b$w_buff0_used~0, ULTIMATE.start_main_#t~ite60, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_#t~ite56, ~b$r_buff0_thd0~0] because there is no mapped edge [2020-10-21 21:55:28,553 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-21 21:55:28,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,553 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-21 21:55:28,554 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [751] [2020-10-21 21:55:28,557 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-21 21:55:28,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,557 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-21 21:55:28,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,558 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-21 21:55:28,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,558 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-21 21:55:28,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,559 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-21 21:55:28,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,560 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-21 21:55:28,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,560 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-21 21:55:28,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,560 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-21 21:55:28,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,561 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-21 21:55:28,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,561 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-21 21:55:28,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,562 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-21 21:55:28,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,562 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-21 21:55:28,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,562 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-21 21:55:28,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,563 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-21 21:55:28,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,563 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-21 21:55:28,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,564 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-21 21:55:28,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,564 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-21 21:55:28,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,565 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-21 21:55:28,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,565 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-21 21:55:28,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,565 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-21 21:55:28,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,566 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-21 21:55:28,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,567 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-21 21:55:28,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,567 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-21 21:55:28,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,567 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-21 21:55:28,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,568 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-21 21:55:28,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,568 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-21 21:55:28,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,569 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-21 21:55:28,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,570 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-21 21:55:28,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,570 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-21 21:55:28,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,570 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-21 21:55:28,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,571 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-21 21:55:28,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,571 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-21 21:55:28,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:28,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 09:55:28 BasicIcfg [2020-10-21 21:55:28,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 21:55:28,694 INFO L168 Benchmark]: Toolchain (without parser) took 14426.62 ms. Allocated memory was 141.0 MB in the beginning and 461.9 MB in the end (delta: 320.9 MB). Free memory was 102.4 MB in the beginning and 56.2 MB in the end (delta: 46.3 MB). Peak memory consumption was 367.1 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:28,695 INFO L168 Benchmark]: CDTParser took 3.47 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 21:55:28,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.08 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 153.9 MB in the end (delta: -52.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:28,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.88 ms. Allocated memory is still 204.5 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:28,697 INFO L168 Benchmark]: Boogie Preprocessor took 81.10 ms. Allocated memory is still 204.5 MB. Free memory was 151.2 MB in the beginning and 148.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:28,697 INFO L168 Benchmark]: RCFGBuilder took 2461.54 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 147.9 MB in the beginning and 126.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 94.5 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:28,698 INFO L168 Benchmark]: TraceAbstraction took 11045.77 ms. Allocated memory was 246.4 MB in the beginning and 461.9 MB in the end (delta: 215.5 MB). Free memory was 126.9 MB in the beginning and 56.2 MB in the end (delta: 70.8 MB). Peak memory consumption was 286.2 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:28,702 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.47 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.08 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 153.9 MB in the end (delta: -52.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.88 ms. Allocated memory is still 204.5 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.10 ms. Allocated memory is still 204.5 MB. Free memory was 151.2 MB in the beginning and 148.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2461.54 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 147.9 MB in the beginning and 126.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 94.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11045.77 ms. Allocated memory was 246.4 MB in the beginning and 461.9 MB in the end (delta: 215.5 MB). Free memory was 126.9 MB in the beginning and 56.2 MB in the end (delta: 70.8 MB). Peak memory consumption was 286.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2176 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 76 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 256 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.5s, 133 PlacesBefore, 47 PlacesAfterwards, 123 TransitionsBefore, 34 TransitionsAfterwards, 3124 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 8235 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1241; [L870] FCALL, FORK 0 pthread_create(&t1241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1242; [L872] FCALL, FORK 0 pthread_create(&t1242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix046_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t1243; [L874] FCALL, FORK 0 pthread_create(&t1243, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t1244; [L876] FCALL, FORK 0 pthread_create(&t1244, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L808] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L837] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] EXPR 1 b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L847] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L788] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix046_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 121 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 490 SDtfs, 674 SDslu, 840 SDs, 0 SdLazy, 318 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred 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.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 325 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 33804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...