/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-14 00:11:38,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-14 00:11:38,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-14 00:11:38,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-14 00:11:38,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-14 00:11:38,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-14 00:11:38,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-14 00:11:38,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-14 00:11:38,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-14 00:11:38,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-14 00:11:38,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-14 00:11:38,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-14 00:11:38,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-14 00:11:38,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-14 00:11:38,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-14 00:11:38,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-14 00:11:38,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-14 00:11:38,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-14 00:11:38,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-14 00:11:38,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-14 00:11:38,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-14 00:11:38,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-14 00:11:38,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-14 00:11:38,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-14 00:11:38,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-14 00:11:38,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-14 00:11:38,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-14 00:11:38,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-14 00:11:38,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-14 00:11:38,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-14 00:11:38,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-14 00:11:38,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-14 00:11:38,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-14 00:11:38,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-14 00:11:38,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-14 00:11:38,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-14 00:11:38,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-14 00:11:38,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-14 00:11:38,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-14 00:11:38,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-14 00:11:38,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-14 00:11:38,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2021-07-14 00:11:38,219 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-14 00:11:38,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-14 00:11:38,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-14 00:11:38,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-14 00:11:38,221 INFO L138 SettingsManager]: * Use SBE=true [2021-07-14 00:11:38,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-14 00:11:38,221 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-14 00:11:38,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-14 00:11:38,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-14 00:11:38,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-14 00:11:38,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-14 00:11:38,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-14 00:11:38,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-14 00:11:38,222 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-14 00:11:38,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-14 00:11:38,222 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-14 00:11:38,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-14 00:11:38,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-14 00:11:38,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-14 00:11:38,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-14 00:11:38,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-14 00:11:38,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-14 00:11:38,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-14 00:11:38,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-14 00:11:38,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-14 00:11:38,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-14 00:11:38,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-14 00:11:38,223 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-14 00:11:38,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-14 00:11:38,224 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-07-14 00:11:38,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-14 00:11:38,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-14 00:11:38,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-14 00:11:38,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-14 00:11:38,474 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-14 00:11:38,476 INFO L275 PluginConnector]: CDTParser initialized [2021-07-14 00:11:38,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2021-07-14 00:11:38,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0506a0539/15ea2846b8a040afa8f61f1a36bad94a/FLAG2928b7532 [2021-07-14 00:11:38,967 INFO L306 CDTParser]: Found 1 translation units. [2021-07-14 00:11:38,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2021-07-14 00:11:38,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0506a0539/15ea2846b8a040afa8f61f1a36bad94a/FLAG2928b7532 [2021-07-14 00:11:38,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0506a0539/15ea2846b8a040afa8f61f1a36bad94a [2021-07-14 00:11:38,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-14 00:11:38,995 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-14 00:11:38,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-14 00:11:38,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-14 00:11:38,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-14 00:11:38,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:11:38" (1/1) ... [2021-07-14 00:11:39,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6471a3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39, skipping insertion in model container [2021-07-14 00:11:39,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:11:38" (1/1) ... [2021-07-14 00:11:39,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-14 00:11:39,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-14 00:11:39,181 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i[948,961] [2021-07-14 00:11:39,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:11:39,373 INFO L203 MainTranslator]: Completed pre-run [2021-07-14 00:11:39,383 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i[948,961] [2021-07-14 00:11:39,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:11:39,446 INFO L208 MainTranslator]: Completed translation [2021-07-14 00:11:39,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39 WrapperNode [2021-07-14 00:11:39,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-14 00:11:39,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-14 00:11:39,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-14 00:11:39,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-14 00:11:39,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2021-07-14 00:11:39,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2021-07-14 00:11:39,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-14 00:11:39,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-14 00:11:39,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-14 00:11:39,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-14 00:11:39,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2021-07-14 00:11:39,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2021-07-14 00:11:39,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2021-07-14 00:11:39,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2021-07-14 00:11:39,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2021-07-14 00:11:39,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2021-07-14 00:11:39,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2021-07-14 00:11:39,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-14 00:11:39,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-14 00:11:39,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-14 00:11:39,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-14 00:11:39,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (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 [2021-07-14 00:11:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-14 00:11:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-14 00:11:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-14 00:11:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-14 00:11:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-14 00:11:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-14 00:11:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-14 00:11:39,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-14 00:11:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-14 00:11:39,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-14 00:11:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-14 00:11:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-14 00:11:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-14 00:11:39,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-14 00:11:39,623 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-14 00:11:40,757 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-14 00:11:40,757 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-14 00:11:40,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:11:40 BoogieIcfgContainer [2021-07-14 00:11:40,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-14 00:11:40,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-14 00:11:40,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-14 00:11:40,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-14 00:11:40,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:11:38" (1/3) ... [2021-07-14 00:11:40,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b13864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:11:40, skipping insertion in model container [2021-07-14 00:11:40,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (2/3) ... [2021-07-14 00:11:40,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b13864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:11:40, skipping insertion in model container [2021-07-14 00:11:40,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:11:40" (3/3) ... [2021-07-14 00:11:40,765 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt.i [2021-07-14 00:11:40,770 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-14 00:11:40,770 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-14 00:11:40,770 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-14 00:11:40,771 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-14 00:11:40,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,795 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,795 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,795 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,795 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,796 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,796 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,823 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,823 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,823 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,829 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,829 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,836 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,836 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,837 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,839 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:11:40,842 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-14 00:11:40,859 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-14 00:11:40,876 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-14 00:11:40,876 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-14 00:11:40,880 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-14 00:11:40,880 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-14 00:11:40,880 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-14 00:11:40,880 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-14 00:11:40,881 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-14 00:11:40,881 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork1======== [2021-07-14 00:11:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 5019 states, 4917 states have (on average 2.0717917429326826) internal successors, (10187), 5018 states have internal predecessors, (10187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-14 00:11:41,379 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:41,380 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:41,380 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash -978306701, now seen corresponding path program 1 times [2021-07-14 00:11:41,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:41,390 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705715597] [2021-07-14 00:11:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:11:41,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:41,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:41,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:41,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:11:41,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:11:41,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705715597] [2021-07-14 00:11:41,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705715597] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:11:41,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:11:41,579 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-14 00:11:41,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530345162] [2021-07-14 00:11:41,580 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-14 00:11:41,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:11:41,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-14 00:11:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 00:11:41,596 INFO L87 Difference]: Start difference. First operand has 5019 states, 4917 states have (on average 2.0717917429326826) internal successors, (10187), 5018 states have internal predecessors, (10187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:11:41,661 INFO L93 Difference]: Finished difference Result 3395 states and 6256 transitions. [2021-07-14 00:11:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 00:11:41,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-14 00:11:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:11:41,666 INFO L225 Difference]: With dead ends: 3395 [2021-07-14 00:11:41,666 INFO L226 Difference]: Without dead ends: 0 [2021-07-14 00:11:41,667 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 00:11:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-14 00:11:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-14 00:11:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-14 00:11:41,682 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2021-07-14 00:11:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:11:41,682 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-14 00:11:41,682 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-14 00:11:41,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-14 00:11:41,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-14 00:11:41,685 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork1 was SAFE (1/2) [2021-07-14 00:11:41,686 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-14 00:11:41,686 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-14 00:11:41,686 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-14 00:11:41,687 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-14 00:11:41,687 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-14 00:11:41,687 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-14 00:11:41,687 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-14 00:11:41,687 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-14 00:11:41,687 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-14 00:11:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 10339 states, 9155 states have (on average 1.9842708902239214) internal successors, (18166), 10338 states have internal predecessors, (18166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-14 00:11:42,293 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:42,293 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:42,293 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:42,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:42,294 INFO L82 PathProgramCache]: Analyzing trace with hash -779061261, now seen corresponding path program 1 times [2021-07-14 00:11:42,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:42,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904611940] [2021-07-14 00:11:42,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:11:42,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:42,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:42,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:42,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:42,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:42,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:11:42,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:42,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:11:42,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:42,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:11:42,476 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-07-14 00:11:42,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-14 00:11:42,483 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:11:42,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:11:42,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:42,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:42,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:42,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:42,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:42,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:11:42,512 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:11:42,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904611940] [2021-07-14 00:11:42,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904611940] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:11:42,512 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:11:42,512 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-14 00:11:42,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707250206] [2021-07-14 00:11:42,513 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-14 00:11:42,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:11:42,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-14 00:11:42,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-14 00:11:42,528 INFO L87 Difference]: Start difference. First operand has 10339 states, 9155 states have (on average 1.9842708902239214) internal successors, (18166), 10338 states have internal predecessors, (18166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:11:42,855 INFO L93 Difference]: Finished difference Result 11921 states and 21319 transitions. [2021-07-14 00:11:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-14 00:11:42,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-14 00:11:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:11:42,886 INFO L225 Difference]: With dead ends: 11921 [2021-07-14 00:11:42,886 INFO L226 Difference]: Without dead ends: 5637 [2021-07-14 00:11:42,887 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 188.9ms TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2021-07-14 00:11:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5637 states. [2021-07-14 00:11:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 5637. [2021-07-14 00:11:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5578 states have (on average 2.031731803513804) internal successors, (11333), 5636 states have internal predecessors, (11333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 11333 transitions. [2021-07-14 00:11:43,038 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 11333 transitions. Word has length 70 [2021-07-14 00:11:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:11:43,039 INFO L482 AbstractCegarLoop]: Abstraction has 5637 states and 11333 transitions. [2021-07-14 00:11:43,039 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 11333 transitions. [2021-07-14 00:11:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-14 00:11:43,045 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:43,045 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:43,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-14 00:11:43,045 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash 317299900, now seen corresponding path program 1 times [2021-07-14 00:11:43,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:43,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686455627] [2021-07-14 00:11:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:11:43,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:43,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:43,127 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:11:43,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:11:43,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:43,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:43,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:11:43,152 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:11:43,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686455627] [2021-07-14 00:11:43,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686455627] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:11:43,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:11:43,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:11:43,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565042156] [2021-07-14 00:11:43,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:11:43,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:11:43,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:11:43,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:11:43,154 INFO L87 Difference]: Start difference. First operand 5637 states and 11333 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:11:43,253 INFO L93 Difference]: Finished difference Result 5847 states and 12157 transitions. [2021-07-14 00:11:43,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:11:43,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-07-14 00:11:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:11:43,310 INFO L225 Difference]: With dead ends: 5847 [2021-07-14 00:11:43,310 INFO L226 Difference]: Without dead ends: 4398 [2021-07-14 00:11:43,310 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 68.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:11:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4398 states. [2021-07-14 00:11:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4398 to 4398. [2021-07-14 00:11:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4398 states, 4342 states have (on average 1.95923537540304) internal successors, (8507), 4397 states have internal predecessors, (8507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 8507 transitions. [2021-07-14 00:11:43,396 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 8507 transitions. Word has length 73 [2021-07-14 00:11:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:11:43,397 INFO L482 AbstractCegarLoop]: Abstraction has 4398 states and 8507 transitions. [2021-07-14 00:11:43,397 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 8507 transitions. [2021-07-14 00:11:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-14 00:11:43,403 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:43,403 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:43,404 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-14 00:11:43,404 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash -872698217, now seen corresponding path program 1 times [2021-07-14 00:11:43,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:43,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733921639] [2021-07-14 00:11:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:11:43,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:43,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:43,542 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:11:43,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:11:43,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:11:43,560 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:11:43,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:43,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:11:43,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:11:43,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733921639] [2021-07-14 00:11:43,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733921639] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:11:43,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:11:43,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:11:43,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555488638] [2021-07-14 00:11:43,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:11:43,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:11:43,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:11:43,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:11:43,572 INFO L87 Difference]: Start difference. First operand 4398 states and 8507 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:11:43,653 INFO L93 Difference]: Finished difference Result 5134 states and 9293 transitions. [2021-07-14 00:11:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:11:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-14 00:11:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:11:43,665 INFO L225 Difference]: With dead ends: 5134 [2021-07-14 00:11:43,666 INFO L226 Difference]: Without dead ends: 3342 [2021-07-14 00:11:43,666 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 57.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:11:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2021-07-14 00:11:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 3342. [2021-07-14 00:11:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 3286 states have (on average 1.9753499695678636) internal successors, (6491), 3341 states have internal predecessors, (6491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 6491 transitions. [2021-07-14 00:11:43,760 INFO L78 Accepts]: Start accepts. Automaton has 3342 states and 6491 transitions. Word has length 76 [2021-07-14 00:11:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:11:43,760 INFO L482 AbstractCegarLoop]: Abstraction has 3342 states and 6491 transitions. [2021-07-14 00:11:43,760 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3342 states and 6491 transitions. [2021-07-14 00:11:43,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-14 00:11:43,766 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:43,766 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:43,766 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-14 00:11:43,766 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:43,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:43,767 INFO L82 PathProgramCache]: Analyzing trace with hash -320092133, now seen corresponding path program 1 times [2021-07-14 00:11:43,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:43,767 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529310762] [2021-07-14 00:11:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:11:43,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:43,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:43,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:43,857 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:11:43,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:11:43,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:11:43,879 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:11:43,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:43,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:43,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:11:43,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:11:43,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529310762] [2021-07-14 00:11:43,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529310762] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:11:43,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:11:43,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-14 00:11:43,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647698070] [2021-07-14 00:11:43,889 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-14 00:11:43,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:11:43,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-14 00:11:43,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-14 00:11:43,892 INFO L87 Difference]: Start difference. First operand 3342 states and 6491 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:11:43,989 INFO L93 Difference]: Finished difference Result 2782 states and 4876 transitions. [2021-07-14 00:11:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-14 00:11:43,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-07-14 00:11:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:11:43,994 INFO L225 Difference]: With dead ends: 2782 [2021-07-14 00:11:43,994 INFO L226 Difference]: Without dead ends: 1512 [2021-07-14 00:11:43,994 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 73.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-14 00:11:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2021-07-14 00:11:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2021-07-14 00:11:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1476 states have (on average 1.910569105691057) internal successors, (2820), 1511 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2820 transitions. [2021-07-14 00:11:44,015 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2820 transitions. Word has length 77 [2021-07-14 00:11:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:11:44,015 INFO L482 AbstractCegarLoop]: Abstraction has 1512 states and 2820 transitions. [2021-07-14 00:11:44,015 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2820 transitions. [2021-07-14 00:11:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-14 00:11:44,017 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:44,017 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:44,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-14 00:11:44,017 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1876075225, now seen corresponding path program 1 times [2021-07-14 00:11:44,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:44,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289453550] [2021-07-14 00:11:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:11:44,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:44,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:44,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:44,070 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:11:44,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:11:44,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:44,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:44,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:11:44,095 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:11:44,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289453550] [2021-07-14 00:11:44,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289453550] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:11:44,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:11:44,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-14 00:11:44,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976122034] [2021-07-14 00:11:44,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-14 00:11:44,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:11:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-14 00:11:44,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-14 00:11:44,096 INFO L87 Difference]: Start difference. First operand 1512 states and 2820 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:11:44,168 INFO L93 Difference]: Finished difference Result 2278 states and 4626 transitions. [2021-07-14 00:11:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-14 00:11:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-07-14 00:11:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:11:44,173 INFO L225 Difference]: With dead ends: 2278 [2021-07-14 00:11:44,173 INFO L226 Difference]: Without dead ends: 1372 [2021-07-14 00:11:44,173 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:11:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2021-07-14 00:11:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1192. [2021-07-14 00:11:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1156 states have (on average 2.0484429065743943) internal successors, (2368), 1191 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2368 transitions. [2021-07-14 00:11:44,190 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2368 transitions. Word has length 81 [2021-07-14 00:11:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:11:44,191 INFO L482 AbstractCegarLoop]: Abstraction has 1192 states and 2368 transitions. [2021-07-14 00:11:44,191 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2368 transitions. [2021-07-14 00:11:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-14 00:11:44,192 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:44,192 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:44,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-14 00:11:44,192 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:44,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1947708959, now seen corresponding path program 2 times [2021-07-14 00:11:44,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:44,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615620731] [2021-07-14 00:11:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:11:44,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:44,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:44,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:44,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:44,256 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:11:44,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:11:44,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:11:44,289 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:11:44,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:44,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:11:44,296 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:11:44,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615620731] [2021-07-14 00:11:44,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615620731] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:11:44,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:11:44,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-14 00:11:44,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590984835] [2021-07-14 00:11:44,298 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-14 00:11:44,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:11:44,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-14 00:11:44,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-14 00:11:44,299 INFO L87 Difference]: Start difference. First operand 1192 states and 2368 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:11:44,392 INFO L93 Difference]: Finished difference Result 688 states and 1183 transitions. [2021-07-14 00:11:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-14 00:11:44,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-07-14 00:11:44,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:11:44,393 INFO L225 Difference]: With dead ends: 688 [2021-07-14 00:11:44,393 INFO L226 Difference]: Without dead ends: 290 [2021-07-14 00:11:44,394 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 91.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-14 00:11:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-07-14 00:11:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2021-07-14 00:11:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 281 states have (on average 1.6939501779359432) internal successors, (476), 289 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 476 transitions. [2021-07-14 00:11:44,398 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 476 transitions. Word has length 81 [2021-07-14 00:11:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:11:44,398 INFO L482 AbstractCegarLoop]: Abstraction has 290 states and 476 transitions. [2021-07-14 00:11:44,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 476 transitions. [2021-07-14 00:11:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-14 00:11:44,398 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:44,398 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:44,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-14 00:11:44,399 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1291076433, now seen corresponding path program 1 times [2021-07-14 00:11:44,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:44,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279731858] [2021-07-14 00:11:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:11:44,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:44,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:44,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:11:44,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:11:44,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:11:44,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-14 00:11:44,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:44,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-14 00:11:44,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-14 00:11:44,500 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:11:44,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:11:44,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:44,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:44,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:11:44,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:11:44,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279731858] [2021-07-14 00:11:44,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279731858] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:11:44,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:11:44,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-14 00:11:44,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412848135] [2021-07-14 00:11:44,539 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-14 00:11:44,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:11:44,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-14 00:11:44,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-07-14 00:11:44,539 INFO L87 Difference]: Start difference. First operand 290 states and 476 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:11:44,701 INFO L93 Difference]: Finished difference Result 451 states and 812 transitions. [2021-07-14 00:11:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-14 00:11:44,701 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-07-14 00:11:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:11:44,702 INFO L225 Difference]: With dead ends: 451 [2021-07-14 00:11:44,702 INFO L226 Difference]: Without dead ends: 248 [2021-07-14 00:11:44,703 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 154.7ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-07-14 00:11:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-07-14 00:11:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-07-14 00:11:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 239 states have (on average 1.7740585774058577) internal successors, (424), 247 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 424 transitions. [2021-07-14 00:11:44,709 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 424 transitions. Word has length 86 [2021-07-14 00:11:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:11:44,709 INFO L482 AbstractCegarLoop]: Abstraction has 248 states and 424 transitions. [2021-07-14 00:11:44,709 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 424 transitions. [2021-07-14 00:11:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-14 00:11:44,709 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:44,709 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:44,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-14 00:11:44,710 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:44,710 INFO L82 PathProgramCache]: Analyzing trace with hash -94336893, now seen corresponding path program 2 times [2021-07-14 00:11:44,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:44,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865691774] [2021-07-14 00:11:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:11:44,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:44,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:11:44,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:11:44,797 INFO L142 QuantifierPusher]: treesize reduction 9, result has 72.7 percent of original size [2021-07-14 00:11:44,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-14 00:11:44,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:11:44,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-14 00:11:44,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-14 00:11:44,850 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-07-14 00:11:44,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-14 00:11:44,866 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:11:44,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:11:44,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:44,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:11:44,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:11:44,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:11:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:11:44,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:11:44,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865691774] [2021-07-14 00:11:44,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865691774] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:11:44,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:11:44,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-14 00:11:44,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465765679] [2021-07-14 00:11:44,899 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-14 00:11:44,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:11:44,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-14 00:11:44,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-07-14 00:11:44,900 INFO L87 Difference]: Start difference. First operand 248 states and 424 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:11:45,045 INFO L93 Difference]: Finished difference Result 362 states and 655 transitions. [2021-07-14 00:11:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-14 00:11:45,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-07-14 00:11:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:11:45,046 INFO L225 Difference]: With dead ends: 362 [2021-07-14 00:11:45,046 INFO L226 Difference]: Without dead ends: 245 [2021-07-14 00:11:45,047 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 157.3ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-07-14 00:11:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-07-14 00:11:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-07-14 00:11:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 236 states have (on average 1.771186440677966) internal successors, (418), 244 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 418 transitions. [2021-07-14 00:11:45,050 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 418 transitions. Word has length 86 [2021-07-14 00:11:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:11:45,050 INFO L482 AbstractCegarLoop]: Abstraction has 245 states and 418 transitions. [2021-07-14 00:11:45,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:11:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 418 transitions. [2021-07-14 00:11:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-14 00:11:45,051 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:11:45,051 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:11:45,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-14 00:11:45,051 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:11:45,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:11:45,052 INFO L82 PathProgramCache]: Analyzing trace with hash 878216973, now seen corresponding path program 3 times [2021-07-14 00:11:45,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:11:45,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276327379] [2021-07-14 00:11:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:11:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:11:45,080 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:11:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:11:45,107 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:11:45,141 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-14 00:11:45,141 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-14 00:11:45,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-14 00:11:45,142 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-14 00:11:45,143 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-14 00:11:45,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:11:45 BasicIcfg [2021-07-14 00:11:45,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-14 00:11:45,241 INFO L168 Benchmark]: Toolchain (without parser) took 6246.15 ms. Allocated memory was 203.4 MB in the beginning and 605.0 MB in the end (delta: 401.6 MB). Free memory was 166.0 MB in the beginning and 441.2 MB in the end (delta: -275.3 MB). Peak memory consumption was 127.7 MB. Max. memory is 8.0 GB. [2021-07-14 00:11:45,241 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 203.4 MB. Free memory is still 184.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-14 00:11:45,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.56 ms. Allocated memory is still 203.4 MB. Free memory was 165.7 MB in the beginning and 173.4 MB in the end (delta: -7.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-07-14 00:11:45,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.51 ms. Allocated memory is still 203.4 MB. Free memory was 173.4 MB in the beginning and 170.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:11:45,242 INFO L168 Benchmark]: Boogie Preprocessor took 57.97 ms. Allocated memory is still 203.4 MB. Free memory was 170.7 MB in the beginning and 168.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:11:45,242 INFO L168 Benchmark]: RCFGBuilder took 1218.48 ms. Allocated memory is still 203.4 MB. Free memory was 168.1 MB in the beginning and 74.8 MB in the end (delta: 93.3 MB). Peak memory consumption was 105.4 MB. Max. memory is 8.0 GB. [2021-07-14 00:11:45,242 INFO L168 Benchmark]: TraceAbstraction took 4479.50 ms. Allocated memory was 203.4 MB in the beginning and 605.0 MB in the end (delta: 401.6 MB). Free memory was 74.8 MB in the beginning and 441.2 MB in the end (delta: -366.4 MB). Peak memory consumption was 35.2 MB. Max. memory is 8.0 GB. [2021-07-14 00:11:45,243 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 203.4 MB. Free memory is still 184.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 450.56 ms. Allocated memory is still 203.4 MB. Free memory was 165.7 MB in the beginning and 173.4 MB in the end (delta: -7.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 34.51 ms. Allocated memory is still 203.4 MB. Free memory was 173.4 MB in the beginning and 170.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 57.97 ms. Allocated memory is still 203.4 MB. Free memory was 170.7 MB in the beginning and 168.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1218.48 ms. Allocated memory is still 203.4 MB. Free memory was 168.1 MB in the beginning and 74.8 MB in the end (delta: 93.3 MB). Peak memory consumption was 105.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4479.50 ms. Allocated memory was 203.4 MB in the beginning and 605.0 MB in the end (delta: 401.6 MB). Free memory was 74.8 MB in the beginning and 441.2 MB in the end (delta: -366.4 MB). Peak memory consumption was 35.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18514, positive: 17554, positive conditional: 17554, positive unconditional: 0, negative: 960, negative conditional: 960, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18010, positive: 17554, positive conditional: 0, positive unconditional: 17554, negative: 456, negative conditional: 0, negative unconditional: 456, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 693, positive: 679, positive conditional: 0, positive unconditional: 679, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 693, positive: 678, positive conditional: 0, positive unconditional: 678, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 139, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18010, positive: 16875, positive conditional: 0, positive unconditional: 16875, negative: 442, negative conditional: 0, negative unconditional: 442, unknown: 693, unknown conditional: 0, unknown unconditional: 693] , Statistics on independence cache: Total cache size (in pairs): 693, Positive cache size: 679, Positive conditional cache size: 0, Positive unconditional cache size: 679, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 504 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 36897, positive: 34464, positive conditional: 34464, positive unconditional: 0, negative: 2433, negative conditional: 2433, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35903, positive: 34464, positive conditional: 0, positive unconditional: 34464, negative: 1439, negative conditional: 0, negative unconditional: 1439, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 863, positive: 833, positive conditional: 0, positive unconditional: 833, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 863, positive: 829, positive conditional: 0, positive unconditional: 829, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 269, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 266, negative conditional: 0, negative unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35903, positive: 33631, positive conditional: 0, positive unconditional: 33631, negative: 1409, negative conditional: 0, negative unconditional: 1409, unknown: 863, unknown conditional: 0, unknown unconditional: 863] , Statistics on independence cache: Total cache size (in pairs): 863, Positive cache size: 833, Positive conditional cache size: 0, Positive unconditional cache size: 833, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Independence queries for same thread: 994 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1120; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1120, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1121; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1121, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1122; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t1122, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 810.3ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 19.5ms, AutomataDifference: 85.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 478.9ms, PartialOrderReductionTime: 464.4ms, HoareTripleCheckerStatistics: 92 SDtfs, 35 SDslu, 29 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5019occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.8ms SsaConstructionTime, 55.5ms SatisfiabilityAnalysisTime, 74.4ms InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3455.2ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 53.0ms, AutomataDifference: 1213.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 575.1ms, PartialOrderReductionTime: 573.8ms, HoareTripleCheckerStatistics: 1006 SDtfs, 1588 SDslu, 3719 SDs, 0 SdLazy, 448 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 314.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 852.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10339occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 380.6ms AutomataMinimizationTime, 8 MinimizatonAttempts, 180 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 25.9ms SsaConstructionTime, 302.4ms SatisfiabilityAnalysisTime, 773.8ms InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 622 ConstructedInterpolants, 0 QuantifiedInterpolants, 2893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...