/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:52:29,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:52:29,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:52:29,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:52:29,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:52:29,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:52:29,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:52:29,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:52:29,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:52:29,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:52:29,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:52:29,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:52:29,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:52:29,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:52:29,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:52:29,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:52:29,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:52:29,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:52:29,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:52:29,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:52:29,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:52:29,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:52:29,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:52:29,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:52:29,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:52:29,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:52:29,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:52:29,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:52:29,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:52:29,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:52:29,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:52:29,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:52:29,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:52:29,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:52:29,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:52:29,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:52:29,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:52:29,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:52:29,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:52:29,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:52:29,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:52:29,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 17:52:29,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:52:29,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:52:29,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:52:29,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:52:29,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:52:29,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:52:29,464 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:52:29,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:52:29,465 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:52:29,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:52:29,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:52:29,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:52:29,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:52:29,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:52:29,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:52:29,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:52:29,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:52:29,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:52:29,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:52:29,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:52:29,468 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:52:29,468 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:52:29,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:52:29,468 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 17:52:29,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:52:29,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:52:29,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:52:29,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:52:29,660 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:52:29,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2022-03-15 17:52:29,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a05bb45/32d4c1db8e0540dea4e2eda6ae83feec/FLAG6a8437b2c [2022-03-15 17:52:30,056 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:52:30,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2022-03-15 17:52:30,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a05bb45/32d4c1db8e0540dea4e2eda6ae83feec/FLAG6a8437b2c [2022-03-15 17:52:30,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a05bb45/32d4c1db8e0540dea4e2eda6ae83feec [2022-03-15 17:52:30,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:52:30,446 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:52:30,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:52:30,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:52:30,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:52:30,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:30,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd7e837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30, skipping insertion in model container [2022-03-15 17:52:30,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:30,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:52:30,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:52:30,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i[949,962] [2022-03-15 17:52:30,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:30,799 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:52:30,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i[949,962] [2022-03-15 17:52:30,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:30,891 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:52:30,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30 WrapperNode [2022-03-15 17:52:30,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:52:30,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:30,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:52:30,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:52:30,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:30,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:30,962 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 292 [2022-03-15 17:52:30,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:30,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:52:30,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:52:30,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:52:30,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:30,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:30,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:30,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:30,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:31,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:31,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:31,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:52:31,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:52:31,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:52:31,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:52:31,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (1/1) ... [2022-03-15 17:52:31,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:52:31,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:52:31,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 17:52:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:52:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:52:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:52:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:52:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:52:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:52:31,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:52:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:52:31,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:52:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:52:31,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:52:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-03-15 17:52:31,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-03-15 17:52:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:52:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:52:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:52:31,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:52:31,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 17:52:31,089 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 17:52:31,254 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:52:31,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:52:31,614 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:52:31,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:52:31,858 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:52:31,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:31 BoogieIcfgContainer [2022-03-15 17:52:31,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:52:31,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:52:31,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:52:31,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:52:31,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:52:30" (1/3) ... [2022-03-15 17:52:31,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1920462c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:31, skipping insertion in model container [2022-03-15 17:52:31,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:30" (2/3) ... [2022-03-15 17:52:31,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1920462c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:31, skipping insertion in model container [2022-03-15 17:52:31,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:31" (3/3) ... [2022-03-15 17:52:31,869 INFO L111 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2022-03-15 17:52:31,873 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:52:31,873 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:52:31,873 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:52:31,873 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:52:31,922 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,922 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,922 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,922 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,923 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,923 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,923 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,923 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,923 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,923 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,924 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,925 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,925 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,925 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,926 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,928 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,928 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,928 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,928 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,928 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,928 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,929 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,929 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,933 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,933 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,933 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,933 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,933 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,933 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,933 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,934 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,934 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,934 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,934 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,935 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,935 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,935 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,935 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,935 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,935 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,935 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,935 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,935 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,936 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,936 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,936 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,937 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,937 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,938 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,939 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,940 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,944 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,944 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,944 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,944 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,944 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,945 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,945 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,945 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,946 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,950 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,950 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,951 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,951 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,951 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,951 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,951 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,952 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,952 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,952 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,952 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,952 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,953 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,953 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,954 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,954 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,954 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,954 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,954 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,954 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,954 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,954 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,955 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,955 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:31,957 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:52:31,997 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:52:32,006 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 17:52:32,007 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 17:52:32,019 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:52:32,029 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 296 flow [2022-03-15 17:52:32,031 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 296 flow [2022-03-15 17:52:32,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-03-15 17:52:32,089 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2022-03-15 17:52:32,089 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:52:32,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-03-15 17:52:32,101 INFO L116 LiptonReduction]: Number of co-enabled transitions 3330 [2022-03-15 17:52:39,806 INFO L131 LiptonReduction]: Checked pairs total: 9063 [2022-03-15 17:52:39,808 INFO L133 LiptonReduction]: Total number of compositions: 115 [2022-03-15 17:52:39,814 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2022-03-15 17:52:40,053 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4850 states, 4847 states have (on average 4.14235609655457) internal successors, (20078), 4849 states have internal predecessors, (20078), 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) [2022-03-15 17:52:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 4850 states, 4847 states have (on average 4.14235609655457) internal successors, (20078), 4849 states have internal predecessors, (20078), 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) [2022-03-15 17:52:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 17:52:40,073 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:40,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:40,075 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash 939252987, now seen corresponding path program 1 times [2022-03-15 17:52:40,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:40,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115780445] [2022-03-15 17:52:40,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:40,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:40,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115780445] [2022-03-15 17:52:40,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115780445] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:40,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:40,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:52:40,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [93589515] [2022-03-15 17:52:40,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:40,312 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:40,320 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2022-03-15 17:52:40,321 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:40,322 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:40,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:52:40,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:40,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:52:40,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:52:40,358 INFO L87 Difference]: Start difference. First operand has 4850 states, 4847 states have (on average 4.14235609655457) internal successors, (20078), 4849 states have internal predecessors, (20078), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-03-15 17:52:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:40,464 INFO L93 Difference]: Finished difference Result 3970 states and 15654 transitions. [2022-03-15 17:52:40,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:52:40,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-03-15 17:52:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:40,501 INFO L225 Difference]: With dead ends: 3970 [2022-03-15 17:52:40,501 INFO L226 Difference]: Without dead ends: 3250 [2022-03-15 17:52:40,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:52:40,504 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:40,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 10 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:52:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2022-03-15 17:52:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2022-03-15 17:52:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3249 states have (on average 3.920590951061865) internal successors, (12738), 3249 states have internal predecessors, (12738), 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) [2022-03-15 17:52:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2022-03-15 17:52:40,661 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 7 [2022-03-15 17:52:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:40,661 INFO L470 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2022-03-15 17:52:40,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-03-15 17:52:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2022-03-15 17:52:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 17:52:40,664 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:40,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:40,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:52:40,665 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2144279684, now seen corresponding path program 1 times [2022-03-15 17:52:40,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:40,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356894522] [2022-03-15 17:52:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:40,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:40,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:40,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356894522] [2022-03-15 17:52:40,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356894522] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:40,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:40,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:52:40,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1724362386] [2022-03-15 17:52:40,791 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:40,792 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:40,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 17:52:40,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:40,794 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:40,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:52:40,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:52:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:40,796 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-03-15 17:52:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:40,956 INFO L93 Difference]: Finished difference Result 3730 states and 14152 transitions. [2022-03-15 17:52:40,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:40,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-03-15 17:52:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:41,001 INFO L225 Difference]: With dead ends: 3730 [2022-03-15 17:52:41,002 INFO L226 Difference]: Without dead ends: 3130 [2022-03-15 17:52:41,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:41,003 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:41,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2022-03-15 17:52:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 3130. [2022-03-15 17:52:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 3129 states have (on average 3.8932566315116652) internal successors, (12182), 3129 states have internal predecessors, (12182), 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) [2022-03-15 17:52:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 12182 transitions. [2022-03-15 17:52:41,223 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 12182 transitions. Word has length 12 [2022-03-15 17:52:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:41,224 INFO L470 AbstractCegarLoop]: Abstraction has 3130 states and 12182 transitions. [2022-03-15 17:52:41,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-03-15 17:52:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 12182 transitions. [2022-03-15 17:52:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 17:52:41,226 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:41,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:41,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:52:41,227 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1437892348, now seen corresponding path program 1 times [2022-03-15 17:52:41,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:41,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114183204] [2022-03-15 17:52:41,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:41,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:41,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:41,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114183204] [2022-03-15 17:52:41,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114183204] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:41,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:41,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:52:41,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1269480494] [2022-03-15 17:52:41,309 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:41,310 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:41,314 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2022-03-15 17:52:41,314 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:41,437 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:41,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:52:41,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:41,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:52:41,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:41,438 INFO L87 Difference]: Start difference. First operand 3130 states and 12182 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-03-15 17:52:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:41,544 INFO L93 Difference]: Finished difference Result 3310 states and 12506 transitions. [2022-03-15 17:52:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:41,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-03-15 17:52:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:41,559 INFO L225 Difference]: With dead ends: 3310 [2022-03-15 17:52:41,559 INFO L226 Difference]: Without dead ends: 2770 [2022-03-15 17:52:41,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:41,562 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:41,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:41,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-03-15 17:52:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2770. [2022-03-15 17:52:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2769 states have (on average 3.84037558685446) internal successors, (10634), 2769 states have internal predecessors, (10634), 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) [2022-03-15 17:52:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 10634 transitions. [2022-03-15 17:52:41,679 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 10634 transitions. Word has length 13 [2022-03-15 17:52:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:41,679 INFO L470 AbstractCegarLoop]: Abstraction has 2770 states and 10634 transitions. [2022-03-15 17:52:41,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-03-15 17:52:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 10634 transitions. [2022-03-15 17:52:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 17:52:41,682 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:41,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:41,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:52:41,682 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1165141554, now seen corresponding path program 1 times [2022-03-15 17:52:41,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:41,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363002698] [2022-03-15 17:52:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:41,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:41,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:41,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363002698] [2022-03-15 17:52:41,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363002698] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:41,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:41,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:52:41,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2131941729] [2022-03-15 17:52:41,758 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:41,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:41,764 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 51 transitions. [2022-03-15 17:52:41,764 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:42,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:42,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:42,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:42,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:42,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:42,364 INFO L87 Difference]: Start difference. First operand 2770 states and 10634 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-03-15 17:52:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:42,466 INFO L93 Difference]: Finished difference Result 3082 states and 11544 transitions. [2022-03-15 17:52:42,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:42,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 15 [2022-03-15 17:52:42,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:42,480 INFO L225 Difference]: With dead ends: 3082 [2022-03-15 17:52:42,480 INFO L226 Difference]: Without dead ends: 2722 [2022-03-15 17:52:42,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:52:42,481 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:42,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 21 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2022-03-15 17:52:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2722. [2022-03-15 17:52:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2721 states have (on average 3.8302094818081587) internal successors, (10422), 2721 states have internal predecessors, (10422), 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) [2022-03-15 17:52:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 10422 transitions. [2022-03-15 17:52:42,573 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 10422 transitions. Word has length 15 [2022-03-15 17:52:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:42,573 INFO L470 AbstractCegarLoop]: Abstraction has 2722 states and 10422 transitions. [2022-03-15 17:52:42,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-03-15 17:52:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 10422 transitions. [2022-03-15 17:52:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:52:42,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:42,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:42,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:52:42,576 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:42,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:42,577 INFO L85 PathProgramCache]: Analyzing trace with hash -987410493, now seen corresponding path program 1 times [2022-03-15 17:52:42,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:42,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455807029] [2022-03-15 17:52:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:42,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:42,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455807029] [2022-03-15 17:52:42,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455807029] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:42,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:42,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:42,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631945991] [2022-03-15 17:52:42,652 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:42,654 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:42,659 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions. [2022-03-15 17:52:42,659 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:43,213 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [47717#(and (= ~y$w_buff0_used~0 0) (or (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 1))), 47716#(and (= ~y$w_buff0_used~0 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 1)))] [2022-03-15 17:52:43,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:52:43,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:52:43,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:52:43,214 INFO L87 Difference]: Start difference. First operand 2722 states and 10422 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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) [2022-03-15 17:52:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:43,413 INFO L93 Difference]: Finished difference Result 2922 states and 11008 transitions. [2022-03-15 17:52:43,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:43,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 16 [2022-03-15 17:52:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:43,426 INFO L225 Difference]: With dead ends: 2922 [2022-03-15 17:52:43,426 INFO L226 Difference]: Without dead ends: 2666 [2022-03-15 17:52:43,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:52:43,427 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 77 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:43,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 41 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2022-03-15 17:52:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2626. [2022-03-15 17:52:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2625 states have (on average 3.817904761904762) internal successors, (10022), 2625 states have internal predecessors, (10022), 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) [2022-03-15 17:52:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 10022 transitions. [2022-03-15 17:52:43,497 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 10022 transitions. Word has length 16 [2022-03-15 17:52:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:43,498 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 10022 transitions. [2022-03-15 17:52:43,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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) [2022-03-15 17:52:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 10022 transitions. [2022-03-15 17:52:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:52:43,502 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:43,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:43,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:52:43,503 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash -322383802, now seen corresponding path program 1 times [2022-03-15 17:52:43,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:43,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373482093] [2022-03-15 17:52:43,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:43,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:43,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:43,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373482093] [2022-03-15 17:52:43,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373482093] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:43,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:43,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:52:43,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [300550794] [2022-03-15 17:52:43,573 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:43,575 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:43,585 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 93 transitions. [2022-03-15 17:52:43,619 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:44,388 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:44,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:44,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:44,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:44,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:44,389 INFO L87 Difference]: Start difference. First operand 2626 states and 10022 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-03-15 17:52:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:44,493 INFO L93 Difference]: Finished difference Result 2866 states and 10686 transitions. [2022-03-15 17:52:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:44,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 16 [2022-03-15 17:52:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:44,505 INFO L225 Difference]: With dead ends: 2866 [2022-03-15 17:52:44,505 INFO L226 Difference]: Without dead ends: 2578 [2022-03-15 17:52:44,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:52:44,506 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:44,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 28 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-03-15 17:52:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2578. [2022-03-15 17:52:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2577 states have (on average 3.8020954598370196) internal successors, (9798), 2577 states have internal predecessors, (9798), 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) [2022-03-15 17:52:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 9798 transitions. [2022-03-15 17:52:44,589 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 9798 transitions. Word has length 16 [2022-03-15 17:52:44,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:44,589 INFO L470 AbstractCegarLoop]: Abstraction has 2578 states and 9798 transitions. [2022-03-15 17:52:44,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-03-15 17:52:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 9798 transitions. [2022-03-15 17:52:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:52:44,595 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:44,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:44,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:52:44,595 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:44,596 INFO L85 PathProgramCache]: Analyzing trace with hash 892311793, now seen corresponding path program 1 times [2022-03-15 17:52:44,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:44,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155396072] [2022-03-15 17:52:44,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:44,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:44,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:44,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155396072] [2022-03-15 17:52:44,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155396072] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:44,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:44,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:44,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [425083184] [2022-03-15 17:52:44,678 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:44,680 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:44,688 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 131 transitions. [2022-03-15 17:52:44,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:45,508 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [63934#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff0~0 0)), 63933#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= 2 ~y$w_buff0~0))] [2022-03-15 17:52:45,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:52:45,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:45,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:52:45,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:52:45,511 INFO L87 Difference]: Start difference. First operand 2578 states and 9798 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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) [2022-03-15 17:52:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:45,728 INFO L93 Difference]: Finished difference Result 3258 states and 12208 transitions. [2022-03-15 17:52:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:52:45,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 17 [2022-03-15 17:52:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:45,739 INFO L225 Difference]: With dead ends: 3258 [2022-03-15 17:52:45,739 INFO L226 Difference]: Without dead ends: 3018 [2022-03-15 17:52:45,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:52:45,740 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:45,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 75 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:52:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2022-03-15 17:52:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2858. [2022-03-15 17:52:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2857 states have (on average 3.7983899194959747) internal successors, (10852), 2857 states have internal predecessors, (10852), 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) [2022-03-15 17:52:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 10852 transitions. [2022-03-15 17:52:45,811 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 10852 transitions. Word has length 17 [2022-03-15 17:52:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:45,812 INFO L470 AbstractCegarLoop]: Abstraction has 2858 states and 10852 transitions. [2022-03-15 17:52:45,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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) [2022-03-15 17:52:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 10852 transitions. [2022-03-15 17:52:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:52:45,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:45,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:45,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:52:45,816 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash -591656575, now seen corresponding path program 2 times [2022-03-15 17:52:45,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:45,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162827318] [2022-03-15 17:52:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:45,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:45,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:45,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162827318] [2022-03-15 17:52:45,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162827318] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:45,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:45,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:52:45,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1863177981] [2022-03-15 17:52:45,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:45,948 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:45,956 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 69 transitions. [2022-03-15 17:52:45,956 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:46,901 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [72922#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff1~0 ~y$w_buff0~0) (= (mod ~y$r_buff1_thd0~0 256) 0) (= ~y$w_buff1~0 1)) (or (= ~y$w_buff1~0 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (= ~y$w_buff1~0 1)) (not (= 2 ~y$w_buff0~0))), 72920#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 1)) (not (= 2 ~y$w_buff0~0))), 72921#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff1~0 ~y$w_buff0~0) (= (mod ~y$r_buff1_thd0~0 256) 0) (= ~y$w_buff1~0 1)) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 1)) (or (= ~y$w_buff1~0 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (= ~y$w_buff1~0 1)) (not (= 2 ~y$w_buff0~0)))] [2022-03-15 17:52:46,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 17:52:46,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:46,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 17:52:46,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:52:46,902 INFO L87 Difference]: Start difference. First operand 2858 states and 10852 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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) [2022-03-15 17:52:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:47,090 INFO L93 Difference]: Finished difference Result 3186 states and 11918 transitions. [2022-03-15 17:52:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:47,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 17 [2022-03-15 17:52:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:47,100 INFO L225 Difference]: With dead ends: 3186 [2022-03-15 17:52:47,100 INFO L226 Difference]: Without dead ends: 2994 [2022-03-15 17:52:47,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:52:47,101 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:47,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 58 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2022-03-15 17:52:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2778. [2022-03-15 17:52:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2778 states, 2777 states have (on average 3.78826071299964) internal successors, (10520), 2777 states have internal predecessors, (10520), 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) [2022-03-15 17:52:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 10520 transitions. [2022-03-15 17:52:47,167 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 10520 transitions. Word has length 17 [2022-03-15 17:52:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:47,167 INFO L470 AbstractCegarLoop]: Abstraction has 2778 states and 10520 transitions. [2022-03-15 17:52:47,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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) [2022-03-15 17:52:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 10520 transitions. [2022-03-15 17:52:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 17:52:47,171 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:47,172 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:47,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:52:47,172 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:47,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash 22252293, now seen corresponding path program 1 times [2022-03-15 17:52:47,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:47,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910511542] [2022-03-15 17:52:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:47,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:47,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910511542] [2022-03-15 17:52:47,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910511542] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:47,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:47,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 17:52:47,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2088975907] [2022-03-15 17:52:47,353 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:47,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:47,364 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 102 transitions. [2022-03-15 17:52:47,364 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:49,368 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [81675#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (or (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 1))), 81676#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (or (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 1)))] [2022-03-15 17:52:49,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 17:52:49,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:49,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 17:52:49,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:52:49,369 INFO L87 Difference]: Start difference. First operand 2778 states and 10520 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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) [2022-03-15 17:52:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:49,600 INFO L93 Difference]: Finished difference Result 3530 states and 13236 transitions. [2022-03-15 17:52:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:49,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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 18 [2022-03-15 17:52:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:49,615 INFO L225 Difference]: With dead ends: 3530 [2022-03-15 17:52:49,615 INFO L226 Difference]: Without dead ends: 3290 [2022-03-15 17:52:49,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-03-15 17:52:49,616 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 117 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:49,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 55 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:52:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2022-03-15 17:52:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 3170. [2022-03-15 17:52:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3169 states have (on average 3.782265698958662) internal successors, (11986), 3169 states have internal predecessors, (11986), 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) [2022-03-15 17:52:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 11986 transitions. [2022-03-15 17:52:49,710 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 11986 transitions. Word has length 18 [2022-03-15 17:52:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:49,712 INFO L470 AbstractCegarLoop]: Abstraction has 3170 states and 11986 transitions. [2022-03-15 17:52:49,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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) [2022-03-15 17:52:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 11986 transitions. [2022-03-15 17:52:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 17:52:49,718 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:49,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:49,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:52:49,719 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:49,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:49,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1958776149, now seen corresponding path program 2 times [2022-03-15 17:52:49,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:49,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462624899] [2022-03-15 17:52:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:49,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:49,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462624899] [2022-03-15 17:52:49,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462624899] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:49,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:49,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:52:49,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [540778969] [2022-03-15 17:52:49,889 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:49,890 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:49,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 148 transitions. [2022-03-15 17:52:49,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:54,595 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [91563#(and (= ~y$r_buff0_thd0~0 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (or (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1))), 91564#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), 91560#(and (= ~y$r_buff0_thd0~0 0) (or (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1)) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$r_buff1_thd0~0 0) (or (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 1))), 91561#(and (= ~y$r_buff0_thd0~0 0) (or (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1)) (= ~y$r_buff1_thd0~0 0) (or (= ~y$w_buff1~0 0) (= ~y$w_buff1~0 1))), 91562#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= (mod ~y$r_buff0_thd2~0 256) 0) (or (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1)))] [2022-03-15 17:52:54,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 17:52:54,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:54,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 17:52:54,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-15 17:52:54,596 INFO L87 Difference]: Start difference. First operand 3170 states and 11986 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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) [2022-03-15 17:52:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:54,933 INFO L93 Difference]: Finished difference Result 4106 states and 15012 transitions. [2022-03-15 17:52:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:52:54,933 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 18 [2022-03-15 17:52:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:54,960 INFO L225 Difference]: With dead ends: 4106 [2022-03-15 17:52:54,960 INFO L226 Difference]: Without dead ends: 3738 [2022-03-15 17:52:54,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-03-15 17:52:54,961 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 191 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:54,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 57 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:52:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2022-03-15 17:52:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3058. [2022-03-15 17:52:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3057 states have (on average 3.725875040889761) internal successors, (11390), 3057 states have internal predecessors, (11390), 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) [2022-03-15 17:52:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 11390 transitions. [2022-03-15 17:52:55,031 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 11390 transitions. Word has length 18 [2022-03-15 17:52:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:55,031 INFO L470 AbstractCegarLoop]: Abstraction has 3058 states and 11390 transitions. [2022-03-15 17:52:55,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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) [2022-03-15 17:52:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 11390 transitions. [2022-03-15 17:52:55,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 17:52:55,036 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:55,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:55,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:52:55,036 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:55,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2050750021, now seen corresponding path program 1 times [2022-03-15 17:52:55,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:55,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740661303] [2022-03-15 17:52:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:55,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:55,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740661303] [2022-03-15 17:52:55,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740661303] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:55,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:55,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:52:55,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [710000681] [2022-03-15 17:52:55,095 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:55,096 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:55,106 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 129 transitions. [2022-03-15 17:52:55,106 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:56,157 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [101800#(not (= 4 ~__unbuffered_cnt~0))] [2022-03-15 17:52:56,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:52:56,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:56,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:52:56,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:56,161 INFO L87 Difference]: Start difference. First operand 3058 states and 11390 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-03-15 17:52:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:56,262 INFO L93 Difference]: Finished difference Result 1532 states and 4630 transitions. [2022-03-15 17:52:56,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:52:56,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 18 [2022-03-15 17:52:56,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:56,266 INFO L225 Difference]: With dead ends: 1532 [2022-03-15 17:52:56,266 INFO L226 Difference]: Without dead ends: 1532 [2022-03-15 17:52:56,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:56,266 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:56,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2022-03-15 17:52:56,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2022-03-15 17:52:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 3.02416721097322) internal successors, (4630), 1531 states have internal predecessors, (4630), 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) [2022-03-15 17:52:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 4630 transitions. [2022-03-15 17:52:56,307 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 4630 transitions. Word has length 18 [2022-03-15 17:52:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:56,307 INFO L470 AbstractCegarLoop]: Abstraction has 1532 states and 4630 transitions. [2022-03-15 17:52:56,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-03-15 17:52:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 4630 transitions. [2022-03-15 17:52:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:52:56,310 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:56,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:56,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 17:52:56,310 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:56,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash -735365998, now seen corresponding path program 1 times [2022-03-15 17:52:56,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:56,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953159295] [2022-03-15 17:52:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:56,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:56,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953159295] [2022-03-15 17:52:56,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953159295] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:56,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:56,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:52:56,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946378305] [2022-03-15 17:52:56,428 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:56,430 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:56,465 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 191 transitions. [2022-03-15 17:52:56,465 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:57,080 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:57,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:52:57,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:57,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:52:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:57,086 INFO L87 Difference]: Start difference. First operand 1532 states and 4630 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2022-03-15 17:52:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:57,181 INFO L93 Difference]: Finished difference Result 2289 states and 6676 transitions. [2022-03-15 17:52:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:57,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 21 [2022-03-15 17:52:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:57,209 INFO L225 Difference]: With dead ends: 2289 [2022-03-15 17:52:57,209 INFO L226 Difference]: Without dead ends: 1556 [2022-03-15 17:52:57,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:57,210 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:57,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2022-03-15 17:52:57,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1508. [2022-03-15 17:52:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1507 states have (on average 2.8546781685467817) internal successors, (4302), 1507 states have internal predecessors, (4302), 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) [2022-03-15 17:52:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 4302 transitions. [2022-03-15 17:52:57,245 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 4302 transitions. Word has length 21 [2022-03-15 17:52:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:57,245 INFO L470 AbstractCegarLoop]: Abstraction has 1508 states and 4302 transitions. [2022-03-15 17:52:57,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2022-03-15 17:52:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 4302 transitions. [2022-03-15 17:52:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 17:52:57,248 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:57,248 INFO L514 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] [2022-03-15 17:52:57,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 17:52:57,248 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1471530894, now seen corresponding path program 1 times [2022-03-15 17:52:57,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:57,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686875770] [2022-03-15 17:52:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:57,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:57,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686875770] [2022-03-15 17:52:57,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686875770] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:57,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:57,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:57,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [572381389] [2022-03-15 17:52:57,410 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:57,413 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:57,457 INFO L252 McrAutomatonBuilder]: Finished intersection with 178 states and 429 transitions. [2022-03-15 17:52:57,457 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:58,880 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [111716#(not (= 2 ~__unbuffered_cnt~0)), 111714#(not (= 4 ~__unbuffered_cnt~0)), 111717#(<= ~__unbuffered_cnt~0 0), 111715#(not (= 3 ~__unbuffered_cnt~0))] [2022-03-15 17:52:58,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 17:52:58,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 17:52:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:52:58,881 INFO L87 Difference]: Start difference. First operand 1508 states and 4302 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 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) [2022-03-15 17:52:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:58,993 INFO L93 Difference]: Finished difference Result 1070 states and 3106 transitions. [2022-03-15 17:52:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 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 22 [2022-03-15 17:52:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:58,995 INFO L225 Difference]: With dead ends: 1070 [2022-03-15 17:52:58,995 INFO L226 Difference]: Without dead ends: 614 [2022-03-15 17:52:58,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:52:58,996 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 82 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:58,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 31 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-03-15 17:52:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 494. [2022-03-15 17:52:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.8356997971602436) internal successors, (1398), 493 states have internal predecessors, (1398), 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) [2022-03-15 17:52:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1398 transitions. [2022-03-15 17:52:59,006 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1398 transitions. Word has length 22 [2022-03-15 17:52:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:59,006 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 1398 transitions. [2022-03-15 17:52:59,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 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) [2022-03-15 17:52:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1398 transitions. [2022-03-15 17:52:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 17:52:59,007 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:59,008 INFO L514 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] [2022-03-15 17:52:59,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 17:52:59,008 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1210352779, now seen corresponding path program 1 times [2022-03-15 17:52:59,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:59,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954091136] [2022-03-15 17:52:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:59,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:59,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954091136] [2022-03-15 17:52:59,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954091136] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:59,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:59,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:59,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1462027959] [2022-03-15 17:52:59,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:59,066 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:59,117 INFO L252 McrAutomatonBuilder]: Finished intersection with 184 states and 378 transitions. [2022-03-15 17:52:59,117 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:00,224 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:00,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:53:00,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:00,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:53:00,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:53:00,225 INFO L87 Difference]: Start difference. First operand 494 states and 1398 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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) [2022-03-15 17:53:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:00,311 INFO L93 Difference]: Finished difference Result 642 states and 1785 transitions. [2022-03-15 17:53:00,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:53:00,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 28 [2022-03-15 17:53:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:00,311 INFO L225 Difference]: With dead ends: 642 [2022-03-15 17:53:00,312 INFO L226 Difference]: Without dead ends: 191 [2022-03-15 17:53:00,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:53:00,312 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:00,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-03-15 17:53:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-03-15 17:53:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.442105263157895) internal successors, (464), 190 states have internal predecessors, (464), 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) [2022-03-15 17:53:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 464 transitions. [2022-03-15 17:53:00,315 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 464 transitions. Word has length 28 [2022-03-15 17:53:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:00,315 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 464 transitions. [2022-03-15 17:53:00,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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) [2022-03-15 17:53:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 464 transitions. [2022-03-15 17:53:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 17:53:00,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:00,316 INFO L514 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] [2022-03-15 17:53:00,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 17:53:00,316 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash -686813545, now seen corresponding path program 2 times [2022-03-15 17:53:00,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:00,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143120847] [2022-03-15 17:53:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:53:00,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:00,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143120847] [2022-03-15 17:53:00,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143120847] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:00,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:00,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 17:53:00,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10322612] [2022-03-15 17:53:00,500 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:00,503 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:00,564 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 231 transitions. [2022-03-15 17:53:00,564 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:02,045 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [114820#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$r_buff1_thd0~0 0) (or (= ~y$w_buff0~0 0) (= (mod ~y$r_buff0_thd4~0 256) 0) (= ~y$w_buff0~0 1)))] [2022-03-15 17:53:02,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 17:53:02,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:02,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 17:53:02,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:53:02,046 INFO L87 Difference]: Start difference. First operand 191 states and 464 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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) [2022-03-15 17:53:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:02,201 INFO L93 Difference]: Finished difference Result 242 states and 587 transitions. [2022-03-15 17:53:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:53:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 28 [2022-03-15 17:53:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:02,203 INFO L225 Difference]: With dead ends: 242 [2022-03-15 17:53:02,203 INFO L226 Difference]: Without dead ends: 181 [2022-03-15 17:53:02,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 14 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-03-15 17:53:02,209 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 92 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:02,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 25 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-03-15 17:53:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2022-03-15 17:53:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.4761904761904763) internal successors, (416), 168 states have internal predecessors, (416), 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) [2022-03-15 17:53:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 416 transitions. [2022-03-15 17:53:02,221 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 416 transitions. Word has length 28 [2022-03-15 17:53:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:02,221 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 416 transitions. [2022-03-15 17:53:02,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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) [2022-03-15 17:53:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 416 transitions. [2022-03-15 17:53:02,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 17:53:02,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:02,222 INFO L514 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] [2022-03-15 17:53:02,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 17:53:02,222 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:02,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:02,222 INFO L85 PathProgramCache]: Analyzing trace with hash 661037817, now seen corresponding path program 3 times [2022-03-15 17:53:02,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:02,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327841953] [2022-03-15 17:53:02,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:02,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:53:02,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:53:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:53:02,320 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:53:02,322 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:53:02,322 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-15 17:53:02,323 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-15 17:53:02,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-03-15 17:53:02,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-03-15 17:53:02,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-03-15 17:53:02,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-03-15 17:53:02,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-15 17:53:02,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 17:53:02,326 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:02,329 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:53:02,329 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:53:02,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:53:02 BasicIcfg [2022-03-15 17:53:02,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:53:02,406 INFO L158 Benchmark]: Toolchain (without parser) took 31960.00ms. Allocated memory was 167.8MB in the beginning and 861.9MB in the end (delta: 694.2MB). Free memory was 115.2MB in the beginning and 709.5MB in the end (delta: -594.3MB). Peak memory consumption was 605.6MB. Max. memory is 8.0GB. [2022-03-15 17:53:02,406 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 132.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:53:02,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.06ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 129.8MB in the end (delta: -14.8MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-03-15 17:53:02,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.01ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 127.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:53:02,407 INFO L158 Benchmark]: Boogie Preprocessor took 42.70ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:53:02,407 INFO L158 Benchmark]: RCFGBuilder took 855.95ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 124.5MB in the beginning and 156.1MB in the end (delta: -31.6MB). Peak memory consumption was 49.0MB. Max. memory is 8.0GB. [2022-03-15 17:53:02,407 INFO L158 Benchmark]: TraceAbstraction took 30542.80ms. Allocated memory was 220.2MB in the beginning and 861.9MB in the end (delta: 641.7MB). Free memory was 155.6MB in the beginning and 709.5MB in the end (delta: -553.9MB). Peak memory consumption was 592.7MB. Max. memory is 8.0GB. [2022-03-15 17:53:02,408 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.10ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 132.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 443.06ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 129.8MB in the end (delta: -14.8MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.01ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 127.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.70ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 855.95ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 124.5MB in the beginning and 156.1MB in the end (delta: -31.6MB). Peak memory consumption was 49.0MB. Max. memory is 8.0GB. * TraceAbstraction took 30542.80ms. Allocated memory was 220.2MB in the beginning and 861.9MB in the end (delta: 641.7MB). Free memory was 155.6MB in the beginning and 709.5MB in the end (delta: -553.9MB). Peak memory consumption was 592.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 149 PlacesBefore, 48 PlacesAfterwards, 138 TransitionsBefore, 36 TransitionsAfterwards, 3330 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 9063 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3869, positive: 3635, positive conditional: 0, positive unconditional: 3635, negative: 234, negative conditional: 0, negative unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1754, positive: 1712, positive conditional: 0, positive unconditional: 1712, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3869, positive: 1923, positive conditional: 0, positive unconditional: 1923, negative: 192, negative conditional: 0, negative unconditional: 192, unknown: 1754, unknown conditional: 0, unknown unconditional: 1754] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1081, ((void *)0), P0, ((void *)0))=8, t1081={5: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1082, ((void *)0), P1, ((void *)0))=9, t1081={5:0}, t1082={6: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1083, ((void *)0), P2, ((void *)0))=10, t1081={5:0}, t1082={6:0}, t1083={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L857] 0 pthread_t t1084; [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1084, ((void *)0), P3, ((void *)0))=11, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L817] 4 z = 1 [L820] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L826] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L752] 1 b = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L770] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L773] 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) [L773] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L773] 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) [L773] 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) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] 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 [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 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 [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [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 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] 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) [L864] 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) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 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 [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 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 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 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) [L875] 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) [L876] 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)) [L876] 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) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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) [L878] 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)) [L878] 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)) [L879] 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)) [L879] 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) [L879] 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)) [L879] 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)) [L880] 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)) [L880] 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) [L880] 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)) [L880] 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)) [L881] 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)) [L881] 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) [L881] 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)) [L881] 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)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 983 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 983 mSDsluCounter, 519 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1497 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2154 IncrementalHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 149 mSDtfsCounter, 2154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 562 SyntacticMatches, 21 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4850occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1396 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 2245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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! [2022-03-15 17:53:02,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...