/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 21:39:45,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:39:45,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:39:45,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:39:45,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:39:45,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:39:45,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:39:45,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:39:45,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:39:45,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:39:45,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:39:45,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:39:45,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:39:45,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:39:45,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:39:45,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:39:45,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:39:45,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:39:45,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:39:45,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:39:45,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:39:46,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:39:46,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:39:46,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:39:46,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:39:46,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:39:46,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:39:46,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:39:46,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:39:46,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:39:46,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:39:46,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:39:46,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:39:46,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:39:46,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:39:46,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:39:46,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:39:46,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:39:46,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:39:46,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:39:46,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:39:46,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-10 21:39:46,097 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:39:46,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:39:46,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:39:46,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:39:46,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:39:46,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:39:46,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:39:46,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:39:46,100 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:39:46,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:39:46,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:39:46,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:39:46,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:39:46,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:39:46,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:39:46,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:39:46,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:39:46,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:39:46,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:39:46,101 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:39:46,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:39:46,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:39:46,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:39:46,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:39:46,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:39:46,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:39:46,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:39:46,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:39:46,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:39:46,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:39:46,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:39:46,103 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:39:46,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:39:46,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-10 21:39:46,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:39:46,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:39:46,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:39:46,488 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:39:46,489 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:39:46,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-02-10 21:39:46,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632f3b02a/ce2a5c4a7a2a4e8c92d737812461ca19/FLAG11a1a3a69 [2022-02-10 21:39:47,367 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:39:47,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-02-10 21:39:47,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632f3b02a/ce2a5c4a7a2a4e8c92d737812461ca19/FLAG11a1a3a69 [2022-02-10 21:39:47,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632f3b02a/ce2a5c4a7a2a4e8c92d737812461ca19 [2022-02-10 21:39:47,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:39:47,444 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:39:47,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:39:47,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:39:47,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:39:47,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:39:47" (1/1) ... [2022-02-10 21:39:47,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d80a3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:47, skipping insertion in model container [2022-02-10 21:39:47,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:39:47" (1/1) ... [2022-02-10 21:39:47,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:39:47,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:39:47,886 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/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-02-10 21:39:48,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:39:48,221 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:39:48,248 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/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-02-10 21:39:48,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:39:48,362 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:39:48,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48 WrapperNode [2022-02-10 21:39:48,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:39:48,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:39:48,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:39:48,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:39:48,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,471 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2022-02-10 21:39:48,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:39:48,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:39:48,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:39:48,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:39:48,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:39:48,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:39:48,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:39:48,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:39:48,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (1/1) ... [2022-02-10 21:39:48,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:39:48,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:39:48,601 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-02-10 21:39:48,656 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-02-10 21:39:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:39:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 21:39:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:39:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:39:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:39:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-10 21:39:48,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-10 21:39:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-10 21:39:48,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-10 21:39:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-10 21:39:48,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-10 21:39:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-02-10 21:39:48,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-02-10 21:39:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:39:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 21:39:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:39:48,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:39:48,698 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 21:39:48,906 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:39:48,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:39:49,555 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:39:49,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:39:49,989 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 21:39:49,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:39:49 BoogieIcfgContainer [2022-02-10 21:39:49,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:39:49,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:39:49,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:39:50,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:39:50,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:39:47" (1/3) ... [2022-02-10 21:39:50,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ba25b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:39:50, skipping insertion in model container [2022-02-10 21:39:50,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:39:48" (2/3) ... [2022-02-10 21:39:50,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ba25b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:39:50, skipping insertion in model container [2022-02-10 21:39:50,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:39:49" (3/3) ... [2022-02-10 21:39:50,005 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-02-10 21:39:50,010 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:39:50,010 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:39:50,010 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-10 21:39:50,010 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:39:50,076 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,076 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,076 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,076 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,076 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,077 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,077 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,077 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,078 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,078 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,078 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,078 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,079 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,079 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,079 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,079 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,079 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,080 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,080 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,080 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,080 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,081 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,081 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,081 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,082 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,082 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,082 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,082 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,082 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,082 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,083 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,083 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,083 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,083 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,084 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,084 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,084 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,084 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,084 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,084 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,084 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,084 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,085 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,085 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,085 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,085 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,085 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,086 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,086 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,086 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,086 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,086 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,087 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,087 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,087 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,087 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,088 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,088 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,088 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,088 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,089 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,089 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,089 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,089 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,089 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,090 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,090 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,090 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,090 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,091 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,091 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,091 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,091 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,091 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,091 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,092 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,092 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,092 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,092 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,092 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,093 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,093 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,094 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,095 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,095 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,095 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,096 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,098 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,104 WARN L322 ript$VariableManager]: TermVariable P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,104 WARN L322 ript$VariableManager]: TermVariable P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,104 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,104 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,104 WARN L322 ript$VariableManager]: TermVariable P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,104 WARN L322 ript$VariableManager]: TermVariable P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,105 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,105 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,105 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,105 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,105 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,105 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,105 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,105 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,106 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,107 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,108 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,108 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,108 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,108 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,108 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,109 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,109 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,110 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,110 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,110 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,112 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,112 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,112 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,112 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,113 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,114 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,115 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,116 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,116 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,116 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,116 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,118 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,118 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,118 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,118 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,119 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,119 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,119 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,119 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,119 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,119 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,120 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,120 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,120 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,120 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,121 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,121 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,121 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,121 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,124 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,124 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,124 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,124 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,124 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,124 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,124 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,125 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,125 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,125 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,126 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,126 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,126 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,127 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,127 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,127 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,127 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,127 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,127 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,127 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,128 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,128 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,128 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,128 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,128 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,129 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,132 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,133 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,133 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,133 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,134 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,139 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,140 WARN L322 ript$VariableManager]: TermVariable P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,141 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,141 WARN L322 ript$VariableManager]: TermVariable P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,141 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,141 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,141 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,141 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,141 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,141 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,142 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,142 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,142 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,142 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,142 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,142 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,142 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,142 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,143 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,143 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,143 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,143 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,143 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,143 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,143 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,143 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,143 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,144 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,144 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,144 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,144 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,144 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,144 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,145 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:39:50,145 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 21:39:50,195 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:39:50,203 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 21:39:50,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-10 21:39:50,218 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 138 transitions, 296 flow [2022-02-10 21:39:56,114 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 129063 states, 129060 states have (on average 4.45938323260499) internal successors, (575528), 129062 states have internal predecessors, (575528), 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-02-10 21:39:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 129063 states, 129060 states have (on average 4.45938323260499) internal successors, (575528), 129062 states have internal predecessors, (575528), 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-02-10 21:39:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-10 21:39:56,477 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:39:56,477 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:39:56,478 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:39:56,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:39:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1436643446, now seen corresponding path program 1 times [2022-02-10 21:39:56,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:39:56,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594599926] [2022-02-10 21:39:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:39:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:39:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:39:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:39:56,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:39:56,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594599926] [2022-02-10 21:39:56,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594599926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:39:56,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:39:56,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 21:39:56,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435368101] [2022-02-10 21:39:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:39:56,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:39:56,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:39:56,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:39:56,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:39:57,668 INFO L87 Difference]: Start difference. First operand has 129063 states, 129060 states have (on average 4.45938323260499) internal successors, (575528), 129062 states have internal predecessors, (575528), 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 25.0) internal successors, (50), 3 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-02-10 21:40:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:40:00,458 INFO L93 Difference]: Finished difference Result 107816 states and 471721 transitions. [2022-02-10 21:40:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:40:00,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 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 50 [2022-02-10 21:40:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:40:02,345 INFO L225 Difference]: With dead ends: 107816 [2022-02-10 21:40:02,345 INFO L226 Difference]: Without dead ends: 87080 [2022-02-10 21:40:02,363 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:40:02,369 INFO L934 BasicCegarLoop]: 119 mSDtfsCounter, 70 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:40:02,371 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 205 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:40:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87080 states. [2022-02-10 21:40:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87080 to 87080. [2022-02-10 21:40:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87080 states, 87079 states have (on average 4.411729578888136) internal successors, (384169), 87079 states have internal predecessors, (384169), 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-02-10 21:40:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87080 states to 87080 states and 384169 transitions. [2022-02-10 21:40:09,551 INFO L78 Accepts]: Start accepts. Automaton has 87080 states and 384169 transitions. Word has length 50 [2022-02-10 21:40:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:40:09,552 INFO L470 AbstractCegarLoop]: Abstraction has 87080 states and 384169 transitions. [2022-02-10 21:40:09,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 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-02-10 21:40:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 87080 states and 384169 transitions. [2022-02-10 21:40:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-10 21:40:09,706 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:40:09,706 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:40:09,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:40:09,708 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:40:09,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:40:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1501495155, now seen corresponding path program 1 times [2022-02-10 21:40:09,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:40:09,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906350707] [2022-02-10 21:40:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:40:09,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:40:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:40:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:40:10,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:40:10,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906350707] [2022-02-10 21:40:10,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906350707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:40:10,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:40:10,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:40:10,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923953365] [2022-02-10 21:40:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:40:10,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:40:10,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:40:10,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:40:10,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:40:10,593 INFO L87 Difference]: Start difference. First operand 87080 states and 384169 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:40:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:40:15,991 INFO L93 Difference]: Finished difference Result 175522 states and 765014 transitions. [2022-02-10 21:40:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:40:15,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-02-10 21:40:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:40:18,226 INFO L225 Difference]: With dead ends: 175522 [2022-02-10 21:40:18,238 INFO L226 Difference]: Without dead ends: 131657 [2022-02-10 21:40:18,243 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:40:18,248 INFO L934 BasicCegarLoop]: 212 mSDtfsCounter, 174 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 21:40:18,249 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 782 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 21:40:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131657 states. [2022-02-10 21:40:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131657 to 112127. [2022-02-10 21:40:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112127 states, 112126 states have (on average 4.373820523339814) internal successors, (490419), 112126 states have internal predecessors, (490419), 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-02-10 21:40:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112127 states to 112127 states and 490419 transitions. [2022-02-10 21:40:28,946 INFO L78 Accepts]: Start accepts. Automaton has 112127 states and 490419 transitions. Word has length 86 [2022-02-10 21:40:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:40:28,952 INFO L470 AbstractCegarLoop]: Abstraction has 112127 states and 490419 transitions. [2022-02-10 21:40:28,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:40:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 112127 states and 490419 transitions. [2022-02-10 21:40:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-10 21:40:29,204 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:40:29,204 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:40:29,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:40:29,205 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:40:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:40:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash 514084462, now seen corresponding path program 1 times [2022-02-10 21:40:29,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:40:29,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182168736] [2022-02-10 21:40:29,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:40:29,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:40:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:40:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:40:29,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:40:29,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182168736] [2022-02-10 21:40:29,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182168736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:40:29,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:40:29,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:40:29,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536993731] [2022-02-10 21:40:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:40:29,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:40:29,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:40:29,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:40:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:40:29,460 INFO L87 Difference]: Start difference. First operand 112127 states and 490419 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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-02-10 21:40:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:40:32,461 INFO L93 Difference]: Finished difference Result 145403 states and 629693 transitions. [2022-02-10 21:40:32,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 21:40:32,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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 88 [2022-02-10 21:40:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:40:33,533 INFO L225 Difference]: With dead ends: 145403 [2022-02-10 21:40:33,533 INFO L226 Difference]: Without dead ends: 115823 [2022-02-10 21:40:33,533 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:40:33,534 INFO L934 BasicCegarLoop]: 184 mSDtfsCounter, 304 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:40:33,535 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 752 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 21:40:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115823 states. [2022-02-10 21:40:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115823 to 90573. [2022-02-10 21:40:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90573 states, 90572 states have (on average 4.366382546482357) internal successors, (395472), 90572 states have internal predecessors, (395472), 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-02-10 21:40:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90573 states to 90573 states and 395472 transitions. [2022-02-10 21:40:38,880 INFO L78 Accepts]: Start accepts. Automaton has 90573 states and 395472 transitions. Word has length 88 [2022-02-10 21:40:38,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:40:38,881 INFO L470 AbstractCegarLoop]: Abstraction has 90573 states and 395472 transitions. [2022-02-10 21:40:38,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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-02-10 21:40:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 90573 states and 395472 transitions. [2022-02-10 21:40:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-10 21:40:39,073 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:40:39,073 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:40:39,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:40:39,074 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:40:39,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:40:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash 496417655, now seen corresponding path program 1 times [2022-02-10 21:40:39,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:40:39,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649040507] [2022-02-10 21:40:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:40:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:40:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:40:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:40:39,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:40:39,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649040507] [2022-02-10 21:40:39,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649040507] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:40:39,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:40:39,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:40:39,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517167069] [2022-02-10 21:40:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:40:39,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:40:39,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:40:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:40:39,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:40:39,216 INFO L87 Difference]: Start difference. First operand 90573 states and 395472 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-02-10 21:40:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:40:41,155 INFO L93 Difference]: Finished difference Result 103917 states and 451676 transitions. [2022-02-10 21:40:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:40:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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 89 [2022-02-10 21:40:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:40:41,925 INFO L225 Difference]: With dead ends: 103917 [2022-02-10 21:40:41,926 INFO L226 Difference]: Without dead ends: 88557 [2022-02-10 21:40:41,926 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:40:41,927 INFO L934 BasicCegarLoop]: 161 mSDtfsCounter, 157 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:40:41,927 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 666 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:40:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88557 states. [2022-02-10 21:40:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88557 to 88557. [2022-02-10 21:40:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88557 states, 88556 states have (on average 4.358597949320204) internal successors, (385980), 88556 states have internal predecessors, (385980), 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-02-10 21:40:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88557 states to 88557 states and 385980 transitions. [2022-02-10 21:40:47,289 INFO L78 Accepts]: Start accepts. Automaton has 88557 states and 385980 transitions. Word has length 89 [2022-02-10 21:40:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:40:47,291 INFO L470 AbstractCegarLoop]: Abstraction has 88557 states and 385980 transitions. [2022-02-10 21:40:47,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-02-10 21:40:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 88557 states and 385980 transitions. [2022-02-10 21:40:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-10 21:40:47,622 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:40:47,622 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:40:47,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 21:40:47,622 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:40:47,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:40:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1308977674, now seen corresponding path program 1 times [2022-02-10 21:40:47,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:40:47,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617412778] [2022-02-10 21:40:47,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:40:47,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:40:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:40:47,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-02-10 21:40:47,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:40:47,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617412778] [2022-02-10 21:40:47,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617412778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:40:47,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:40:47,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:40:47,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509665891] [2022-02-10 21:40:47,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:40:47,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:40:47,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:40:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:40:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:40:47,890 INFO L87 Difference]: Start difference. First operand 88557 states and 385980 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-02-10 21:40:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:40:49,739 INFO L93 Difference]: Finished difference Result 109005 states and 468020 transitions. [2022-02-10 21:40:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:40:49,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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 91 [2022-02-10 21:40:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:40:50,895 INFO L225 Difference]: With dead ends: 109005 [2022-02-10 21:40:50,895 INFO L226 Difference]: Without dead ends: 79490 [2022-02-10 21:40:50,896 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:40:50,896 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 223 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:40:50,897 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 513 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:40:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79490 states. [2022-02-10 21:40:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79490 to 79490. [2022-02-10 21:40:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79490 states, 79489 states have (on average 4.286240863515706) internal successors, (340709), 79489 states have internal predecessors, (340709), 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-02-10 21:40:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79490 states to 79490 states and 340709 transitions. [2022-02-10 21:40:54,398 INFO L78 Accepts]: Start accepts. Automaton has 79490 states and 340709 transitions. Word has length 91 [2022-02-10 21:40:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:40:54,399 INFO L470 AbstractCegarLoop]: Abstraction has 79490 states and 340709 transitions. [2022-02-10 21:40:54,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-02-10 21:40:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 79490 states and 340709 transitions. [2022-02-10 21:40:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-10 21:40:54,594 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:40:54,594 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:40:54,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:40:54,595 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:40:54,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:40:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash -143717858, now seen corresponding path program 1 times [2022-02-10 21:40:54,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:40:54,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124699302] [2022-02-10 21:40:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:40:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:40:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:40:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:40:55,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:40:55,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124699302] [2022-02-10 21:40:55,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124699302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:40:55,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:40:55,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:40:55,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659445214] [2022-02-10 21:40:55,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:40:55,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:40:55,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:40:55,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:40:55,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:40:55,235 INFO L87 Difference]: Start difference. First operand 79490 states and 340709 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-02-10 21:40:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:40:56,732 INFO L93 Difference]: Finished difference Result 124415 states and 528195 transitions. [2022-02-10 21:40:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:40:56,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 94 [2022-02-10 21:40:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:40:57,660 INFO L225 Difference]: With dead ends: 124415 [2022-02-10 21:40:57,660 INFO L226 Difference]: Without dead ends: 76682 [2022-02-10 21:40:57,660 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:40:57,661 INFO L934 BasicCegarLoop]: 201 mSDtfsCounter, 164 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:40:57,662 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 835 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:40:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76682 states. [2022-02-10 21:40:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76682 to 63377. [2022-02-10 21:41:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63377 states, 63376 states have (on average 4.22109315829336) internal successors, (267516), 63376 states have internal predecessors, (267516), 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-02-10 21:41:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63377 states to 63377 states and 267516 transitions. [2022-02-10 21:41:00,758 INFO L78 Accepts]: Start accepts. Automaton has 63377 states and 267516 transitions. Word has length 94 [2022-02-10 21:41:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:00,758 INFO L470 AbstractCegarLoop]: Abstraction has 63377 states and 267516 transitions. [2022-02-10 21:41:00,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-02-10 21:41:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 63377 states and 267516 transitions. [2022-02-10 21:41:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-10 21:41:00,952 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:00,952 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:00,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:41:00,955 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1307072946, now seen corresponding path program 1 times [2022-02-10 21:41:00,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:00,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866154009] [2022-02-10 21:41:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:01,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:01,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866154009] [2022-02-10 21:41:01,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866154009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:01,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:01,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:41:01,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802863825] [2022-02-10 21:41:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:01,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:41:01,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:41:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:41:01,083 INFO L87 Difference]: Start difference. First operand 63377 states and 267516 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-02-10 21:41:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:02,237 INFO L93 Difference]: Finished difference Result 63827 states and 262515 transitions. [2022-02-10 21:41:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:41:02,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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 94 [2022-02-10 21:41:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:02,447 INFO L225 Difference]: With dead ends: 63827 [2022-02-10 21:41:02,447 INFO L226 Difference]: Without dead ends: 44537 [2022-02-10 21:41:02,447 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-10 21:41:02,448 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 383 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:02,449 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 603 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:41:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44537 states. [2022-02-10 21:41:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44537 to 44537. [2022-02-10 21:41:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44537 states, 44536 states have (on average 4.066552901023891) internal successors, (181108), 44536 states have internal predecessors, (181108), 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-02-10 21:41:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44537 states to 44537 states and 181108 transitions. [2022-02-10 21:41:04,377 INFO L78 Accepts]: Start accepts. Automaton has 44537 states and 181108 transitions. Word has length 94 [2022-02-10 21:41:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:04,377 INFO L470 AbstractCegarLoop]: Abstraction has 44537 states and 181108 transitions. [2022-02-10 21:41:04,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-02-10 21:41:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 44537 states and 181108 transitions. [2022-02-10 21:41:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-10 21:41:04,475 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:04,475 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:04,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:41:04,476 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1106227219, now seen corresponding path program 1 times [2022-02-10 21:41:04,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:04,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113254645] [2022-02-10 21:41:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:04,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:04,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113254645] [2022-02-10 21:41:04,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113254645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:04,729 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:04,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-10 21:41:04,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189795492] [2022-02-10 21:41:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:04,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-10 21:41:04,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:04,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-10 21:41:04,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-10 21:41:04,730 INFO L87 Difference]: Start difference. First operand 44537 states and 181108 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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-02-10 21:41:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:05,749 INFO L93 Difference]: Finished difference Result 37400 states and 148561 transitions. [2022-02-10 21:41:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:41:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2022-02-10 21:41:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:05,852 INFO L225 Difference]: With dead ends: 37400 [2022-02-10 21:41:05,853 INFO L226 Difference]: Without dead ends: 26735 [2022-02-10 21:41:05,853 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:41:05,853 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 489 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:05,854 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 628 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:41:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26735 states. [2022-02-10 21:41:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26735 to 26735. [2022-02-10 21:41:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26735 states, 26734 states have (on average 3.926610308969851) internal successors, (104974), 26734 states have internal predecessors, (104974), 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-02-10 21:41:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26735 states to 26735 states and 104974 transitions. [2022-02-10 21:41:06,876 INFO L78 Accepts]: Start accepts. Automaton has 26735 states and 104974 transitions. Word has length 97 [2022-02-10 21:41:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:06,877 INFO L470 AbstractCegarLoop]: Abstraction has 26735 states and 104974 transitions. [2022-02-10 21:41:06,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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-02-10 21:41:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 26735 states and 104974 transitions. [2022-02-10 21:41:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-10 21:41:06,947 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:06,962 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:06,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:41:06,963 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:06,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1446930362, now seen corresponding path program 1 times [2022-02-10 21:41:06,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:06,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895175999] [2022-02-10 21:41:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:07,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:07,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895175999] [2022-02-10 21:41:07,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895175999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:07,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:07,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-10 21:41:07,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486417797] [2022-02-10 21:41:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:07,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 21:41:07,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:07,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 21:41:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:41:07,535 INFO L87 Difference]: Start difference. First operand 26735 states and 104974 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-02-10 21:41:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:09,411 INFO L93 Difference]: Finished difference Result 58482 states and 227713 transitions. [2022-02-10 21:41:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 21:41:09,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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 102 [2022-02-10 21:41:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:09,655 INFO L225 Difference]: With dead ends: 58482 [2022-02-10 21:41:09,655 INFO L226 Difference]: Without dead ends: 51987 [2022-02-10 21:41:09,656 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2022-02-10 21:41:09,656 INFO L934 BasicCegarLoop]: 272 mSDtfsCounter, 702 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:09,656 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [702 Valid, 1840 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 21:41:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51987 states. [2022-02-10 21:41:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51987 to 33879. [2022-02-10 21:41:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33879 states, 33878 states have (on average 3.9081114587637997) internal successors, (132399), 33878 states have internal predecessors, (132399), 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-02-10 21:41:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33879 states to 33879 states and 132399 transitions. [2022-02-10 21:41:11,281 INFO L78 Accepts]: Start accepts. Automaton has 33879 states and 132399 transitions. Word has length 102 [2022-02-10 21:41:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:11,281 INFO L470 AbstractCegarLoop]: Abstraction has 33879 states and 132399 transitions. [2022-02-10 21:41:11,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-02-10 21:41:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 33879 states and 132399 transitions. [2022-02-10 21:41:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-10 21:41:11,358 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:11,358 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:11,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 21:41:11,359 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:11,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash -227545110, now seen corresponding path program 2 times [2022-02-10 21:41:11,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:11,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263402146] [2022-02-10 21:41:11,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:11,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:11,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263402146] [2022-02-10 21:41:11,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263402146] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:11,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:11,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 21:41:11,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798192557] [2022-02-10 21:41:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:11,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 21:41:11,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 21:41:11,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-10 21:41:11,586 INFO L87 Difference]: Start difference. First operand 33879 states and 132399 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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-02-10 21:41:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:12,794 INFO L93 Difference]: Finished difference Result 57094 states and 223197 transitions. [2022-02-10 21:41:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 21:41:12,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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 102 [2022-02-10 21:41:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:13,053 INFO L225 Difference]: With dead ends: 57094 [2022-02-10 21:41:13,053 INFO L226 Difference]: Without dead ends: 45604 [2022-02-10 21:41:13,053 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:41:13,054 INFO L934 BasicCegarLoop]: 303 mSDtfsCounter, 310 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:13,054 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 1881 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 21:41:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45604 states. [2022-02-10 21:41:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45604 to 34551. [2022-02-10 21:41:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34551 states, 34550 states have (on average 3.896931982633864) internal successors, (134639), 34550 states have internal predecessors, (134639), 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-02-10 21:41:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34551 states to 34551 states and 134639 transitions. [2022-02-10 21:41:14,676 INFO L78 Accepts]: Start accepts. Automaton has 34551 states and 134639 transitions. Word has length 102 [2022-02-10 21:41:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:14,676 INFO L470 AbstractCegarLoop]: Abstraction has 34551 states and 134639 transitions. [2022-02-10 21:41:14,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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-02-10 21:41:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 34551 states and 134639 transitions. [2022-02-10 21:41:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-10 21:41:14,767 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:14,767 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:14,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 21:41:14,768 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 180704028, now seen corresponding path program 3 times [2022-02-10 21:41:14,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:14,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169674887] [2022-02-10 21:41:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:14,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:14,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169674887] [2022-02-10 21:41:14,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169674887] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:14,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:14,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 21:41:14,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440107148] [2022-02-10 21:41:14,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:14,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 21:41:14,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:14,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 21:41:14,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-10 21:41:14,964 INFO L87 Difference]: Start difference. First operand 34551 states and 134639 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 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-02-10 21:41:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:15,906 INFO L93 Difference]: Finished difference Result 54423 states and 211939 transitions. [2022-02-10 21:41:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:41:15,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 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 102 [2022-02-10 21:41:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:16,129 INFO L225 Difference]: With dead ends: 54423 [2022-02-10 21:41:16,130 INFO L226 Difference]: Without dead ends: 47910 [2022-02-10 21:41:16,130 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-02-10 21:41:16,130 INFO L934 BasicCegarLoop]: 283 mSDtfsCounter, 297 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:16,131 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 1697 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:41:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47910 states. [2022-02-10 21:41:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47910 to 36827. [2022-02-10 21:41:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36827 states, 36826 states have (on average 3.879161462010536) internal successors, (142854), 36826 states have internal predecessors, (142854), 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-02-10 21:41:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36827 states to 36827 states and 142854 transitions. [2022-02-10 21:41:17,443 INFO L78 Accepts]: Start accepts. Automaton has 36827 states and 142854 transitions. Word has length 102 [2022-02-10 21:41:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:17,443 INFO L470 AbstractCegarLoop]: Abstraction has 36827 states and 142854 transitions. [2022-02-10 21:41:17,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 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-02-10 21:41:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 36827 states and 142854 transitions. [2022-02-10 21:41:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-10 21:41:17,855 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:17,855 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:17,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-10 21:41:17,855 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1866718458, now seen corresponding path program 4 times [2022-02-10 21:41:17,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:17,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249994885] [2022-02-10 21:41:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:18,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:18,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249994885] [2022-02-10 21:41:18,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249994885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:18,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:18,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 21:41:18,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134630891] [2022-02-10 21:41:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:18,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 21:41:18,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 21:41:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-10 21:41:18,058 INFO L87 Difference]: Start difference. First operand 36827 states and 142854 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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-02-10 21:41:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:18,570 INFO L93 Difference]: Finished difference Result 31643 states and 121983 transitions. [2022-02-10 21:41:18,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 21:41:18,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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 102 [2022-02-10 21:41:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:18,630 INFO L225 Difference]: With dead ends: 31643 [2022-02-10 21:41:18,630 INFO L226 Difference]: Without dead ends: 17733 [2022-02-10 21:41:18,630 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-02-10 21:41:18,631 INFO L934 BasicCegarLoop]: 133 mSDtfsCounter, 629 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:18,631 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 652 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:41:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17733 states. [2022-02-10 21:41:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17733 to 16773. [2022-02-10 21:41:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16773 states, 16772 states have (on average 3.785356546625328) internal successors, (63488), 16772 states have internal predecessors, (63488), 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-02-10 21:41:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16773 states to 16773 states and 63488 transitions. [2022-02-10 21:41:19,302 INFO L78 Accepts]: Start accepts. Automaton has 16773 states and 63488 transitions. Word has length 102 [2022-02-10 21:41:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:19,302 INFO L470 AbstractCegarLoop]: Abstraction has 16773 states and 63488 transitions. [2022-02-10 21:41:19,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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-02-10 21:41:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 16773 states and 63488 transitions. [2022-02-10 21:41:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-10 21:41:19,336 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:19,337 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:19,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-10 21:41:19,337 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:19,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash 390220076, now seen corresponding path program 1 times [2022-02-10 21:41:19,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:19,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437813857] [2022-02-10 21:41:19,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:19,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:19,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:19,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437813857] [2022-02-10 21:41:19,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437813857] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:19,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:19,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-10 21:41:19,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398614054] [2022-02-10 21:41:19,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:19,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 21:41:19,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:19,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 21:41:19,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:41:19,589 INFO L87 Difference]: Start difference. First operand 16773 states and 63488 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 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-02-10 21:41:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:19,973 INFO L93 Difference]: Finished difference Result 19746 states and 74725 transitions. [2022-02-10 21:41:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:41:19,974 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 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 107 [2022-02-10 21:41:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:20,029 INFO L225 Difference]: With dead ends: 19746 [2022-02-10 21:41:20,029 INFO L226 Difference]: Without dead ends: 15633 [2022-02-10 21:41:20,029 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-02-10 21:41:20,030 INFO L934 BasicCegarLoop]: 210 mSDtfsCounter, 252 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:20,030 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 1316 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:41:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15633 states. [2022-02-10 21:41:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15633 to 15633. [2022-02-10 21:41:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15633 states, 15632 states have (on average 3.767911975435005) internal successors, (58900), 15632 states have internal predecessors, (58900), 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-02-10 21:41:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15633 states to 15633 states and 58900 transitions. [2022-02-10 21:41:20,563 INFO L78 Accepts]: Start accepts. Automaton has 15633 states and 58900 transitions. Word has length 107 [2022-02-10 21:41:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:20,563 INFO L470 AbstractCegarLoop]: Abstraction has 15633 states and 58900 transitions. [2022-02-10 21:41:20,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 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-02-10 21:41:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 15633 states and 58900 transitions. [2022-02-10 21:41:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-10 21:41:20,598 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:20,598 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:20,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-10 21:41:20,598 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash 728274382, now seen corresponding path program 2 times [2022-02-10 21:41:20,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:20,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761385031] [2022-02-10 21:41:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:20,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:20,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761385031] [2022-02-10 21:41:20,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761385031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:20,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:20,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-10 21:41:20,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138142469] [2022-02-10 21:41:20,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:20,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-10 21:41:20,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:20,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-10 21:41:20,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-10 21:41:20,749 INFO L87 Difference]: Start difference. First operand 15633 states and 58900 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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-02-10 21:41:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:21,174 INFO L93 Difference]: Finished difference Result 24126 states and 91251 transitions. [2022-02-10 21:41:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:41:21,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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 107 [2022-02-10 21:41:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:21,491 INFO L225 Difference]: With dead ends: 24126 [2022-02-10 21:41:21,492 INFO L226 Difference]: Without dead ends: 11177 [2022-02-10 21:41:21,492 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-02-10 21:41:21,504 INFO L934 BasicCegarLoop]: 179 mSDtfsCounter, 197 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:21,504 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 970 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:41:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2022-02-10 21:41:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 10817. [2022-02-10 21:41:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10817 states, 10816 states have (on average 3.7078402366863905) internal successors, (40104), 10816 states have internal predecessors, (40104), 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-02-10 21:41:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10817 states to 10817 states and 40104 transitions. [2022-02-10 21:41:21,837 INFO L78 Accepts]: Start accepts. Automaton has 10817 states and 40104 transitions. Word has length 107 [2022-02-10 21:41:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:21,838 INFO L470 AbstractCegarLoop]: Abstraction has 10817 states and 40104 transitions. [2022-02-10 21:41:21,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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-02-10 21:41:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 10817 states and 40104 transitions. [2022-02-10 21:41:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-10 21:41:21,866 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:21,866 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:21,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-10 21:41:21,866 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 670192770, now seen corresponding path program 3 times [2022-02-10 21:41:21,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:21,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54915415] [2022-02-10 21:41:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:22,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:22,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54915415] [2022-02-10 21:41:22,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54915415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:22,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:22,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 21:41:22,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703130887] [2022-02-10 21:41:22,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:22,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 21:41:22,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:22,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 21:41:22,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-10 21:41:22,092 INFO L87 Difference]: Start difference. First operand 10817 states and 40104 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 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-02-10 21:41:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:22,398 INFO L93 Difference]: Finished difference Result 15800 states and 59344 transitions. [2022-02-10 21:41:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:41:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 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 107 [2022-02-10 21:41:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:22,430 INFO L225 Difference]: With dead ends: 15800 [2022-02-10 21:41:22,430 INFO L226 Difference]: Without dead ends: 10979 [2022-02-10 21:41:22,431 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:41:22,431 INFO L934 BasicCegarLoop]: 205 mSDtfsCounter, 219 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:22,431 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 1435 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:41:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10979 states. [2022-02-10 21:41:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10979 to 8969. [2022-02-10 21:41:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8968 states have (on average 3.74085637823372) internal successors, (33548), 8968 states have internal predecessors, (33548), 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-02-10 21:41:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 33548 transitions. [2022-02-10 21:41:22,843 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 33548 transitions. Word has length 107 [2022-02-10 21:41:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:22,843 INFO L470 AbstractCegarLoop]: Abstraction has 8969 states and 33548 transitions. [2022-02-10 21:41:22,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 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-02-10 21:41:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 33548 transitions. [2022-02-10 21:41:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-10 21:41:22,862 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:22,862 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:22,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-10 21:41:22,863 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:22,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:22,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1187020608, now seen corresponding path program 4 times [2022-02-10 21:41:22,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:22,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147539741] [2022-02-10 21:41:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:41:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:41:23,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:41:23,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147539741] [2022-02-10 21:41:23,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147539741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:41:23,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:41:23,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-10 21:41:23,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102855738] [2022-02-10 21:41:23,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:41:23,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-10 21:41:23,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:41:23,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-10 21:41:23,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-10 21:41:23,153 INFO L87 Difference]: Start difference. First operand 8969 states and 33548 transitions. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 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-02-10 21:41:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:41:23,627 INFO L93 Difference]: Finished difference Result 15909 states and 59657 transitions. [2022-02-10 21:41:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 21:41:23,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 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 107 [2022-02-10 21:41:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:41:23,682 INFO L225 Difference]: With dead ends: 15909 [2022-02-10 21:41:23,682 INFO L226 Difference]: Without dead ends: 12680 [2022-02-10 21:41:23,682 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-02-10 21:41:23,683 INFO L934 BasicCegarLoop]: 212 mSDtfsCounter, 502 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:41:23,683 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 1280 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:41:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12680 states. [2022-02-10 21:41:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12680 to 8969. [2022-02-10 21:41:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8968 states have (on average 3.706958073148974) internal successors, (33244), 8968 states have internal predecessors, (33244), 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-02-10 21:41:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 33244 transitions. [2022-02-10 21:41:24,155 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 33244 transitions. Word has length 107 [2022-02-10 21:41:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:41:24,156 INFO L470 AbstractCegarLoop]: Abstraction has 8969 states and 33244 transitions. [2022-02-10 21:41:24,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 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-02-10 21:41:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 33244 transitions. [2022-02-10 21:41:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-10 21:41:24,178 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:41:24,178 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:24,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-10 21:41:24,178 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:41:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:41:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash 498993822, now seen corresponding path program 5 times [2022-02-10 21:41:24,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:41:24,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876738281] [2022-02-10 21:41:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:41:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:41:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:41:24,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 21:41:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:41:24,361 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 21:41:24,361 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 21:41:24,362 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-02-10 21:41:24,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-02-10 21:41:24,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-02-10 21:41:24,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-02-10 21:41:24,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-02-10 21:41:24,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-02-10 21:41:24,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-02-10 21:41:24,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-10 21:41:24,368 INFO L733 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:41:24,373 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 21:41:24,373 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 21:41:24,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 09:41:24 BasicIcfg [2022-02-10 21:41:24,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 21:41:24,548 INFO L158 Benchmark]: Toolchain (without parser) took 97103.89ms. Allocated memory was 242.2MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 184.1MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-02-10 21:41:24,548 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 242.2MB. Free memory was 202.3MB in the beginning and 202.2MB in the end (delta: 70.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 21:41:24,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 917.64ms. Allocated memory was 242.2MB in the beginning and 310.4MB in the end (delta: 68.2MB). Free memory was 183.9MB in the beginning and 266.3MB in the end (delta: -82.4MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2022-02-10 21:41:24,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.29ms. Allocated memory is still 310.4MB. Free memory was 266.3MB in the beginning and 263.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 21:41:24,549 INFO L158 Benchmark]: Boogie Preprocessor took 65.41ms. Allocated memory is still 310.4MB. Free memory was 263.7MB in the beginning and 261.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 21:41:24,549 INFO L158 Benchmark]: RCFGBuilder took 1441.52ms. Allocated memory is still 310.4MB. Free memory was 261.6MB in the beginning and 173.5MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. [2022-02-10 21:41:24,552 INFO L158 Benchmark]: TraceAbstraction took 94549.88ms. Allocated memory was 310.4MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 173.0MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-02-10 21:41:24,555 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.13ms. Allocated memory is still 242.2MB. Free memory was 202.3MB in the beginning and 202.2MB in the end (delta: 70.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 917.64ms. Allocated memory was 242.2MB in the beginning and 310.4MB in the end (delta: 68.2MB). Free memory was 183.9MB in the beginning and 266.3MB in the end (delta: -82.4MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 107.29ms. Allocated memory is still 310.4MB. Free memory was 266.3MB in the beginning and 263.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.41ms. Allocated memory is still 310.4MB. Free memory was 263.7MB in the beginning and 261.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1441.52ms. Allocated memory is still 310.4MB. Free memory was 261.6MB in the beginning and 173.5MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. * TraceAbstraction took 94549.88ms. Allocated memory was 310.4MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 173.0MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L721] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0] [L722] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L723] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L724] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L725] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L726] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L727] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L728] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L729] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L730] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L731] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L732] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L733] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L734] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L735] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L736] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L737] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L738] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L739] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L740] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L742] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t465; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t465={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t465, ((void *)0), P0, ((void *)0))=-3, t465={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t466; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t465={5:0}, t466={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t466, ((void *)0), P1, ((void *)0))=-2, t465={5:0}, t466={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L870] 0 pthread_t t467; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t467, ((void *)0), P2, ((void *)0))=-1, t465={5:0}, t466={6:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L872] 0 pthread_t t468; VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t468, ((void *)0), P3, ((void *)0))=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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: 873]: 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: 867]: 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: 871]: 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: 869]: 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: 94.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 2.6s, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5072 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5072 mSDsluCounter, 16055 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14207 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3161 IncrementalHoareTripleChecker+Invalid, 3417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 3079 mSDtfsCounter, 3161 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129063occurred in iteration=0, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 105370 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1632 NumberOfCodeBlocks, 1632 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1509 ConstructedInterpolants, 0 QuantifiedInterpolants, 9646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-02-10 21:41:24,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...