/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/mix002.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 21:37:29,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:37:29,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:37:29,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:37:29,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:37:29,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:37:29,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:37:29,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:37:29,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:37:29,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:37:29,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:37:29,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:37:29,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:37:29,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:37:29,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:37:29,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:37:29,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:37:29,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:37:29,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:37:29,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:37:29,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:37:29,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:37:29,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:37:29,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:37:29,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:37:29,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:37:29,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:37:29,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:37:29,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:37:29,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:37:29,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:37:29,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:37:29,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:37:29,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:37:29,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:37:29,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:37:29,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:37:29,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:37:29,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:37:29,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:37:29,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:37:29,975 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:37:30,004 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:37:30,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:37:30,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:37:30,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:37:30,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:37:30,006 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:37:30,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:37:30,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:37:30,007 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:37:30,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:37:30,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:37:30,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:37:30,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:37:30,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:37:30,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:37:30,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:37:30,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:37:30,009 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:37:30,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:37:30,009 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:37:30,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:37:30,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:37:30,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:37:30,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:37:30,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:37:30,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:37:30,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:37:30,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:37:30,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:37:30,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:37:30,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:37:30,012 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:37:30,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:37:30,013 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:37:30,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:37:30,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:37:30,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:37:30,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:37:30,241 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:37:30,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-02-10 21:37:30,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c616e9eb/6fe67e32515846799ea9e3e295471c60/FLAG20fb7a813 [2022-02-10 21:37:30,717 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:37:30,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-02-10 21:37:30,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c616e9eb/6fe67e32515846799ea9e3e295471c60/FLAG20fb7a813 [2022-02-10 21:37:30,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c616e9eb/6fe67e32515846799ea9e3e295471c60 [2022-02-10 21:37:30,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:37:30,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:37:30,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:37:30,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:37:30,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:37:30,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:37:30" (1/1) ... [2022-02-10 21:37:30,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325a7ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:30, skipping insertion in model container [2022-02-10 21:37:30,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:37:30" (1/1) ... [2022-02-10 21:37:30,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:37:30,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:37:30,954 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/mix002.oepc.i[945,958] [2022-02-10 21:37:31,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:37:31,156 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:37:31,170 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/mix002.oepc.i[945,958] [2022-02-10 21:37:31,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:37:31,270 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:37:31,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31 WrapperNode [2022-02-10 21:37:31,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:37:31,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:37:31,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:37:31,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:37:31,278 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:37:31" (1/1) ... [2022-02-10 21:37:31,311 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:37:31" (1/1) ... [2022-02-10 21:37:31,347 INFO L137 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 187 [2022-02-10 21:37:31,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:37:31,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:37:31,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:37:31,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:37:31,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31" (1/1) ... [2022-02-10 21:37:31,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31" (1/1) ... [2022-02-10 21:37:31,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31" (1/1) ... [2022-02-10 21:37:31,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31" (1/1) ... [2022-02-10 21:37:31,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31" (1/1) ... [2022-02-10 21:37:31,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31" (1/1) ... [2022-02-10 21:37:31,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31" (1/1) ... [2022-02-10 21:37:31,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:37:31,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:37:31,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:37:31,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:37:31,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31" (1/1) ... [2022-02-10 21:37:31,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:37:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:37:31,445 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:37:31,456 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:37:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:37:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 21:37:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:37:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:37:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:37:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-10 21:37:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-10 21:37:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-10 21:37:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-10 21:37:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-10 21:37:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-10 21:37:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:37:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 21:37:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:37:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:37:31,489 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:37:31,595 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:37:31,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:37:32,083 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:37:32,383 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:37:32,383 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 21:37:32,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:37:32 BoogieIcfgContainer [2022-02-10 21:37:32,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:37:32,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:37:32,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:37:32,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:37:32,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:37:30" (1/3) ... [2022-02-10 21:37:32,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cee4827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:37:32, skipping insertion in model container [2022-02-10 21:37:32,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:37:31" (2/3) ... [2022-02-10 21:37:32,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cee4827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:37:32, skipping insertion in model container [2022-02-10 21:37:32,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:37:32" (3/3) ... [2022-02-10 21:37:32,393 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-02-10 21:37:32,398 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:37:32,398 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:37:32,398 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-10 21:37:32,398 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:37:32,444 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,444 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,444 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,444 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,445 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,445 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,445 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,445 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,445 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:37:32,445 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,446 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:37:32,446 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,446 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:37:32,447 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,447 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:37:32,447 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,448 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,448 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,448 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,448 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,448 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,449 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,449 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,449 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,450 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,450 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,450 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,450 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,450 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,450 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,451 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,451 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,451 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,451 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,451 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,452 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,452 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,452 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,452 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,452 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,452 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,452 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,452 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,453 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,453 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,453 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,453 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,453 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,453 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,454 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,454 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,454 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,454 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,454 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,454 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,454 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,455 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,455 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,455 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,455 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,456 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,456 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,457 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,457 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,457 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,457 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,457 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,457 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,457 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,458 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,458 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,458 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,458 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,458 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,458 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,458 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,459 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,459 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,459 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,459 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,459 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,459 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,459 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,459 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,460 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,461 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,461 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,461 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,462 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,463 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,463 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,463 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,464 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,467 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,468 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,468 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,468 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,468 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,468 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,468 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,469 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,469 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,469 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,469 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,469 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,469 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,469 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,469 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,469 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,470 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,471 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,472 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,472 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,474 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,474 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,475 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,475 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,475 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,475 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,475 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,475 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,476 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,476 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,476 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,476 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,476 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,476 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,477 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,477 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,477 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,477 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,480 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,480 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,480 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,480 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,480 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,480 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,480 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,481 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,481 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,481 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,482 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,482 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,482 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,483 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,483 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,483 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,483 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,483 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,483 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,483 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,483 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,483 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,484 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,484 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,484 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,484 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,484 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,484 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,484 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,485 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,485 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,485 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,485 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,485 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,485 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,485 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,485 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,485 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,486 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,486 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,486 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,486 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,486 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,487 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,487 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,487 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,487 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,487 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,487 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,487 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:37:32,487 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,488 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,488 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,489 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,491 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:37:32,495 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 21:37:32,538 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:37:32,544 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:37:32,544 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-10 21:37:32,554 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 124 transitions, 263 flow [2022-02-10 21:37:33,250 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 20906 states, 20903 states have (on average 3.6201980576950676) internal successors, (75673), 20905 states have internal predecessors, (75673), 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:37:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 20906 states, 20903 states have (on average 3.6201980576950676) internal successors, (75673), 20905 states have internal predecessors, (75673), 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:37:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-10 21:37:33,306 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:33,306 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:37:33,307 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:33,387 INFO L85 PathProgramCache]: Analyzing trace with hash -109892917, now seen corresponding path program 1 times [2022-02-10 21:37:33,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:33,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847223001] [2022-02-10 21:37:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:33,699 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:37:33,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:33,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847223001] [2022-02-10 21:37:33,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847223001] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:33,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:33,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 21:37:33,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221334397] [2022-02-10 21:37:33,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:33,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:37:33,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:37:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:37:33,771 INFO L87 Difference]: Start difference. First operand has 20906 states, 20903 states have (on average 3.6201980576950676) internal successors, (75673), 20905 states have internal predecessors, (75673), 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:37:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:34,144 INFO L93 Difference]: Finished difference Result 18082 states and 64101 transitions. [2022-02-10 21:37:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:37:34,147 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:37:34,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:34,418 INFO L225 Difference]: With dead ends: 18082 [2022-02-10 21:37:34,418 INFO L226 Difference]: Without dead ends: 15328 [2022-02-10 21:37:34,420 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:37:34,425 INFO L934 BasicCegarLoop]: 108 mSDtfsCounter, 56 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:34,427 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 185 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 21:37:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15328 states. [2022-02-10 21:37:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15328 to 15328. [2022-02-10 21:37:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15328 states, 15327 states have (on average 3.572127617929145) internal successors, (54750), 15327 states have internal predecessors, (54750), 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:37:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 54750 transitions. [2022-02-10 21:37:35,143 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 54750 transitions. Word has length 50 [2022-02-10 21:37:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:35,144 INFO L470 AbstractCegarLoop]: Abstraction has 15328 states and 54750 transitions. [2022-02-10 21:37:35,144 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:37:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 54750 transitions. [2022-02-10 21:37:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-10 21:37:35,266 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:35,267 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] [2022-02-10 21:37:35,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:37:35,295 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:35,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1185702391, now seen corresponding path program 1 times [2022-02-10 21:37:35,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:35,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255268099] [2022-02-10 21:37:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:35,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:35,656 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:37:35,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:35,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255268099] [2022-02-10 21:37:35,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255268099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:35,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:35,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:37:35,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230846433] [2022-02-10 21:37:35,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:35,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:37:35,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:37:35,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:37:35,664 INFO L87 Difference]: Start difference. First operand 15328 states and 54750 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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:37:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:36,196 INFO L93 Difference]: Finished difference Result 17488 states and 61944 transitions. [2022-02-10 21:37:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:37:36,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 79 [2022-02-10 21:37:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:36,346 INFO L225 Difference]: With dead ends: 17488 [2022-02-10 21:37:36,346 INFO L226 Difference]: Without dead ends: 13438 [2022-02-10 21:37:36,350 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-10 21:37:36,351 INFO L934 BasicCegarLoop]: 152 mSDtfsCounter, 218 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:36,351 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 672 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 21:37:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13438 states. [2022-02-10 21:37:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13438 to 13438. [2022-02-10 21:37:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13438 states, 13437 states have (on average 3.5416387586514846) internal successors, (47589), 13437 states have internal predecessors, (47589), 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:37:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13438 states to 13438 states and 47589 transitions. [2022-02-10 21:37:36,933 INFO L78 Accepts]: Start accepts. Automaton has 13438 states and 47589 transitions. Word has length 79 [2022-02-10 21:37:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:36,940 INFO L470 AbstractCegarLoop]: Abstraction has 13438 states and 47589 transitions. [2022-02-10 21:37:36,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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:37:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 13438 states and 47589 transitions. [2022-02-10 21:37:36,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-10 21:37:36,971 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:36,972 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] [2022-02-10 21:37:36,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:37:36,972 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash 796594309, now seen corresponding path program 1 times [2022-02-10 21:37:36,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:36,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238274754] [2022-02-10 21:37:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:36,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:37,155 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:37:37,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:37,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238274754] [2022-02-10 21:37:37,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238274754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:37,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:37,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:37:37,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808804726] [2022-02-10 21:37:37,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:37,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:37:37,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:37:37,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:37:37,159 INFO L87 Difference]: Start difference. First operand 13438 states and 47589 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:37:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:37,625 INFO L93 Difference]: Finished difference Result 14878 states and 52305 transitions. [2022-02-10 21:37:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:37:37,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 82 [2022-02-10 21:37:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:37,688 INFO L225 Difference]: With dead ends: 14878 [2022-02-10 21:37:37,688 INFO L226 Difference]: Without dead ends: 12178 [2022-02-10 21:37:37,689 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-10 21:37:37,690 INFO L934 BasicCegarLoop]: 143 mSDtfsCounter, 198 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:37,690 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 621 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:37:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12178 states. [2022-02-10 21:37:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12178 to 12178. [2022-02-10 21:37:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12178 states, 12177 states have (on average 3.5218033998521805) internal successors, (42885), 12177 states have internal predecessors, (42885), 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:37:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 42885 transitions. [2022-02-10 21:37:38,142 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 42885 transitions. Word has length 82 [2022-02-10 21:37:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:38,143 INFO L470 AbstractCegarLoop]: Abstraction has 12178 states and 42885 transitions. [2022-02-10 21:37:38,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:37:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 42885 transitions. [2022-02-10 21:37:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-10 21:37:38,170 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:38,171 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] [2022-02-10 21:37:38,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:37:38,171 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -977251445, now seen corresponding path program 1 times [2022-02-10 21:37:38,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:38,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72651287] [2022-02-10 21:37:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:38,300 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:37:38,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:38,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72651287] [2022-02-10 21:37:38,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72651287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:38,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:38,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:37:38,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286401659] [2022-02-10 21:37:38,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:38,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:37:38,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:38,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:37:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:37:38,302 INFO L87 Difference]: Start difference. First operand 12178 states and 42885 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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:37:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:38,768 INFO L93 Difference]: Finished difference Result 12970 states and 45393 transitions. [2022-02-10 21:37:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:37:38,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2022-02-10 21:37:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:38,846 INFO L225 Difference]: With dead ends: 12970 [2022-02-10 21:37:38,846 INFO L226 Difference]: Without dead ends: 11170 [2022-02-10 21:37:38,847 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-10 21:37:38,854 INFO L934 BasicCegarLoop]: 134 mSDtfsCounter, 181 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:38,857 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 608 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:37:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11170 states. [2022-02-10 21:37:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11170 to 11170. [2022-02-10 21:37:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11170 states, 11169 states have (on average 3.5087295192049424) internal successors, (39189), 11169 states have internal predecessors, (39189), 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:37:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11170 states to 11170 states and 39189 transitions. [2022-02-10 21:37:39,231 INFO L78 Accepts]: Start accepts. Automaton has 11170 states and 39189 transitions. Word has length 85 [2022-02-10 21:37:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:39,232 INFO L470 AbstractCegarLoop]: Abstraction has 11170 states and 39189 transitions. [2022-02-10 21:37:39,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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:37:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 11170 states and 39189 transitions. [2022-02-10 21:37:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-10 21:37:39,278 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:39,278 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:37:39,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 21:37:39,279 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash 811310204, now seen corresponding path program 1 times [2022-02-10 21:37:39,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:39,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878015692] [2022-02-10 21:37:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:39,418 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:37:39,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:39,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878015692] [2022-02-10 21:37:39,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878015692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:39,418 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:39,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:37:39,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356107703] [2022-02-10 21:37:39,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:39,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:37:39,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:39,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:37:39,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:37:39,420 INFO L87 Difference]: Start difference. First operand 11170 states and 39189 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:37:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:39,707 INFO L93 Difference]: Finished difference Result 13015 states and 44706 transitions. [2022-02-10 21:37:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:37:39,708 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:37:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:39,760 INFO L225 Difference]: With dead ends: 13015 [2022-02-10 21:37:39,760 INFO L226 Difference]: Without dead ends: 8965 [2022-02-10 21:37:39,760 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:37:39,761 INFO L934 BasicCegarLoop]: 123 mSDtfsCounter, 194 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:39,761 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 468 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:37:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2022-02-10 21:37:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8965. [2022-02-10 21:37:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8965 states, 8964 states have (on average 3.387884872824632) internal successors, (30369), 8964 states have internal predecessors, (30369), 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:37:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 30369 transitions. [2022-02-10 21:37:40,099 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 30369 transitions. Word has length 89 [2022-02-10 21:37:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:40,099 INFO L470 AbstractCegarLoop]: Abstraction has 8965 states and 30369 transitions. [2022-02-10 21:37:40,099 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:37:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 30369 transitions. [2022-02-10 21:37:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-10 21:37:40,120 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:40,121 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] [2022-02-10 21:37:40,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:37:40,121 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:40,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -782955321, now seen corresponding path program 1 times [2022-02-10 21:37:40,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:40,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202771286] [2022-02-10 21:37:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:40,246 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:37:40,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:40,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202771286] [2022-02-10 21:37:40,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202771286] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:40,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:40,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:37:40,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917081709] [2022-02-10 21:37:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:40,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:37:40,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:37:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:37:40,248 INFO L87 Difference]: Start difference. First operand 8965 states and 30369 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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:37:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:40,631 INFO L93 Difference]: Finished difference Result 8308 states and 27387 transitions. [2022-02-10 21:37:40,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:37:40,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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 92 [2022-02-10 21:37:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:40,652 INFO L225 Difference]: With dead ends: 8308 [2022-02-10 21:37:40,652 INFO L226 Difference]: Without dead ends: 5518 [2022-02-10 21:37:40,652 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:37:40,653 INFO L934 BasicCegarLoop]: 123 mSDtfsCounter, 336 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:40,653 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 525 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:37:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2022-02-10 21:37:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5518. [2022-02-10 21:37:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5518 states, 5517 states have (on average 3.2137030995106035) internal successors, (17730), 5517 states have internal predecessors, (17730), 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:37:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5518 states to 5518 states and 17730 transitions. [2022-02-10 21:37:40,775 INFO L78 Accepts]: Start accepts. Automaton has 5518 states and 17730 transitions. Word has length 92 [2022-02-10 21:37:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:40,775 INFO L470 AbstractCegarLoop]: Abstraction has 5518 states and 17730 transitions. [2022-02-10 21:37:40,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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:37:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5518 states and 17730 transitions. [2022-02-10 21:37:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-10 21:37:40,787 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:40,788 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] [2022-02-10 21:37:40,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:37:40,788 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1358807348, now seen corresponding path program 1 times [2022-02-10 21:37:40,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:40,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917437351] [2022-02-10 21:37:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:40,925 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:37:40,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:40,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917437351] [2022-02-10 21:37:40,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917437351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:40,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:40,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-10 21:37:40,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741581569] [2022-02-10 21:37:40,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:40,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-10 21:37:40,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:40,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-10 21:37:40,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-10 21:37:40,927 INFO L87 Difference]: Start difference. First operand 5518 states and 17730 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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:37:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:41,166 INFO L93 Difference]: Finished difference Result 4573 states and 14508 transitions. [2022-02-10 21:37:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:37:41,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 95 [2022-02-10 21:37:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:41,177 INFO L225 Difference]: With dead ends: 4573 [2022-02-10 21:37:41,178 INFO L226 Difference]: Without dead ends: 3583 [2022-02-10 21:37:41,178 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:37:41,179 INFO L934 BasicCegarLoop]: 123 mSDtfsCounter, 410 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:41,179 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 550 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:37:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2022-02-10 21:37:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3583. [2022-02-10 21:37:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 3582 states have (on average 3.1490787269681744) internal successors, (11280), 3582 states have internal predecessors, (11280), 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:37:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 11280 transitions. [2022-02-10 21:37:41,257 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 11280 transitions. Word has length 95 [2022-02-10 21:37:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:41,257 INFO L470 AbstractCegarLoop]: Abstraction has 3583 states and 11280 transitions. [2022-02-10 21:37:41,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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:37:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 11280 transitions. [2022-02-10 21:37:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-10 21:37:41,349 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:41,349 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] [2022-02-10 21:37:41,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:37:41,350 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:41,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:41,351 INFO L85 PathProgramCache]: Analyzing trace with hash -489256399, now seen corresponding path program 1 times [2022-02-10 21:37:41,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:41,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921696858] [2022-02-10 21:37:41,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:41,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:41,482 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:37:41,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:41,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921696858] [2022-02-10 21:37:41,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921696858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:41,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:41,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:37:41,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926528337] [2022-02-10 21:37:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:41,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:37:41,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:41,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:37:41,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:37:41,484 INFO L87 Difference]: Start difference. First operand 3583 states and 11280 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:37:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:41,644 INFO L93 Difference]: Finished difference Result 5124 states and 16020 transitions. [2022-02-10 21:37:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-10 21:37:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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 98 [2022-02-10 21:37:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:41,651 INFO L225 Difference]: With dead ends: 5124 [2022-02-10 21:37:41,651 INFO L226 Difference]: Without dead ends: 2393 [2022-02-10 21:37:41,651 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:37:41,652 INFO L934 BasicCegarLoop]: 147 mSDtfsCounter, 95 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:41,652 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 734 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:37:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-02-10 21:37:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2022-02-10 21:37:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2392 states have (on average 3.00376254180602) internal successors, (7185), 2392 states have internal predecessors, (7185), 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:37:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 7185 transitions. [2022-02-10 21:37:41,694 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 7185 transitions. Word has length 98 [2022-02-10 21:37:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:41,695 INFO L470 AbstractCegarLoop]: Abstraction has 2393 states and 7185 transitions. [2022-02-10 21:37:41,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:37:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 7185 transitions. [2022-02-10 21:37:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-10 21:37:41,700 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:41,700 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] [2022-02-10 21:37:41,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:37:41,700 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:41,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:41,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1410992453, now seen corresponding path program 2 times [2022-02-10 21:37:41,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:41,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576806448] [2022-02-10 21:37:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:41,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:41,882 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:37:41,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:41,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576806448] [2022-02-10 21:37:41,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576806448] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:41,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:41,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 21:37:41,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936109155] [2022-02-10 21:37:41,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:41,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 21:37:41,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:41,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 21:37:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-10 21:37:41,884 INFO L87 Difference]: Start difference. First operand 2393 states and 7185 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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:37:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:42,133 INFO L93 Difference]: Finished difference Result 3503 states and 10640 transitions. [2022-02-10 21:37:42,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:37:42,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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 98 [2022-02-10 21:37:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:42,140 INFO L225 Difference]: With dead ends: 3503 [2022-02-10 21:37:42,140 INFO L226 Difference]: Without dead ends: 2162 [2022-02-10 21:37:42,141 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-02-10 21:37:42,141 INFO L934 BasicCegarLoop]: 138 mSDtfsCounter, 168 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:42,141 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 744 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:37:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2022-02-10 21:37:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1943. [2022-02-10 21:37:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1942 states have (on average 2.9196704428424303) internal successors, (5670), 1942 states have internal predecessors, (5670), 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:37:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 5670 transitions. [2022-02-10 21:37:42,182 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 5670 transitions. Word has length 98 [2022-02-10 21:37:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:42,182 INFO L470 AbstractCegarLoop]: Abstraction has 1943 states and 5670 transitions. [2022-02-10 21:37:42,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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:37:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 5670 transitions. [2022-02-10 21:37:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-10 21:37:42,187 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:42,187 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] [2022-02-10 21:37:42,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 21:37:42,187 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:42,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1688955637, now seen corresponding path program 3 times [2022-02-10 21:37:42,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:42,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302472193] [2022-02-10 21:37:42,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:42,301 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:37:42,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:42,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302472193] [2022-02-10 21:37:42,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302472193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:42,302 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:42,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:37:42,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557793519] [2022-02-10 21:37:42,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:42,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:37:42,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:42,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:37:42,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:37:42,303 INFO L87 Difference]: Start difference. First operand 1943 states and 5670 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:37:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:42,436 INFO L93 Difference]: Finished difference Result 2819 states and 8363 transitions. [2022-02-10 21:37:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-10 21:37:42,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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 98 [2022-02-10 21:37:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:42,440 INFO L225 Difference]: With dead ends: 2819 [2022-02-10 21:37:42,440 INFO L226 Difference]: Without dead ends: 1763 [2022-02-10 21:37:42,440 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:37:42,441 INFO L934 BasicCegarLoop]: 129 mSDtfsCounter, 91 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:42,441 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 658 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:37:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-02-10 21:37:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1763. [2022-02-10 21:37:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1762 states have (on average 2.874006810442679) internal successors, (5064), 1762 states have internal predecessors, (5064), 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:37:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 5064 transitions. [2022-02-10 21:37:42,521 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 5064 transitions. Word has length 98 [2022-02-10 21:37:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:42,521 INFO L470 AbstractCegarLoop]: Abstraction has 1763 states and 5064 transitions. [2022-02-10 21:37:42,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:37:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 5064 transitions. [2022-02-10 21:37:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-10 21:37:42,525 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:42,525 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] [2022-02-10 21:37:42,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 21:37:42,525 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:42,526 INFO L85 PathProgramCache]: Analyzing trace with hash -231616147, now seen corresponding path program 4 times [2022-02-10 21:37:42,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:42,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336045803] [2022-02-10 21:37:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:42,707 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:37:42,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:42,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336045803] [2022-02-10 21:37:42,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336045803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:42,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:42,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 21:37:42,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811651274] [2022-02-10 21:37:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:42,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 21:37:42,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:42,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 21:37:42,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-10 21:37:42,710 INFO L87 Difference]: Start difference. First operand 1763 states and 5064 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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:37:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:42,902 INFO L93 Difference]: Finished difference Result 2414 states and 7022 transitions. [2022-02-10 21:37:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:37:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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 98 [2022-02-10 21:37:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:42,905 INFO L225 Difference]: With dead ends: 2414 [2022-02-10 21:37:42,905 INFO L226 Difference]: Without dead ends: 1763 [2022-02-10 21:37:42,906 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-10 21:37:42,906 INFO L934 BasicCegarLoop]: 158 mSDtfsCounter, 145 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:42,906 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 1008 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:37:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-02-10 21:37:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1763. [2022-02-10 21:37:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1762 states have (on average 2.8671963677639045) internal successors, (5052), 1762 states have internal predecessors, (5052), 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:37:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 5052 transitions. [2022-02-10 21:37:42,943 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 5052 transitions. Word has length 98 [2022-02-10 21:37:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:42,944 INFO L470 AbstractCegarLoop]: Abstraction has 1763 states and 5052 transitions. [2022-02-10 21:37:42,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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:37:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 5052 transitions. [2022-02-10 21:37:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-10 21:37:42,948 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:42,948 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] [2022-02-10 21:37:42,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-10 21:37:42,949 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -528384259, now seen corresponding path program 5 times [2022-02-10 21:37:42,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:42,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804085335] [2022-02-10 21:37:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:37:43,205 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:37:43,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:37:43,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804085335] [2022-02-10 21:37:43,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804085335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:37:43,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:37:43,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-10 21:37:43,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664519158] [2022-02-10 21:37:43,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:37:43,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 21:37:43,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:37:43,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 21:37:43,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:37:43,207 INFO L87 Difference]: Start difference. First operand 1763 states and 5052 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 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:37:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:37:43,493 INFO L93 Difference]: Finished difference Result 2354 states and 6817 transitions. [2022-02-10 21:37:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 21:37:43,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 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 98 [2022-02-10 21:37:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:37:43,496 INFO L225 Difference]: With dead ends: 2354 [2022-02-10 21:37:43,496 INFO L226 Difference]: Without dead ends: 1147 [2022-02-10 21:37:43,496 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-02-10 21:37:43,497 INFO L934 BasicCegarLoop]: 164 mSDtfsCounter, 275 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:37:43,497 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 1086 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:37:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-02-10 21:37:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2022-02-10 21:37:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1146 states have (on average 2.743455497382199) internal successors, (3144), 1146 states have internal predecessors, (3144), 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:37:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 3144 transitions. [2022-02-10 21:37:43,518 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 3144 transitions. Word has length 98 [2022-02-10 21:37:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:37:43,518 INFO L470 AbstractCegarLoop]: Abstraction has 1147 states and 3144 transitions. [2022-02-10 21:37:43,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 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:37:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 3144 transitions. [2022-02-10 21:37:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-10 21:37:43,521 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:37:43,521 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] [2022-02-10 21:37:43,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-10 21:37:43,522 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:37:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:37:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash 639273007, now seen corresponding path program 6 times [2022-02-10 21:37:43,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:37:43,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525707248] [2022-02-10 21:37:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:37:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:37:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:37:43,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 21:37:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:37:43,699 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 21:37:43,699 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 21:37:43,700 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-10 21:37:43,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-10 21:37:43,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-02-10 21:37:43,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-02-10 21:37:43,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-02-10 21:37:43,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-10 21:37:43,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-10 21:37:43,704 INFO L733 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:37:43,708 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 21:37:43,708 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 21:37:43,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 09:37:43 BasicIcfg [2022-02-10 21:37:43,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 21:37:43,889 INFO L158 Benchmark]: Toolchain (without parser) took 13139.46ms. Allocated memory was 185.6MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 126.8MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 706.9MB. Max. memory is 8.0GB. [2022-02-10 21:37:43,889 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 21:37:43,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.49ms. Allocated memory was 185.6MB in the beginning and 237.0MB in the end (delta: 51.4MB). Free memory was 126.7MB in the beginning and 193.8MB in the end (delta: -67.1MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2022-02-10 21:37:43,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.22ms. Allocated memory is still 237.0MB. Free memory was 193.8MB in the beginning and 190.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 21:37:43,890 INFO L158 Benchmark]: Boogie Preprocessor took 58.62ms. Allocated memory is still 237.0MB. Free memory was 190.7MB in the beginning and 188.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 21:37:43,890 INFO L158 Benchmark]: RCFGBuilder took 977.49ms. Allocated memory is still 237.0MB. Free memory was 188.6MB in the beginning and 108.9MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2022-02-10 21:37:43,890 INFO L158 Benchmark]: TraceAbstraction took 11501.18ms. Allocated memory was 237.0MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 108.4MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 636.5MB. Max. memory is 8.0GB. [2022-02-10 21:37:43,891 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.11ms. Allocated memory is still 185.6MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 519.49ms. Allocated memory was 185.6MB in the beginning and 237.0MB in the end (delta: 51.4MB). Free memory was 126.7MB in the beginning and 193.8MB in the end (delta: -67.1MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.22ms. Allocated memory is still 237.0MB. Free memory was 193.8MB in the beginning and 190.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.62ms. Allocated memory is still 237.0MB. Free memory was 190.7MB in the beginning and 188.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 977.49ms. Allocated memory is still 237.0MB. Free memory was 188.6MB in the beginning and 108.9MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11501.18ms. Allocated memory was 237.0MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 108.4MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 636.5MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L719] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L721] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L723] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L724] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L725] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L726] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L727] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L728] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L729] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L734] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L735] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L736] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L737] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L738] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L739] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L740] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L741] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L743] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L855] 0 pthread_t t38; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t38, ((void *)0), P0, ((void *)0))=-2, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=-1, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0] [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=49, weak$$choice2=255, x=1, y=1, z=1] [L833] 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) [L833] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L833] 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) [L833] 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) [L834] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L835] 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 [L836] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L837] 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 [L774] 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) [L774] 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) [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L776] 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 [L777] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L778] 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 [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=255, x=1, y=1, z=1] [L797] 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) [L797] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L797] 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) [L797] 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) [L798] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L799] 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 [L800] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L801] 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 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 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) [L866] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L866] 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) [L866] 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) [L867] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L868] 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 [L869] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L870] 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 [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.4s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2367 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2367 mSDsluCounter, 7859 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6889 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1525 IncrementalHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 1642 mSDtfsCounter, 1525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20906occurred in iteration=0, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 219 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1160 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1050 ConstructedInterpolants, 0 QuantifiedInterpolants, 5365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:37:43,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...