/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/mix038_tso.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a
[2022-02-18 13:34:03,238 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-18 13:34:03,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-18 13:34:03,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-18 13:34:03,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-18 13:34:03,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-18 13:34:03,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-18 13:34:03,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-18 13:34:03,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-18 13:34:03,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-18 13:34:03,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-18 13:34:03,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-18 13:34:03,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-18 13:34:03,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-18 13:34:03,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-18 13:34:03,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-18 13:34:03,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-18 13:34:03,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-18 13:34:03,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-18 13:34:03,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-18 13:34:03,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-18 13:34:03,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-18 13:34:03,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-18 13:34:03,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-18 13:34:03,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-18 13:34:03,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-18 13:34:03,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-18 13:34:03,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-18 13:34:03,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-18 13:34:03,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-18 13:34:03,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-18 13:34:03,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-18 13:34:03,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-18 13:34:03,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-18 13:34:03,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-18 13:34:03,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-18 13:34:03,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-18 13:34:03,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-18 13:34:03,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-18 13:34:03,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-18 13:34:03,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-18 13:34:03,340 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-18 13:34:03,356 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-18 13:34:03,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-18 13:34:03,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-18 13:34:03,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-18 13:34:03,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-18 13:34:03,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-18 13:34:03,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-18 13:34:03,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-18 13:34:03,358 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-18 13:34:03,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-18 13:34:03,358 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-18 13:34:03,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-18 13:34:03,358 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-18 13:34:03,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-18 13:34:03,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-18 13:34:03,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-18 13:34:03,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-18 13:34:03,359 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-18 13:34:03,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-18 13:34:03,359 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-18 13:34:03,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-18 13:34:03,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-18 13:34:03,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-18 13:34:03,359 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-02-18 13:34:03,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-18 13:34:03,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-18 13:34:03,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-18 13:34:03,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-18 13:34:03,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-18 13:34:03,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-18 13:34:03,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-18 13:34:03,360 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-18 13:34:03,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-18 13:34:03,360 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-18 13:34:03,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-18 13:34:03,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-18 13:34:03,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-18 13:34:03,509 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-02-18 13:34:03,509 INFO L275 PluginConnector]: CDTParser initialized
[2022-02-18 13:34:03,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i
[2022-02-18 13:34:03,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e82ba438/e84734daaf0246baa699ecb477942658/FLAGf733c7faa
[2022-02-18 13:34:04,078 INFO L306 CDTParser]: Found 1 translation units.
[2022-02-18 13:34:04,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i
[2022-02-18 13:34:04,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e82ba438/e84734daaf0246baa699ecb477942658/FLAGf733c7faa
[2022-02-18 13:34:04,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e82ba438/e84734daaf0246baa699ecb477942658
[2022-02-18 13:34:04,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-18 13:34:04,359 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-02-18 13:34:04,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-18 13:34:04,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-18 13:34:04,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-18 13:34:04,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4117b76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04, skipping insertion in model container
[2022-02-18 13:34:04,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-02-18 13:34:04,409 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-02-18 13:34:04,565 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/mix038_tso.oepc.i[949,962]
[2022-02-18 13:34:04,667 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-18 13:34:04,673 INFO L203 MainTranslator]: Completed pre-run
[2022-02-18 13:34:04,680 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/mix038_tso.oepc.i[949,962]
[2022-02-18 13:34:04,713 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-18 13:34:04,744 INFO L208 MainTranslator]: Completed translation
[2022-02-18 13:34:04,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04 WrapperNode
[2022-02-18 13:34:04,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-18 13:34:04,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-18 13:34:04,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-18 13:34:04,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-18 13:34:04,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,784 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 277
[2022-02-18 13:34:04,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-18 13:34:04,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-18 13:34:04,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-18 13:34:04,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-18 13:34:04,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-18 13:34:04,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-18 13:34:04,812 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-18 13:34:04,812 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-18 13:34:04,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (1/1) ...
[2022-02-18 13:34:04,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-18 13:34:04,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-18 13:34:04,863 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-18 13:34:04,875 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-18 13:34:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-02-18 13:34:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-02-18 13:34:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-18 13:34:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-02-18 13:34:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-02-18 13:34:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2022-02-18 13:34:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2022-02-18 13:34:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2022-02-18 13:34:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2022-02-18 13:34:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2022-02-18 13:34:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2022-02-18 13:34:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-18 13:34:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-02-18 13:34:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-18 13:34:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-18 13:34:04,903 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-02-18 13:34:05,047 INFO L234 CfgBuilder]: Building ICFG
[2022-02-18 13:34:05,049 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-18 13:34:05,385 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-18 13:34:05,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-18 13:34:05,590 INFO L299 CfgBuilder]: Removed 0 assume(true) statements.
[2022-02-18 13:34:05,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:34:05 BoogieIcfgContainer
[2022-02-18 13:34:05,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-18 13:34:05,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-18 13:34:05,595 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-18 13:34:05,597 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-18 13:34:05,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:34:04" (1/3) ...
[2022-02-18 13:34:05,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f9a89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:34:05, skipping insertion in model container
[2022-02-18 13:34:05,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:04" (2/3) ...
[2022-02-18 13:34:05,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f9a89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:34:05, skipping insertion in model container
[2022-02-18 13:34:05,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:34:05" (3/3) ...
[2022-02-18 13:34:05,600 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i
[2022-02-18 13:34:05,605 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-02-18 13:34:05,605 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-18 13:34:05,606 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-02-18 13:34:05,606 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-02-18 13:34:05,639 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,640 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,640 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,640 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,640 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,640 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,640 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,640 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,641 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,641 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,641 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,641 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,642 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,642 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,642 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,645 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,645 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,650 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,651 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,651 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,651 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,651 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,651 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,651 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,652 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,652 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,652 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,652 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,653 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,653 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,653 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,653 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,654 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,654 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,654 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,654 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,654 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,654 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,655 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,655 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,655 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,655 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,656 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,656 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,656 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,656 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,657 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,657 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,657 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,670 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,670 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,670 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,670 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,670 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,671 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,672 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,673 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,696 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,697 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,697 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,697 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,699 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,700 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:05,700 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-02-18 13:34:05,749 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-18 13:34:05,755 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, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true
[2022-02-18 13:34:05,755 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2022-02-18 13:34:05,765 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 127 places, 119 transitions, 253 flow
[2022-02-18 13:34:06,456 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17405 states, 17402 states have (on average 3.599758648431215) internal successors, (62643), 17404 states have internal predecessors, (62643), 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-18 13:34:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 17405 states, 17402 states have (on average 3.599758648431215) internal successors, (62643), 17404 states have internal predecessors, (62643), 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-18 13:34:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2022-02-18 13:34:06,519 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:06,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:06,520 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:06,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1046434637, now seen corresponding path program 1 times
[2022-02-18 13:34:06,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:06,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929885125]
[2022-02-18 13:34:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:06,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:06,863 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-18 13:34:06,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:06,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929885125]
[2022-02-18 13:34:06,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929885125] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:06,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:06,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-18 13:34:06,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585946463]
[2022-02-18 13:34:06,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:06,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-18 13:34:06,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:06,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-18 13:34:06,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-18 13:34:06,936 INFO L87 Difference]: Start difference. First operand has 17405 states, 17402 states have (on average 3.599758648431215) internal successors, (62643), 17404 states have internal predecessors, (62643), 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 27.0) internal successors, (54), 3 states have internal predecessors, (54), 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-18 13:34:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:07,304 INFO L93 Difference]: Finished difference Result 14629 states and 51414 transitions.
[2022-02-18 13:34:07,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-18 13:34:07,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54
[2022-02-18 13:34:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:07,485 INFO L225 Difference]: With dead ends: 14629
[2022-02-18 13:34:07,486 INFO L226 Difference]: Without dead ends: 12069
[2022-02-18 13:34:07,487 INFO L932 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-18 13:34:07,492 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:07,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 172 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-18 13:34:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12069 states.
[2022-02-18 13:34:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12069 to 12069.
[2022-02-18 13:34:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12069 states, 12068 states have (on average 3.5457408021213124) internal successors, (42790), 12068 states have internal predecessors, (42790), 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-18 13:34:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12069 states to 12069 states and 42790 transitions.
[2022-02-18 13:34:08,094 INFO L78 Accepts]: Start accepts. Automaton has 12069 states and 42790 transitions. Word has length 54
[2022-02-18 13:34:08,095 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:08,095 INFO L470 AbstractCegarLoop]: Abstraction has 12069 states and 42790 transitions.
[2022-02-18 13:34:08,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 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-18 13:34:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 12069 states and 42790 transitions.
[2022-02-18 13:34:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2022-02-18 13:34:08,150 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:08,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:08,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-18 13:34:08,150 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:08,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash 557570046, now seen corresponding path program 1 times
[2022-02-18 13:34:08,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:08,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082064314]
[2022-02-18 13:34:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:08,465 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-18 13:34:08,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:08,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082064314]
[2022-02-18 13:34:08,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082064314] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:08,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:08,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-18 13:34:08,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996551628]
[2022-02-18 13:34:08,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:08,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-18 13:34:08,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:08,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-18 13:34:08,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-18 13:34:08,471 INFO L87 Difference]: Start difference. First operand 12069 states and 42790 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:34:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:08,832 INFO L93 Difference]: Finished difference Result 13477 states and 47366 transitions.
[2022-02-18 13:34:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-18 13:34:08,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2022-02-18 13:34:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:08,890 INFO L225 Difference]: With dead ends: 13477
[2022-02-18 13:34:08,891 INFO L226 Difference]: Without dead ends: 10277
[2022-02-18 13:34:08,891 INFO L932 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-18 13:34:08,892 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 141 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:08,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 551 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:34:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10277 states.
[2022-02-18 13:34:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10277 to 10277.
[2022-02-18 13:34:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10277 states, 10276 states have (on average 3.5101206695212146) internal successors, (36070), 10276 states have internal predecessors, (36070), 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-18 13:34:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10277 states to 10277 states and 36070 transitions.
[2022-02-18 13:34:09,339 INFO L78 Accepts]: Start accepts. Automaton has 10277 states and 36070 transitions. Word has length 76
[2022-02-18 13:34:09,340 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:09,340 INFO L470 AbstractCegarLoop]: Abstraction has 10277 states and 36070 transitions.
[2022-02-18 13:34:09,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:34:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 10277 states and 36070 transitions.
[2022-02-18 13:34:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2022-02-18 13:34:09,372 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:09,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:09,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-18 13:34:09,372 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2019807202, now seen corresponding path program 1 times
[2022-02-18 13:34:09,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:09,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689949529]
[2022-02-18 13:34:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:09,531 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-18 13:34:09,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:09,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689949529]
[2022-02-18 13:34:09,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689949529] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:09,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:09,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-02-18 13:34:09,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407279550]
[2022-02-18 13:34:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:09,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-02-18 13:34:09,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-02-18 13:34:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-02-18 13:34:09,533 INFO L87 Difference]: Start difference. First operand 10277 states and 36070 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-18 13:34:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:09,893 INFO L93 Difference]: Finished difference Result 12365 states and 43172 transitions.
[2022-02-18 13:34:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-18 13:34:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 80
[2022-02-18 13:34:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:09,936 INFO L225 Difference]: With dead ends: 12365
[2022-02-18 13:34:09,936 INFO L226 Difference]: Without dead ends: 10325
[2022-02-18 13:34:09,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240
[2022-02-18 13:34:09,937 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 214 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:09,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 664 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:34:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10325 states.
[2022-02-18 13:34:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10325 to 10025.
[2022-02-18 13:34:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10025 states, 10024 states have (on average 3.501995211492418) internal successors, (35104), 10024 states have internal predecessors, (35104), 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-18 13:34:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10025 states to 10025 states and 35104 transitions.
[2022-02-18 13:34:10,267 INFO L78 Accepts]: Start accepts. Automaton has 10025 states and 35104 transitions. Word has length 80
[2022-02-18 13:34:10,267 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:10,268 INFO L470 AbstractCegarLoop]: Abstraction has 10025 states and 35104 transitions.
[2022-02-18 13:34:10,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-18 13:34:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 10025 states and 35104 transitions.
[2022-02-18 13:34:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2022-02-18 13:34:10,287 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:10,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:10,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-18 13:34:10,287 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 337314144, now seen corresponding path program 1 times
[2022-02-18 13:34:10,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:10,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737257704]
[2022-02-18 13:34:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:10,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:10,490 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-18 13:34:10,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:10,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737257704]
[2022-02-18 13:34:10,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737257704] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:10,490 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:10,490 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-18 13:34:10,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28991606]
[2022-02-18 13:34:10,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:10,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-18 13:34:10,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-18 13:34:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2022-02-18 13:34:10,492 INFO L87 Difference]: Start difference. First operand 10025 states and 35104 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 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-18 13:34:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:10,867 INFO L93 Difference]: Finished difference Result 11765 states and 41008 transitions.
[2022-02-18 13:34:10,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-18 13:34:10,868 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 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-18 13:34:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:10,913 INFO L225 Difference]: With dead ends: 11765
[2022-02-18 13:34:10,913 INFO L226 Difference]: Without dead ends: 10205
[2022-02-18 13:34:10,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306
[2022-02-18 13:34:10,914 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 268 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:10,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 959 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:34:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10205 states.
[2022-02-18 13:34:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10205 to 10205.
[2022-02-18 13:34:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10205 states, 10204 states have (on average 3.5019600156801256) internal successors, (35734), 10204 states have internal predecessors, (35734), 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-18 13:34:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10205 states to 10205 states and 35734 transitions.
[2022-02-18 13:34:11,257 INFO L78 Accepts]: Start accepts. Automaton has 10205 states and 35734 transitions. Word has length 82
[2022-02-18 13:34:11,257 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:11,257 INFO L470 AbstractCegarLoop]: Abstraction has 10205 states and 35734 transitions.
[2022-02-18 13:34:11,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 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-18 13:34:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 10205 states and 35734 transitions.
[2022-02-18 13:34:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2022-02-18 13:34:11,282 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:11,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:11,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-18 13:34:11,282 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:11,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1473909828, now seen corresponding path program 1 times
[2022-02-18 13:34:11,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:11,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693951796]
[2022-02-18 13:34:11,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:11,421 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-18 13:34:11,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:11,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693951796]
[2022-02-18 13:34:11,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693951796] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:11,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:11,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-18 13:34:11,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706370251]
[2022-02-18 13:34:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:11,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-18 13:34:11,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-18 13:34:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-02-18 13:34:11,423 INFO L87 Difference]: Start difference. First operand 10205 states and 35734 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-18 13:34:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:11,766 INFO L93 Difference]: Finished difference Result 11505 states and 40068 transitions.
[2022-02-18 13:34:11,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-18 13:34:11,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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 83
[2022-02-18 13:34:11,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:11,794 INFO L225 Difference]: With dead ends: 11505
[2022-02-18 13:34:11,794 INFO L226 Difference]: Without dead ends: 10265
[2022-02-18 13:34:11,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342
[2022-02-18 13:34:11,795 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 295 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:11,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 888 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:34:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states.
[2022-02-18 13:34:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 10265.
[2022-02-18 13:34:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10265 states, 10264 states have (on average 3.5019485580670304) internal successors, (35944), 10264 states have internal predecessors, (35944), 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-18 13:34:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10265 states to 10265 states and 35944 transitions.
[2022-02-18 13:34:12,194 INFO L78 Accepts]: Start accepts. Automaton has 10265 states and 35944 transitions. Word has length 83
[2022-02-18 13:34:12,195 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:12,195 INFO L470 AbstractCegarLoop]: Abstraction has 10265 states and 35944 transitions.
[2022-02-18 13:34:12,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-18 13:34:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 10265 states and 35944 transitions.
[2022-02-18 13:34:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2022-02-18 13:34:12,223 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:12,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:12,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-18 13:34:12,224 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:12,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash 929410940, now seen corresponding path program 1 times
[2022-02-18 13:34:12,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:12,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572456953]
[2022-02-18 13:34:12,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:12,489 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-18 13:34:12,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:12,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572456953]
[2022-02-18 13:34:12,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572456953] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:12,490 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:12,490 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-02-18 13:34:12,490 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554851303]
[2022-02-18 13:34:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:12,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-18 13:34:12,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:12,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-18 13:34:12,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2022-02-18 13:34:12,582 INFO L87 Difference]: Start difference. First operand 10265 states and 35944 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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-18 13:34:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:13,089 INFO L93 Difference]: Finished difference Result 13893 states and 48415 transitions.
[2022-02-18 13:34:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-02-18 13:34:13,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 84
[2022-02-18 13:34:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:13,159 INFO L225 Difference]: With dead ends: 13893
[2022-02-18 13:34:13,160 INFO L226 Difference]: Without dead ends: 12193
[2022-02-18 13:34:13,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600
[2022-02-18 13:34:13,162 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 404 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:13,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 1205 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:34:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12193 states.
[2022-02-18 13:34:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12193 to 11969.
[2022-02-18 13:34:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11969 states, 11968 states have (on average 3.4979110962566846) internal successors, (41863), 11968 states have internal predecessors, (41863), 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-18 13:34:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11969 states to 11969 states and 41863 transitions.
[2022-02-18 13:34:13,614 INFO L78 Accepts]: Start accepts. Automaton has 11969 states and 41863 transitions. Word has length 84
[2022-02-18 13:34:13,615 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:13,615 INFO L470 AbstractCegarLoop]: Abstraction has 11969 states and 41863 transitions.
[2022-02-18 13:34:13,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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-18 13:34:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 11969 states and 41863 transitions.
[2022-02-18 13:34:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2022-02-18 13:34:13,640 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:13,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:13,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-18 13:34:13,640 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash -791652863, now seen corresponding path program 1 times
[2022-02-18 13:34:13,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:13,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525779178]
[2022-02-18 13:34:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:13,761 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-18 13:34:13,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:13,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525779178]
[2022-02-18 13:34:13,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525779178] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:13,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:13,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-18 13:34:13,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062630131]
[2022-02-18 13:34:13,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:13,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-18 13:34:13,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:13,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-18 13:34:13,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-18 13:34:13,763 INFO L87 Difference]: Start difference. First operand 11969 states and 41863 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-18 13:34:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:13,963 INFO L93 Difference]: Finished difference Result 14234 states and 48839 transitions.
[2022-02-18 13:34:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-18 13:34:13,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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 84
[2022-02-18 13:34:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:13,996 INFO L225 Difference]: With dead ends: 14234
[2022-02-18 13:34:13,996 INFO L226 Difference]: Without dead ends: 10074
[2022-02-18 13:34:13,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-18 13:34:13,997 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 192 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:13,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 425 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:34:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10074 states.
[2022-02-18 13:34:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10074 to 10074.
[2022-02-18 13:34:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10074 states, 10073 states have (on average 3.403454780105232) internal successors, (34283), 10073 states have internal predecessors, (34283), 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-18 13:34:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10074 states to 10074 states and 34283 transitions.
[2022-02-18 13:34:14,487 INFO L78 Accepts]: Start accepts. Automaton has 10074 states and 34283 transitions. Word has length 84
[2022-02-18 13:34:14,488 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:14,488 INFO L470 AbstractCegarLoop]: Abstraction has 10074 states and 34283 transitions.
[2022-02-18 13:34:14,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-18 13:34:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 10074 states and 34283 transitions.
[2022-02-18 13:34:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2022-02-18 13:34:14,505 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:14,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:14,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-18 13:34:14,506 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1253362334, now seen corresponding path program 1 times
[2022-02-18 13:34:14,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:14,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709134091]
[2022-02-18 13:34:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:14,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:14,599 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-18 13:34:14,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:14,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709134091]
[2022-02-18 13:34:14,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709134091] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:14,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:14,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-18 13:34:14,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286573673]
[2022-02-18 13:34:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:14,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-18 13:34:14,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-18 13:34:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-02-18 13:34:14,600 INFO L87 Difference]: Start difference. First operand 10074 states and 34283 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-18 13:34:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:14,799 INFO L93 Difference]: Finished difference Result 9057 states and 29909 transitions.
[2022-02-18 13:34:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-02-18 13:34:14,799 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-18 13:34:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:14,815 INFO L225 Difference]: With dead ends: 9057
[2022-02-18 13:34:14,815 INFO L226 Difference]: Without dead ends: 5937
[2022-02-18 13:34:14,815 INFO L932 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-18 13:34:14,816 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 316 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 499 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.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:14,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 499 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:34:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5937 states.
[2022-02-18 13:34:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5937 to 5541.
[2022-02-18 13:34:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5540 states have (on average 3.2160649819494584) internal successors, (17817), 5540 states have internal predecessors, (17817), 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-18 13:34:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 17817 transitions.
[2022-02-18 13:34:14,920 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 17817 transitions. Word has length 85
[2022-02-18 13:34:14,920 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:14,921 INFO L470 AbstractCegarLoop]: Abstraction has 5541 states and 17817 transitions.
[2022-02-18 13:34:14,921 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-18 13:34:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 17817 transitions.
[2022-02-18 13:34:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2022-02-18 13:34:14,930 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:14,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:14,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-18 13:34:14,930 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash -937250876, now seen corresponding path program 1 times
[2022-02-18 13:34:14,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:14,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190702695]
[2022-02-18 13:34:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:15,240 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-18 13:34:15,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:15,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190702695]
[2022-02-18 13:34:15,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190702695] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:15,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:15,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-02-18 13:34:15,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367244038]
[2022-02-18 13:34:15,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:15,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-18 13:34:15,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:15,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-18 13:34:15,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2022-02-18 13:34:15,242 INFO L87 Difference]: Start difference. First operand 5541 states and 17817 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:34:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:15,687 INFO L93 Difference]: Finished difference Result 8721 states and 28040 transitions.
[2022-02-18 13:34:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-02-18 13:34:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2022-02-18 13:34:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:15,706 INFO L225 Difference]: With dead ends: 8721
[2022-02-18 13:34:15,707 INFO L226 Difference]: Without dead ends: 5856
[2022-02-18 13:34:15,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506
[2022-02-18 13:34:15,709 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 441 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:15,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 1440 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:34:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5856 states.
[2022-02-18 13:34:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5856 to 5541.
[2022-02-18 13:34:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5540 states have (on average 3.177075812274368) internal successors, (17601), 5540 states have internal predecessors, (17601), 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-18 13:34:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 17601 transitions.
[2022-02-18 13:34:15,830 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 17601 transitions. Word has length 88
[2022-02-18 13:34:15,830 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:15,830 INFO L470 AbstractCegarLoop]: Abstraction has 5541 states and 17601 transitions.
[2022-02-18 13:34:15,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:34:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 17601 transitions.
[2022-02-18 13:34:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2022-02-18 13:34:15,843 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:15,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:15,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-02-18 13:34:15,844 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2037966924, now seen corresponding path program 2 times
[2022-02-18 13:34:15,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:15,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642835177]
[2022-02-18 13:34:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:16,078 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-18 13:34:16,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:16,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642835177]
[2022-02-18 13:34:16,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642835177] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:16,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:16,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-02-18 13:34:16,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556517918]
[2022-02-18 13:34:16,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:16,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-18 13:34:16,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-18 13:34:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2022-02-18 13:34:16,080 INFO L87 Difference]: Start difference. First operand 5541 states and 17601 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:34:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:16,503 INFO L93 Difference]: Finished difference Result 6289 states and 19956 transitions.
[2022-02-18 13:34:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2022-02-18 13:34:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2022-02-18 13:34:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:16,518 INFO L225 Difference]: With dead ends: 6289
[2022-02-18 13:34:16,518 INFO L226 Difference]: Without dead ends: 5929
[2022-02-18 13:34:16,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506
[2022-02-18 13:34:16,519 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 435 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:16,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 1038 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:34:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5929 states.
[2022-02-18 13:34:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5929 to 5175.
[2022-02-18 13:34:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5175 states, 5174 states have (on average 3.169114804793197) internal successors, (16397), 5174 states have internal predecessors, (16397), 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-18 13:34:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 16397 transitions.
[2022-02-18 13:34:16,627 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 16397 transitions. Word has length 88
[2022-02-18 13:34:16,627 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:16,627 INFO L470 AbstractCegarLoop]: Abstraction has 5175 states and 16397 transitions.
[2022-02-18 13:34:16,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:34:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 16397 transitions.
[2022-02-18 13:34:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2022-02-18 13:34:16,635 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:16,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:16,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-02-18 13:34:16,636 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -330976279, now seen corresponding path program 1 times
[2022-02-18 13:34:16,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:16,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849175302]
[2022-02-18 13:34:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:16,745 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-18 13:34:16,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:16,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849175302]
[2022-02-18 13:34:16,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849175302] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:16,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:16,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-02-18 13:34:16,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83559452]
[2022-02-18 13:34:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:16,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-02-18 13:34:16,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:16,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-02-18 13:34:16,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-02-18 13:34:16,747 INFO L87 Difference]: Start difference. First operand 5175 states and 16397 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:34:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:16,909 INFO L93 Difference]: Finished difference Result 4077 states and 12692 transitions.
[2022-02-18 13:34:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-02-18 13:34:16,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2022-02-18 13:34:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:16,915 INFO L225 Difference]: With dead ends: 4077
[2022-02-18 13:34:16,915 INFO L226 Difference]: Without dead ends: 1944
[2022-02-18 13:34:16,915 INFO L932 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-18 13:34:16,916 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 329 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:16,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 468 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:34:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states.
[2022-02-18 13:34:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1776.
[2022-02-18 13:34:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 3.0225352112676056) internal successors, (5365), 1775 states have internal predecessors, (5365), 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-18 13:34:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 5365 transitions.
[2022-02-18 13:34:16,941 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 5365 transitions. Word has length 88
[2022-02-18 13:34:16,941 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:16,941 INFO L470 AbstractCegarLoop]: Abstraction has 1776 states and 5365 transitions.
[2022-02-18 13:34:16,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:34:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 5365 transitions.
[2022-02-18 13:34:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2022-02-18 13:34:16,944 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:16,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:16,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-02-18 13:34:16,944 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1544381286, now seen corresponding path program 1 times
[2022-02-18 13:34:16,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:16,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942054010]
[2022-02-18 13:34:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:16,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:17,230 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-18 13:34:17,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:17,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942054010]
[2022-02-18 13:34:17,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942054010] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:17,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:17,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-02-18 13:34:17,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975035169]
[2022-02-18 13:34:17,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:17,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-02-18 13:34:17,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:17,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-02-18 13:34:17,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2022-02-18 13:34:17,232 INFO L87 Difference]: Start difference. First operand 1776 states and 5365 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 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-18 13:34:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:17,468 INFO L93 Difference]: Finished difference Result 2427 states and 7323 transitions.
[2022-02-18 13:34:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-02-18 13:34:17,470 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 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 93
[2022-02-18 13:34:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:17,473 INFO L225 Difference]: With dead ends: 2427
[2022-02-18 13:34:17,473 INFO L226 Difference]: Without dead ends: 1420
[2022-02-18 13:34:17,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272
[2022-02-18 13:34:17,474 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 263 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:17,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 1155 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:34:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states.
[2022-02-18 13:34:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420.
[2022-02-18 13:34:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1419 states have (on average 2.974630021141649) internal successors, (4221), 1419 states have internal predecessors, (4221), 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-18 13:34:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 4221 transitions.
[2022-02-18 13:34:17,494 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 4221 transitions. Word has length 93
[2022-02-18 13:34:17,495 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:34:17,495 INFO L470 AbstractCegarLoop]: Abstraction has 1420 states and 4221 transitions.
[2022-02-18 13:34:17,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 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-18 13:34:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 4221 transitions.
[2022-02-18 13:34:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2022-02-18 13:34:17,497 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:17,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:34:17,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-02-18 13:34:17,497 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-18 13:34:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash 710141286, now seen corresponding path program 2 times
[2022-02-18 13:34:17,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:17,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688902157]
[2022-02-18 13:34:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-18 13:34:17,548 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-18 13:34:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-18 13:34:17,622 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-18 13:34:17,622 INFO L628 BasicCegarLoop]: Counterexample is feasible
[2022-02-18 13:34:17,623 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2022-02-18 13:34:17,624 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2022-02-18 13:34:17,624 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining)
[2022-02-18 13:34:17,624 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining)
[2022-02-18 13:34:17,624 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining)
[2022-02-18 13:34:17,624 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2022-02-18 13:34:17,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-02-18 13:34:17,626 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:34:17,629 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-02-18 13:34:17,630 INFO L180 ceAbstractionStarter]: Computing trace abstraction results
[2022-02-18 13:34:17,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:34:17 BasicIcfg
[2022-02-18 13:34:17,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-02-18 13:34:17,744 INFO L158 Benchmark]: Toolchain (without parser) took 13385.12ms. Allocated memory was 197.1MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 145.2MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 566.2MB. Max. memory is 8.0GB.
[2022-02-18 13:34:17,744 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory was 162.9MB in the beginning and 162.8MB in the end (delta: 116.3kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-02-18 13:34:17,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.90ms. Allocated memory is still 197.1MB. Free memory was 145.0MB in the beginning and 160.2MB in the end (delta: -15.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-02-18 13:34:17,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.29ms. Allocated memory is still 197.1MB. Free memory was 160.2MB in the beginning and 157.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2022-02-18 13:34:17,745 INFO L158 Benchmark]: Boogie Preprocessor took 26.53ms. Allocated memory is still 197.1MB. Free memory was 157.1MB in the beginning and 155.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-02-18 13:34:17,745 INFO L158 Benchmark]: RCFGBuilder took 781.80ms. Allocated memory is still 197.1MB. Free memory was 155.0MB in the beginning and 76.4MB in the end (delta: 78.6MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB.
[2022-02-18 13:34:17,745 INFO L158 Benchmark]: TraceAbstraction took 12148.54ms. Allocated memory was 197.1MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 75.8MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 497.0MB. Max. memory is 8.0GB.
[2022-02-18 13:34:17,746 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory was 162.9MB in the beginning and 162.8MB in the end (delta: 116.3kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 382.90ms. Allocated memory is still 197.1MB. Free memory was 145.0MB in the beginning and 160.2MB in the end (delta: -15.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 38.29ms. Allocated memory is still 197.1MB. Free memory was 160.2MB in the beginning and 157.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 26.53ms. Allocated memory is still 197.1MB. Free memory was 157.1MB in the beginning and 155.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 781.80ms. Allocated memory is still 197.1MB. Free memory was 155.0MB in the beginning and 76.4MB in the end (delta: 78.6MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB.
* TraceAbstraction took 12148.54ms. Allocated memory was 197.1MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 75.8MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 497.0MB. 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_p1_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0]
[L713] 0 int __unbuffered_p2_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0]
[L715] 0 int __unbuffered_p2_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L717] 0 int a = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0]
[L718] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0]
[L719] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L721] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L722] 0 _Bool x$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L723] 0 int x$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L724] 0 _Bool x$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L725] 0 _Bool x$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L726] 0 _Bool x$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L727] 0 _Bool x$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0]
[L728] 0 _Bool x$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0]
[L729] 0 _Bool x$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L730] 0 _Bool x$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L731] 0 _Bool x$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L732] 0 _Bool x$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0]
[L733] 0 int *x$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L734] 0 int x$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L735] 0 _Bool x$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L736] 0 int x$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L737] 0 _Bool x$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L739] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L741] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L742] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L743] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L830] 0 pthread_t t1019;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-2, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L832] 0 pthread_t t1020;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L767] 2 x$w_buff1 = x$w_buff0
[L768] 2 x$w_buff0 = 2
[L769] 2 x$w_buff1_used = x$w_buff0_used
[L770] 2 x$w_buff0_used = (_Bool)1
[L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L776] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L779] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L834] 0 pthread_t t1021;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L796] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L799] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L802] 3 __unbuffered_p2_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L805] 3 __unbuffered_p2_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L747] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L750] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L753] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L839] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L839] RET 0 assume_abort_if_not(main$tmp_guard0)
[L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L841] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L848] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L849] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L850] 0 x$flush_delayed = weak$$choice2
[L851] 0 x$mem_tmp = x
[L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L853] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L854] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L855] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L856] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L857] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L858] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L860] EXPR 0 x$flush_delayed ? x$mem_tmp : x
[L860] 0 x = x$flush_delayed ? x$mem_tmp : x
[L861] 0 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L863] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L18] 0 reach_error()
VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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: 831]: 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: 833]: 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: 835]: 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, 148 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3347 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3347 mSDsluCounter, 9464 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8192 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1828 IncrementalHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 1717 mSDtfsCounter, 1828 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17405occurred in iteration=0, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 2157 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1078 NumberOfCodeBlocks, 1078 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 6223 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-18 13:34:17,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...