/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/mix044_tso.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a
[2022-02-18 13:34:44,410 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-18 13:34:44,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-18 13:34:44,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-18 13:34:44,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-18 13:34:44,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-18 13:34:44,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-18 13:34:44,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-18 13:34:44,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-18 13:34:44,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-18 13:34:44,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-18 13:34:44,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-18 13:34:44,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-18 13:34:44,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-18 13:34:44,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-18 13:34:44,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-18 13:34:44,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-18 13:34:44,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-18 13:34:44,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-18 13:34:44,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-18 13:34:44,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-18 13:34:44,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-18 13:34:44,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-18 13:34:44,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-18 13:34:44,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-18 13:34:44,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-18 13:34:44,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-18 13:34:44,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-18 13:34:44,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-18 13:34:44,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-18 13:34:44,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-18 13:34:44,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-18 13:34:44,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-18 13:34:44,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-18 13:34:44,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-18 13:34:44,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-18 13:34:44,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-18 13:34:44,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-18 13:34:44,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-18 13:34:44,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-18 13:34:44,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-18 13:34:44,521 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:44,557 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-18 13:34:44,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-18 13:34:44,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-18 13:34:44,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-18 13:34:44,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-18 13:34:44,559 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-18 13:34:44,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-18 13:34:44,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-18 13:34:44,560 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-18 13:34:44,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-18 13:34:44,561 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-18 13:34:44,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-18 13:34:44,561 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-18 13:34:44,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-18 13:34:44,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-18 13:34:44,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-18 13:34:44,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-18 13:34:44,562 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-18 13:34:44,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-18 13:34:44,562 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-18 13:34:44,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-18 13:34:44,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-18 13:34:44,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-18 13:34:44,564 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-02-18 13:34:44,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-18 13:34:44,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-18 13:34:44,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-18 13:34:44,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-18 13:34:44,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-18 13:34:44,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-18 13:34:44,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-18 13:34:44,565 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-18 13:34:44,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-18 13:34:44,565 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:44,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-18 13:34:44,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-18 13:34:44,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-18 13:34:44,811 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-02-18 13:34:44,811 INFO L275 PluginConnector]: CDTParser initialized
[2022-02-18 13:34:44,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i
[2022-02-18 13:34:44,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c1637c6/8b5601be646045a0857dac2900b68f6e/FLAG2adeadd0c
[2022-02-18 13:34:45,303 INFO L306 CDTParser]: Found 1 translation units.
[2022-02-18 13:34:45,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i
[2022-02-18 13:34:45,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c1637c6/8b5601be646045a0857dac2900b68f6e/FLAG2adeadd0c
[2022-02-18 13:34:45,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c1637c6/8b5601be646045a0857dac2900b68f6e
[2022-02-18 13:34:45,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-18 13:34:45,668 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-02-18 13:34:45,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-18 13:34:45,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-18 13:34:45,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-18 13:34:45,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:34:45" (1/1) ...
[2022-02-18 13:34:45,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6109a644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:45, skipping insertion in model container
[2022-02-18 13:34:45,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:34:45" (1/1) ...
[2022-02-18 13:34:45,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-02-18 13:34:45,731 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-02-18 13:34:45,911 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/mix044_tso.oepc.i[949,962]
[2022-02-18 13:34:46,077 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-18 13:34:46,099 INFO L203 MainTranslator]: Completed pre-run
[2022-02-18 13:34:46,116 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/mix044_tso.oepc.i[949,962]
[2022-02-18 13:34:46,178 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-18 13:34:46,210 INFO L208 MainTranslator]: Completed translation
[2022-02-18 13:34:46,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:46 WrapperNode
[2022-02-18 13:34:46,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-18 13:34:46,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-18 13:34:46,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-18 13:34:46,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-18 13:34:46,218 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:46" (1/1) ...
[2022-02-18 13:34:46,238 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:46" (1/1) ...
[2022-02-18 13:34:46,276 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 292
[2022-02-18 13:34:46,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-18 13:34:46,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-18 13:34:46,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-18 13:34:46,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-18 13:34:46,293 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:46" (1/1) ...
[2022-02-18 13:34:46,293 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:46" (1/1) ...
[2022-02-18 13:34:46,305 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:46" (1/1) ...
[2022-02-18 13:34:46,306 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:46" (1/1) ...
[2022-02-18 13:34:46,328 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:46" (1/1) ...
[2022-02-18 13:34:46,331 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:46" (1/1) ...
[2022-02-18 13:34:46,334 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:46" (1/1) ...
[2022-02-18 13:34:46,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-18 13:34:46,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-18 13:34:46,339 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-18 13:34:46,339 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-18 13:34:46,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:46" (1/1) ...
[2022-02-18 13:34:46,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-18 13:34:46,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-18 13:34:46,386 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:46,411 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:46,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-02-18 13:34:46,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-02-18 13:34:46,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-18 13:34:46,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-02-18 13:34:46,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-02-18 13:34:46,428 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2022-02-18 13:34:46,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2022-02-18 13:34:46,428 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2022-02-18 13:34:46,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2022-02-18 13:34:46,429 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2022-02-18 13:34:46,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2022-02-18 13:34:46,429 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2022-02-18 13:34:46,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2022-02-18 13:34:46,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-18 13:34:46,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-02-18 13:34:46,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-18 13:34:46,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-18 13:34:46,432 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:46,592 INFO L234 CfgBuilder]: Building ICFG
[2022-02-18 13:34:46,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-18 13:34:47,119 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-18 13:34:47,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-18 13:34:47,588 INFO L299 CfgBuilder]: Removed 0 assume(true) statements.
[2022-02-18 13:34:47,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:34:47 BoogieIcfgContainer
[2022-02-18 13:34:47,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-18 13:34:47,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-18 13:34:47,593 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-18 13:34:47,595 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-18 13:34:47,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:34:45" (1/3) ...
[2022-02-18 13:34:47,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3f6e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:34:47, skipping insertion in model container
[2022-02-18 13:34:47,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:46" (2/3) ...
[2022-02-18 13:34:47,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3f6e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:34:47, skipping insertion in model container
[2022-02-18 13:34:47,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:34:47" (3/3) ...
[2022-02-18 13:34:47,598 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i
[2022-02-18 13:34:47,603 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-02-18 13:34:47,603 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-18 13:34:47,604 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-02-18 13:34:47,604 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-02-18 13:34:47,651 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,651 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,651 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,651 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,652 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,652 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,656 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,664 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,664 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,664 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,664 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,664 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,664 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,664 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,665 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,665 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,665 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,665 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,665 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,665 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,666 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,666 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,666 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,667 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,667 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,667 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,667 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,667 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,667 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,670 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,671 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,679 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,679 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,679 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,679 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,680 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,680 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,680 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,680 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,680 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,680 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,680 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,680 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,681 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,681 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,681 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,681 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,681 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,682 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,682 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,682 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,682 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,682 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,683 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,683 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,688 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,688 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,689 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,689 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,689 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,689 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,689 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,689 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,690 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,690 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,692 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,693 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,693 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,693 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,693 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,694 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,694 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,695 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,695 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,695 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,696 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,696 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-18 13:34:47,696 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-02-18 13:34:47,749 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-18 13:34:47,758 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:47,758 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2022-02-18 13:34:47,771 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 139 transitions, 298 flow
[2022-02-18 13:34:52,804 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 142880 states, 142877 states have (on average 4.473736150675056) internal successors, (639194), 142879 states have internal predecessors, (639194), 0 states have call successors, (0), 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:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 142880 states, 142877 states have (on average 4.473736150675056) internal successors, (639194), 142879 states have internal predecessors, (639194), 0 states have call successors, (0), 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:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2022-02-18 13:34:53,131 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:34:53,132 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]
[2022-02-18 13:34:53,133 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:34:53,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:34:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1560958310, now seen corresponding path program 1 times
[2022-02-18 13:34:53,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:34:53,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218638936]
[2022-02-18 13:34:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:34:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:34:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:34:53,462 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:53,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:34:53,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218638936]
[2022-02-18 13:34:53,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218638936] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:34:53,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:34:53,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-18 13:34:53,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413395334]
[2022-02-18 13:34:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:34:53,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-18 13:34:53,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:34:53,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-18 13:34:53,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-18 13:34:53,848 INFO L87 Difference]: Start difference. First operand has 142880 states, 142877 states have (on average 4.473736150675056) internal successors, (639194), 142879 states have internal predecessors, (639194), 0 states have call successors, (0), 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 28.5) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:34:56,577 INFO L93 Difference]: Finished difference Result 119336 states and 523817 transitions.
[2022-02-18 13:34:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-18 13:34:56,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57
[2022-02-18 13:34:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:34:57,922 INFO L225 Difference]: With dead ends: 119336
[2022-02-18 13:34:57,923 INFO L226 Difference]: Without dead ends: 96296
[2022-02-18 13:34:57,924 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:57,927 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:34:57,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 204 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:34:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96296 states.
[2022-02-18 13:35:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96296 to 96296.
[2022-02-18 13:35:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96296 states, 96295 states have (on average 4.426823822628381) internal successors, (426281), 96295 states have internal predecessors, (426281), 0 states have call successors, (0), 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:35:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96296 states to 96296 states and 426281 transitions.
[2022-02-18 13:35:04,084 INFO L78 Accepts]: Start accepts. Automaton has 96296 states and 426281 transitions. Word has length 57
[2022-02-18 13:35:04,084 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:35:04,084 INFO L470 AbstractCegarLoop]: Abstraction has 96296 states and 426281 transitions.
[2022-02-18 13:35:04,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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:35:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 96296 states and 426281 transitions.
[2022-02-18 13:35:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2022-02-18 13:35:04,237 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:35:04,237 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]
[2022-02-18 13:35:04,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-18 13:35:04,238 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:35:04,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:35:04,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1687705602, now seen corresponding path program 1 times
[2022-02-18 13:35:04,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:35:04,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601113131]
[2022-02-18 13:35:04,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:35:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:35:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:35:04,614 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:35:04,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:35:04,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601113131]
[2022-02-18 13:35:04,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601113131] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:35:04,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:35:04,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-18 13:35:04,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425890986]
[2022-02-18 13:35:04,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:35:04,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-18 13:35:04,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:35:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-18 13:35:04,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-18 13:35:04,617 INFO L87 Difference]: Start difference. First operand 96296 states and 426281 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:35:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:35:06,571 INFO L93 Difference]: Finished difference Result 119208 states and 524617 transitions.
[2022-02-18 13:35:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-18 13:35:06,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2022-02-18 13:35:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:35:07,882 INFO L225 Difference]: With dead ends: 119208
[2022-02-18 13:35:07,882 INFO L226 Difference]: Without dead ends: 93608
[2022-02-18 13:35:07,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-18 13:35:07,884 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 177 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:35:07,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 711 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:35:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93608 states.
[2022-02-18 13:35:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93608 to 93608.
[2022-02-18 13:35:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93608 states, 93607 states have (on average 4.4175435597765125) internal successors, (413513), 93607 states have internal predecessors, (413513), 0 states have call successors, (0), 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:35:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93608 states to 93608 states and 413513 transitions.
[2022-02-18 13:35:13,035 INFO L78 Accepts]: Start accepts. Automaton has 93608 states and 413513 transitions. Word has length 86
[2022-02-18 13:35:13,036 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:35:13,036 INFO L470 AbstractCegarLoop]: Abstraction has 93608 states and 413513 transitions.
[2022-02-18 13:35:13,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:35:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 93608 states and 413513 transitions.
[2022-02-18 13:35:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2022-02-18 13:35:13,184 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:35:13,184 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:35:13,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-18 13:35:13,185 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:35:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:35:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash -678458017, now seen corresponding path program 1 times
[2022-02-18 13:35:13,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:35:13,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207441064]
[2022-02-18 13:35:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:35:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:35:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:35:13,474 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:35:13,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:35:13,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207441064]
[2022-02-18 13:35:13,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207441064] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:35:13,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:35:13,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-18 13:35:13,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266008018]
[2022-02-18 13:35:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:35:13,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-18 13:35:13,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:35:13,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-18 13:35:13,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-18 13:35:13,477 INFO L87 Difference]: Start difference. First operand 93608 states and 413513 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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:35:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:35:15,067 INFO L93 Difference]: Finished difference Result 105640 states and 463625 transitions.
[2022-02-18 13:35:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-18 13:35:15,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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:35:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:35:16,360 INFO L225 Difference]: With dead ends: 105640
[2022-02-18 13:35:16,361 INFO L226 Difference]: Without dead ends: 81960
[2022-02-18 13:35:16,361 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:35:16,362 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 188 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:35:16,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 667 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:35:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81960 states.
[2022-02-18 13:35:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81960 to 81960.
[2022-02-18 13:35:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81960 states, 81959 states have (on average 4.392159494381337) internal successors, (359977), 81959 states have internal predecessors, (359977), 0 states have call successors, (0), 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:35:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81960 states to 81960 states and 359977 transitions.
[2022-02-18 13:35:20,932 INFO L78 Accepts]: Start accepts. Automaton has 81960 states and 359977 transitions. Word has length 88
[2022-02-18 13:35:20,932 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:35:20,933 INFO L470 AbstractCegarLoop]: Abstraction has 81960 states and 359977 transitions.
[2022-02-18 13:35:20,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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:35:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 81960 states and 359977 transitions.
[2022-02-18 13:35:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2022-02-18 13:35:21,090 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:35:21,090 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]
[2022-02-18 13:35:21,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-18 13:35:21,090 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:35:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:35:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1535399970, now seen corresponding path program 1 times
[2022-02-18 13:35:21,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:35:21,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788450568]
[2022-02-18 13:35:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:35:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:35:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:35:21,369 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:35:21,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:35:21,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788450568]
[2022-02-18 13:35:21,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788450568] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:35:21,370 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:35:21,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-18 13:35:21,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181213361]
[2022-02-18 13:35:21,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:35:21,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-18 13:35:21,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:35:21,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-18 13:35:21,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2022-02-18 13:35:21,372 INFO L87 Difference]: Start difference. First operand 81960 states and 359977 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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:35:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:35:23,322 INFO L93 Difference]: Finished difference Result 96648 states and 422121 transitions.
[2022-02-18 13:35:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-18 13:35:23,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90
[2022-02-18 13:35:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:35:24,177 INFO L225 Difference]: With dead ends: 96648
[2022-02-18 13:35:24,177 INFO L226 Difference]: Without dead ends: 81288
[2022-02-18 13:35:24,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306
[2022-02-18 13:35:24,179 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 451 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-02-18 13:35:24,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 1011 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-02-18 13:35:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81288 states.
[2022-02-18 13:35:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81288 to 81288.
[2022-02-18 13:35:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81288 states, 81287 states have (on average 4.387134474147158) internal successors, (356617), 81287 states have internal predecessors, (356617), 0 states have call successors, (0), 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:35:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81288 states to 81288 states and 356617 transitions.
[2022-02-18 13:35:28,379 INFO L78 Accepts]: Start accepts. Automaton has 81288 states and 356617 transitions. Word has length 90
[2022-02-18 13:35:28,379 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:35:28,379 INFO L470 AbstractCegarLoop]: Abstraction has 81288 states and 356617 transitions.
[2022-02-18 13:35:28,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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:35:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 81288 states and 356617 transitions.
[2022-02-18 13:35:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2022-02-18 13:35:28,554 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:35:28,554 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]
[2022-02-18 13:35:28,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-18 13:35:28,554 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:35:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:35:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash -552184227, now seen corresponding path program 1 times
[2022-02-18 13:35:28,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:35:28,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104961378]
[2022-02-18 13:35:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:35:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:35:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:35:28,828 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:35:28,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:35:28,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104961378]
[2022-02-18 13:35:28,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104961378] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:35:28,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:35:28,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-18 13:35:28,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743218503]
[2022-02-18 13:35:28,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:35:28,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-18 13:35:28,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:35:28,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-18 13:35:28,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2022-02-18 13:35:28,833 INFO L87 Difference]: Start difference. First operand 81288 states and 356617 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:35:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:35:30,829 INFO L93 Difference]: Finished difference Result 96896 states and 423271 transitions.
[2022-02-18 13:35:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-02-18 13:35:30,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92
[2022-02-18 13:35:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:35:32,089 INFO L225 Difference]: With dead ends: 96896
[2022-02-18 13:35:32,089 INFO L226 Difference]: Without dead ends: 83616
[2022-02-18 13:35:32,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342
[2022-02-18 13:35:32,093 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 472 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-02-18 13:35:32,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 965 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-02-18 13:35:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83616 states.
[2022-02-18 13:35:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83616 to 79608.
[2022-02-18 13:35:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79608 states, 79607 states have (on average 4.3815870463652695) internal successors, (348805), 79607 states have internal predecessors, (348805), 0 states have call successors, (0), 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:35:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79608 states to 79608 states and 348805 transitions.
[2022-02-18 13:35:36,808 INFO L78 Accepts]: Start accepts. Automaton has 79608 states and 348805 transitions. Word has length 92
[2022-02-18 13:35:36,808 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:35:36,809 INFO L470 AbstractCegarLoop]: Abstraction has 79608 states and 348805 transitions.
[2022-02-18 13:35:36,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:35:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 79608 states and 348805 transitions.
[2022-02-18 13:35:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2022-02-18 13:35:36,996 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:35:36,996 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:35:36,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-18 13:35:36,996 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:35:36,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:35:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1456724396, now seen corresponding path program 1 times
[2022-02-18 13:35:36,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:35:36,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119289884]
[2022-02-18 13:35:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:35:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:35:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:35:37,188 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:35:37,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:35:37,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119289884]
[2022-02-18 13:35:37,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119289884] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:35:37,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:35:37,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-18 13:35:37,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891968592]
[2022-02-18 13:35:37,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:35:37,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-18 13:35:37,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:35:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-18 13:35:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-02-18 13:35:37,191 INFO L87 Difference]: Start difference. First operand 79608 states and 348805 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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:35:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:35:38,581 INFO L93 Difference]: Finished difference Result 90784 states and 396143 transitions.
[2022-02-18 13:35:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-02-18 13:35:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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:35:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:35:39,488 INFO L225 Difference]: With dead ends: 90784
[2022-02-18 13:35:39,488 INFO L226 Difference]: Without dead ends: 80784
[2022-02-18 13:35:39,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342
[2022-02-18 13:35:39,489 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 378 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-02-18 13:35:39,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 1167 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-02-18 13:35:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80784 states.
[2022-02-18 13:35:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80784 to 80784.
[2022-02-18 13:35:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80784 states, 80783 states have (on average 4.38343463352438) internal successors, (354107), 80783 states have internal predecessors, (354107), 0 states have call successors, (0), 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:35:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80784 states to 80784 states and 354107 transitions.
[2022-02-18 13:35:42,966 INFO L78 Accepts]: Start accepts. Automaton has 80784 states and 354107 transitions. Word has length 93
[2022-02-18 13:35:42,966 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:35:42,966 INFO L470 AbstractCegarLoop]: Abstraction has 80784 states and 354107 transitions.
[2022-02-18 13:35:42,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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:35:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 80784 states and 354107 transitions.
[2022-02-18 13:35:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2022-02-18 13:35:43,690 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:35:43,690 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, 1]
[2022-02-18 13:35:43,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-18 13:35:43,691 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:35:43,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:35:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1877798560, now seen corresponding path program 1 times
[2022-02-18 13:35:43,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:35:43,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73049845]
[2022-02-18 13:35:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:35:43,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:35:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:35:44,027 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:35:44,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:35:44,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73049845]
[2022-02-18 13:35:44,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73049845] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:35:44,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:35:44,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-02-18 13:35:44,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18656507]
[2022-02-18 13:35:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:35:44,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-02-18 13:35:44,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:35:44,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-02-18 13:35:44,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2022-02-18 13:35:44,030 INFO L87 Difference]: Start difference. First operand 80784 states and 354107 transitions. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:35:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:35:45,394 INFO L93 Difference]: Finished difference Result 86816 states and 378647 transitions.
[2022-02-18 13:35:45,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-18 13:35:45,395 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2022-02-18 13:35:45,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:35:45,881 INFO L225 Difference]: With dead ends: 86816
[2022-02-18 13:35:45,881 INFO L226 Difference]: Without dead ends: 77536
[2022-02-18 13:35:45,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342
[2022-02-18 13:35:45,882 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 490 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:35:45,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 1112 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:35:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77536 states.
[2022-02-18 13:35:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77536 to 76248.
[2022-02-18 13:35:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76248 states, 76247 states have (on average 4.376001678754574) internal successors, (333657), 76247 states have internal predecessors, (333657), 0 states have call successors, (0), 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:35:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76248 states to 76248 states and 333657 transitions.
[2022-02-18 13:35:49,555 INFO L78 Accepts]: Start accepts. Automaton has 76248 states and 333657 transitions. Word has length 94
[2022-02-18 13:35:49,556 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:35:49,556 INFO L470 AbstractCegarLoop]: Abstraction has 76248 states and 333657 transitions.
[2022-02-18 13:35:49,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:35:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 76248 states and 333657 transitions.
[2022-02-18 13:35:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2022-02-18 13:35:49,746 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:35:49,746 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, 1]
[2022-02-18 13:35:49,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-18 13:35:49,747 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:35:49,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:35:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash 12855003, now seen corresponding path program 1 times
[2022-02-18 13:35:49,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:35:49,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270422601]
[2022-02-18 13:35:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:35:49,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:35:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:35:49,875 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:35:49,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:35:49,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270422601]
[2022-02-18 13:35:49,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270422601] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:35:49,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:35:49,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-18 13:35:49,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790260392]
[2022-02-18 13:35:49,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:35:49,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-18 13:35:49,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:35:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-18 13:35:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-18 13:35:49,877 INFO L87 Difference]: Start difference. First operand 76248 states and 333657 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:35:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:35:51,471 INFO L93 Difference]: Finished difference Result 93609 states and 404057 transitions.
[2022-02-18 13:35:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-18 13:35:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2022-02-18 13:35:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:35:51,945 INFO L225 Difference]: With dead ends: 93609
[2022-02-18 13:35:51,945 INFO L226 Difference]: Without dead ends: 68009
[2022-02-18 13:35:51,946 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:35:51,946 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 249 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:35:51,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 510 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:35:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68009 states.
[2022-02-18 13:35:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68009 to 68009.
[2022-02-18 13:35:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68009 states, 68008 states have (on average 4.300405834607694) internal successors, (292462), 68008 states have internal predecessors, (292462), 0 states have call successors, (0), 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:35:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68009 states to 68009 states and 292462 transitions.
[2022-02-18 13:35:55,573 INFO L78 Accepts]: Start accepts. Automaton has 68009 states and 292462 transitions. Word has length 94
[2022-02-18 13:35:55,574 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:35:55,574 INFO L470 AbstractCegarLoop]: Abstraction has 68009 states and 292462 transitions.
[2022-02-18 13:35:55,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:35:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 68009 states and 292462 transitions.
[2022-02-18 13:35:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2022-02-18 13:35:55,884 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:35:55,885 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, 1, 1]
[2022-02-18 13:35:55,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-18 13:35:55,885 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:35:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:35:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash 356203258, now seen corresponding path program 1 times
[2022-02-18 13:35:55,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:35:55,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589289509]
[2022-02-18 13:35:55,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:35:55,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:35:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:35:56,112 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:35:56,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:35:56,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589289509]
[2022-02-18 13:35:56,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589289509] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:35:56,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:35:56,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-18 13:35:56,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504261397]
[2022-02-18 13:35:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:35:56,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-18 13:35:56,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:35:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-18 13:35:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-02-18 13:35:56,114 INFO L87 Difference]: Start difference. First operand 68009 states and 292462 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:35:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:35:57,683 INFO L93 Difference]: Finished difference Result 68594 states and 287812 transitions.
[2022-02-18 13:35:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-02-18 13:35:57,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95
[2022-02-18 13:35:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:35:58,080 INFO L225 Difference]: With dead ends: 68594
[2022-02-18 13:35:58,080 INFO L226 Difference]: Without dead ends: 47369
[2022-02-18 13:35:58,081 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:35:58,081 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 434 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-02-18 13:35:58,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 589 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-02-18 13:35:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47369 states.
[2022-02-18 13:35:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47369 to 47369.
[2022-02-18 13:35:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47369 states, 47368 states have (on average 4.140812362776558) internal successors, (196142), 47368 states have internal predecessors, (196142), 0 states have call successors, (0), 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:36:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47369 states to 47369 states and 196142 transitions.
[2022-02-18 13:36:00,150 INFO L78 Accepts]: Start accepts. Automaton has 47369 states and 196142 transitions. Word has length 95
[2022-02-18 13:36:00,150 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:36:00,150 INFO L470 AbstractCegarLoop]: Abstraction has 47369 states and 196142 transitions.
[2022-02-18 13:36:00,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:36:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 47369 states and 196142 transitions.
[2022-02-18 13:36:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2022-02-18 13:36:00,246 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:36:00,246 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, 1, 1, 1, 1, 1]
[2022-02-18 13:36:00,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-02-18 13:36:00,246 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:36:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:36:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash -790566196, now seen corresponding path program 1 times
[2022-02-18 13:36:00,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:36:00,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209628285]
[2022-02-18 13:36:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:36:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:36:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:36:00,719 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:36:00,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:36:00,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209628285]
[2022-02-18 13:36:00,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209628285] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:36:00,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:36:00,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-02-18 13:36:00,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473673081]
[2022-02-18 13:36:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:36:00,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-02-18 13:36:00,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:36:00,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-02-18 13:36:00,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-02-18 13:36:00,721 INFO L87 Difference]: Start difference. First operand 47369 states and 196142 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:36:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:36:01,275 INFO L93 Difference]: Finished difference Result 39962 states and 162110 transitions.
[2022-02-18 13:36:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-02-18 13:36:01,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98
[2022-02-18 13:36:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:36:01,384 INFO L225 Difference]: With dead ends: 39962
[2022-02-18 13:36:01,384 INFO L226 Difference]: Without dead ends: 28487
[2022-02-18 13:36:01,385 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:36:01,385 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 511 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:36:01,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 630 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:36:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28487 states.
[2022-02-18 13:36:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28487 to 28487.
[2022-02-18 13:36:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28487 states, 28486 states have (on average 4.01319946640455) internal successors, (114320), 28486 states have internal predecessors, (114320), 0 states have call successors, (0), 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:36:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28487 states to 28487 states and 114320 transitions.
[2022-02-18 13:36:02,320 INFO L78 Accepts]: Start accepts. Automaton has 28487 states and 114320 transitions. Word has length 98
[2022-02-18 13:36:02,320 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:36:02,320 INFO L470 AbstractCegarLoop]: Abstraction has 28487 states and 114320 transitions.
[2022-02-18 13:36:02,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-18 13:36:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 28487 states and 114320 transitions.
[2022-02-18 13:36:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2022-02-18 13:36:02,635 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:36:02,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:36:02,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-02-18 13:36:02,636 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:36:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:36:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1467925885, now seen corresponding path program 1 times
[2022-02-18 13:36:02,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:36:02,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039808876]
[2022-02-18 13:36:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:36:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:36:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:36:02,782 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:36:02,783 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:36:02,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039808876]
[2022-02-18 13:36:02,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039808876] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:36:02,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:36:02,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-18 13:36:02,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945359500]
[2022-02-18 13:36:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:36:02,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-18 13:36:02,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:36:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-18 13:36:02,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-02-18 13:36:02,785 INFO L87 Difference]: Start difference. First operand 28487 states and 114320 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 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:36:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:36:03,300 INFO L93 Difference]: Finished difference Result 41240 states and 164945 transitions.
[2022-02-18 13:36:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-02-18 13:36:03,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 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 103
[2022-02-18 13:36:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:36:03,416 INFO L225 Difference]: With dead ends: 41240
[2022-02-18 13:36:03,416 INFO L226 Difference]: Without dead ends: 29432
[2022-02-18 13:36:03,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2022-02-18 13:36:03,417 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 141 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:36:03,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 1010 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:36:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29432 states.
[2022-02-18 13:36:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29432 to 28487.
[2022-02-18 13:36:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28487 states, 28486 states have (on average 3.965175875868848) internal successors, (112952), 28486 states have internal predecessors, (112952), 0 states have call successors, (0), 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:36:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28487 states to 28487 states and 112952 transitions.
[2022-02-18 13:36:04,672 INFO L78 Accepts]: Start accepts. Automaton has 28487 states and 112952 transitions. Word has length 103
[2022-02-18 13:36:04,672 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:36:04,672 INFO L470 AbstractCegarLoop]: Abstraction has 28487 states and 112952 transitions.
[2022-02-18 13:36:04,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 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:36:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 28487 states and 112952 transitions.
[2022-02-18 13:36:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2022-02-18 13:36:04,746 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:36:04,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:36:04,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-02-18 13:36:04,746 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:36:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:36:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash -434624705, now seen corresponding path program 2 times
[2022-02-18 13:36:04,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:36:04,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155384541]
[2022-02-18 13:36:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:36:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:36:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:36:05,070 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:36:05,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:36:05,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155384541]
[2022-02-18 13:36:05,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155384541] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:36:05,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:36:05,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-02-18 13:36:05,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331856570]
[2022-02-18 13:36:05,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:36:05,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-02-18 13:36:05,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:36:05,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-02-18 13:36:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2022-02-18 13:36:05,072 INFO L87 Difference]: Start difference. First operand 28487 states and 112952 transitions. Second operand has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 0 states have call successors, (0), 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:36:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:36:05,770 INFO L93 Difference]: Finished difference Result 45677 states and 179258 transitions.
[2022-02-18 13:36:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-18 13:36:05,771 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 0 states have call successors, (0), 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 103
[2022-02-18 13:36:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:36:06,206 INFO L225 Difference]: With dead ends: 45677
[2022-02-18 13:36:06,206 INFO L226 Difference]: Without dead ends: 36506
[2022-02-18 13:36:06,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420
[2022-02-18 13:36:06,207 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 460 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:36:06,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 1306 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:36:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36506 states.
[2022-02-18 13:36:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36506 to 31231.
[2022-02-18 13:36:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31231 states, 31230 states have (on average 3.939737431956452) internal successors, (123038), 31230 states have internal predecessors, (123038), 0 states have call successors, (0), 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:36:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31231 states to 31231 states and 123038 transitions.
[2022-02-18 13:36:07,199 INFO L78 Accepts]: Start accepts. Automaton has 31231 states and 123038 transitions. Word has length 103
[2022-02-18 13:36:07,199 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:36:07,199 INFO L470 AbstractCegarLoop]: Abstraction has 31231 states and 123038 transitions.
[2022-02-18 13:36:07,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 0 states have call successors, (0), 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:36:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 31231 states and 123038 transitions.
[2022-02-18 13:36:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2022-02-18 13:36:07,275 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:36:07,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:36:07,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-02-18 13:36:07,276 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:36:07,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:36:07,276 INFO L85 PathProgramCache]: Analyzing trace with hash 912851037, now seen corresponding path program 3 times
[2022-02-18 13:36:07,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:36:07,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226035406]
[2022-02-18 13:36:07,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:36:07,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:36:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:36:07,406 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:36:07,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:36:07,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226035406]
[2022-02-18 13:36:07,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226035406] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:36:07,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:36:07,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-02-18 13:36:07,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154300368]
[2022-02-18 13:36:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:36:07,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-02-18 13:36:07,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:36:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-02-18 13:36:07,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2022-02-18 13:36:07,408 INFO L87 Difference]: Start difference. First operand 31231 states and 123038 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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:36:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:36:08,238 INFO L93 Difference]: Finished difference Result 26344 states and 103436 transitions.
[2022-02-18 13:36:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-18 13:36:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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 103
[2022-02-18 13:36:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:36:08,289 INFO L225 Difference]: With dead ends: 26344
[2022-02-18 13:36:08,290 INFO L226 Difference]: Without dead ends: 12261
[2022-02-18 13:36:08,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2022-02-18 13:36:08,290 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 658 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:36:08,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [658 Valid, 649 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:36:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12261 states.
[2022-02-18 13:36:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12261 to 10461.
[2022-02-18 13:36:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10461 states, 10460 states have (on average 3.8858508604206503) internal successors, (40646), 10460 states have internal predecessors, (40646), 0 states have call successors, (0), 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:36:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10461 states to 10461 states and 40646 transitions.
[2022-02-18 13:36:08,552 INFO L78 Accepts]: Start accepts. Automaton has 10461 states and 40646 transitions. Word has length 103
[2022-02-18 13:36:08,553 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:36:08,553 INFO L470 AbstractCegarLoop]: Abstraction has 10461 states and 40646 transitions.
[2022-02-18 13:36:08,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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:36:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 10461 states and 40646 transitions.
[2022-02-18 13:36:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2022-02-18 13:36:08,574 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:36:08,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:36:08,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-02-18 13:36:08,574 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:36:08,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:36:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash 720541019, now seen corresponding path program 1 times
[2022-02-18 13:36:08,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:36:08,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833698119]
[2022-02-18 13:36:08,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:36:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:36:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:36:08,691 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:36:08,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:36:08,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833698119]
[2022-02-18 13:36:08,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833698119] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:36:08,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:36:08,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-18 13:36:08,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693957313]
[2022-02-18 13:36:08,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:36:08,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-18 13:36:08,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:36:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-18 13:36:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-02-18 13:36:08,693 INFO L87 Difference]: Start difference. First operand 10461 states and 40646 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:36:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:36:08,935 INFO L93 Difference]: Finished difference Result 15010 states and 57553 transitions.
[2022-02-18 13:36:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-02-18 13:36:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108
[2022-02-18 13:36:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:36:08,965 INFO L225 Difference]: With dead ends: 15010
[2022-02-18 13:36:08,966 INFO L226 Difference]: Without dead ends: 7509
[2022-02-18 13:36:08,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2022-02-18 13:36:08,967 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 110 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:36:08,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 880 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:36:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7509 states.
[2022-02-18 13:36:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7509 to 7509.
[2022-02-18 13:36:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7509 states, 7508 states have (on average 3.74746936600959) internal successors, (28136), 7508 states have internal predecessors, (28136), 0 states have call successors, (0), 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:36:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 28136 transitions.
[2022-02-18 13:36:09,500 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 28136 transitions. Word has length 108
[2022-02-18 13:36:09,500 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:36:09,500 INFO L470 AbstractCegarLoop]: Abstraction has 7509 states and 28136 transitions.
[2022-02-18 13:36:09,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:36:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 28136 transitions.
[2022-02-18 13:36:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2022-02-18 13:36:09,518 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:36:09,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:36:09,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-02-18 13:36:09,519 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:36:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:36:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash -525019425, now seen corresponding path program 2 times
[2022-02-18 13:36:09,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:36:09,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393509244]
[2022-02-18 13:36:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:36:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:36:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:36:09,623 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:36:09,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:36:09,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393509244]
[2022-02-18 13:36:09,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393509244] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:36:09,623 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:36:09,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-18 13:36:09,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661746816]
[2022-02-18 13:36:09,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:36:09,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-18 13:36:09,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:36:09,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-18 13:36:09,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-18 13:36:09,625 INFO L87 Difference]: Start difference. First operand 7509 states and 28136 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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:36:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:36:09,787 INFO L93 Difference]: Finished difference Result 11004 states and 41101 transitions.
[2022-02-18 13:36:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-18 13:36:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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 108
[2022-02-18 13:36:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:36:09,804 INFO L225 Difference]: With dead ends: 11004
[2022-02-18 13:36:09,804 INFO L226 Difference]: Without dead ends: 4611
[2022-02-18 13:36:09,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2022-02-18 13:36:09,807 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 54 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-18 13:36:09,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 660 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-18 13:36:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states.
[2022-02-18 13:36:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4611.
[2022-02-18 13:36:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4611 states, 4610 states have (on average 3.5405639913232103) internal successors, (16322), 4610 states have internal predecessors, (16322), 0 states have call successors, (0), 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:36:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4611 states to 4611 states and 16322 transitions.
[2022-02-18 13:36:09,924 INFO L78 Accepts]: Start accepts. Automaton has 4611 states and 16322 transitions. Word has length 108
[2022-02-18 13:36:09,924 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:36:09,925 INFO L470 AbstractCegarLoop]: Abstraction has 4611 states and 16322 transitions.
[2022-02-18 13:36:09,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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:36:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4611 states and 16322 transitions.
[2022-02-18 13:36:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2022-02-18 13:36:09,935 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:36:09,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:36:09,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-02-18 13:36:09,936 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:36:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:36:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1775976807, now seen corresponding path program 3 times
[2022-02-18 13:36:09,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:36:09,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367481503]
[2022-02-18 13:36:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:36:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:36:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:36:10,323 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:36:10,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:36:10,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367481503]
[2022-02-18 13:36:10,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367481503] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:36:10,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:36:10,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-02-18 13:36:10,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013064503]
[2022-02-18 13:36:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:36:10,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-02-18 13:36:10,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:36:10,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-02-18 13:36:10,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240
[2022-02-18 13:36:10,325 INFO L87 Difference]: Start difference. First operand 4611 states and 16322 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 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:36:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:36:10,740 INFO L93 Difference]: Finished difference Result 7164 states and 25908 transitions.
[2022-02-18 13:36:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-18 13:36:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 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 108
[2022-02-18 13:36:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:36:10,754 INFO L225 Difference]: With dead ends: 7164
[2022-02-18 13:36:10,754 INFO L226 Difference]: Without dead ends: 4767
[2022-02-18 13:36:10,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462
[2022-02-18 13:36:10,755 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 509 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:36:10,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 1257 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:36:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4767 states.
[2022-02-18 13:36:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4767 to 4467.
[2022-02-18 13:36:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4467 states, 4466 states have (on average 3.5364979847738467) internal successors, (15794), 4466 states have internal predecessors, (15794), 0 states have call successors, (0), 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:36:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 15794 transitions.
[2022-02-18 13:36:10,839 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 15794 transitions. Word has length 108
[2022-02-18 13:36:10,839 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:36:10,839 INFO L470 AbstractCegarLoop]: Abstraction has 4467 states and 15794 transitions.
[2022-02-18 13:36:10,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 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:36:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 15794 transitions.
[2022-02-18 13:36:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2022-02-18 13:36:10,847 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:36:10,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:36:10,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-02-18 13:36:10,848 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:36:10,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:36:10,848 INFO L85 PathProgramCache]: Analyzing trace with hash 830402201, now seen corresponding path program 4 times
[2022-02-18 13:36:10,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:36:10,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042177278]
[2022-02-18 13:36:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:36:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:36:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-18 13:36:11,255 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:36:11,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-18 13:36:11,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042177278]
[2022-02-18 13:36:11,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042177278] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-18 13:36:11,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-18 13:36:11,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-02-18 13:36:11,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151465975]
[2022-02-18 13:36:11,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-18 13:36:11,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-02-18 13:36:11,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-18 13:36:11,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-02-18 13:36:11,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240
[2022-02-18 13:36:11,257 INFO L87 Difference]: Start difference. First operand 4467 states and 15794 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 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:36:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-18 13:36:11,608 INFO L93 Difference]: Finished difference Result 7020 states and 25380 transitions.
[2022-02-18 13:36:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-18 13:36:11,609 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 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 108
[2022-02-18 13:36:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-18 13:36:11,621 INFO L225 Difference]: With dead ends: 7020
[2022-02-18 13:36:11,622 INFO L226 Difference]: Without dead ends: 3887
[2022-02-18 13:36:11,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462
[2022-02-18 13:36:11,623 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 369 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-18 13:36:11,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 1391 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-18 13:36:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states.
[2022-02-18 13:36:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3887.
[2022-02-18 13:36:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3887 states, 3886 states have (on average 3.5826042202779207) internal successors, (13922), 3886 states have internal predecessors, (13922), 0 states have call successors, (0), 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:36:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3887 states to 3887 states and 13922 transitions.
[2022-02-18 13:36:11,719 INFO L78 Accepts]: Start accepts. Automaton has 3887 states and 13922 transitions. Word has length 108
[2022-02-18 13:36:11,719 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-18 13:36:11,719 INFO L470 AbstractCegarLoop]: Abstraction has 3887 states and 13922 transitions.
[2022-02-18 13:36:11,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 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:36:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3887 states and 13922 transitions.
[2022-02-18 13:36:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2022-02-18 13:36:11,728 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-18 13:36:11,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:36:11,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-02-18 13:36:11,728 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] ===
[2022-02-18 13:36:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-18 13:36:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash 917241497, now seen corresponding path program 5 times
[2022-02-18 13:36:11,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-18 13:36:11,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743756291]
[2022-02-18 13:36:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-18 13:36:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-18 13:36:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-18 13:36:11,785 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-18 13:36:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-18 13:36:11,898 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-18 13:36:11,898 INFO L628 BasicCegarLoop]: Counterexample is feasible
[2022-02-18 13:36:11,899 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2022-02-18 13:36:11,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2022-02-18 13:36:11,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining)
[2022-02-18 13:36:11,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining)
[2022-02-18 13:36:11,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining)
[2022-02-18 13:36:11,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining)
[2022-02-18 13:36:11,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2022-02-18 13:36:11,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-02-18 13:36:11,905 INFO L732 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-18 13:36:11,911 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-02-18 13:36:11,911 INFO L180 ceAbstractionStarter]: Computing trace abstraction results
[2022-02-18 13:36:12,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:36:12 BasicIcfg
[2022-02-18 13:36:12,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-02-18 13:36:12,070 INFO L158 Benchmark]: Toolchain (without parser) took 86402.91ms. Allocated memory was 180.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 128.4MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB.
[2022-02-18 13:36:12,071 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-02-18 13:36:12,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.34ms. Allocated memory was 180.4MB in the beginning and 224.4MB in the end (delta: 44.0MB). Free memory was 128.1MB in the beginning and 186.4MB in the end (delta: -58.3MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB.
[2022-02-18 13:36:12,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.34ms. Allocated memory is still 224.4MB. Free memory was 186.4MB in the beginning and 183.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2022-02-18 13:36:12,071 INFO L158 Benchmark]: Boogie Preprocessor took 60.48ms. Allocated memory is still 224.4MB. Free memory was 183.3MB in the beginning and 181.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-02-18 13:36:12,071 INFO L158 Benchmark]: RCFGBuilder took 1252.11ms. Allocated memory is still 224.4MB. Free memory was 181.2MB in the beginning and 163.3MB in the end (delta: 17.9MB). Peak memory consumption was 61.4MB. Max. memory is 8.0GB.
[2022-02-18 13:36:12,072 INFO L158 Benchmark]: TraceAbstraction took 84477.36ms. Allocated memory was 224.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 162.8MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB.
[2022-02-18 13:36:12,073 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 540.34ms. Allocated memory was 180.4MB in the beginning and 224.4MB in the end (delta: 44.0MB). Free memory was 128.1MB in the beginning and 186.4MB in the end (delta: -58.3MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 65.34ms. Allocated memory is still 224.4MB. Free memory was 186.4MB in the beginning and 183.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 60.48ms. Allocated memory is still 224.4MB. Free memory was 183.3MB in the beginning and 181.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 1252.11ms. Allocated memory is still 224.4MB. Free memory was 181.2MB in the beginning and 163.3MB in the end (delta: 17.9MB). Peak memory consumption was 61.4MB. Max. memory is 8.0GB.
* TraceAbstraction took 84477.36ms. Allocated memory was 224.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 162.8MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L712] 0 int __unbuffered_p1_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0]
[L714] 0 int __unbuffered_p3_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0]
[L716] 0 int __unbuffered_p3_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0]
[L718] 0 int a = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0]
[L720] 0 int b = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0]
[L721] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0]
[L722] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L724] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L725] 0 _Bool x$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L726] 0 int x$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L727] 0 _Bool x$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L728] 0 _Bool x$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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]
[L729] 0 _Bool x$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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]
[L730] 0 _Bool x$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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]
[L731] 0 _Bool x$r_buff0_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0]
[L732] 0 _Bool x$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0]
[L733] 0 _Bool x$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L734] 0 _Bool x$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L735] 0 _Bool x$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L736] 0 _Bool x$r_buff1_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0]
[L737] 0 _Bool x$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0]
[L738] 0 int *x$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L739] 0 int x$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L740] 0 _Bool x$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L741] 0 int x$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L742] 0 _Bool x$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L744] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L746] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L747] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L748] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L856] 0 pthread_t t1185;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-3, t1185={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L858] 0 pthread_t t1186;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=-2, t1185={5:0}, t1186={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L860] 0 pthread_t t1187;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=-1, t1185={5:0}, t1186={6:0}, t1187={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L862] 0 pthread_t t1188;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L772] 2 x$w_buff1 = x$w_buff0
[L773] 2 x$w_buff0 = 2
[L774] 2 x$w_buff1_used = x$w_buff0_used
[L775] 2 x$w_buff0_used = (_Bool)1
[L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4
[L782] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L785] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L802] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L805] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L822] 4 z = 2
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L825] 4 a = 1
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L828] 4 __unbuffered_p3_EAX = a
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L831] 4 __unbuffered_p3_EBX = b
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L834] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x
[L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L752] 1 b = 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L755] 1 x = 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L788] 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)
[L788] 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)
[L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L790] 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
[L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L792] 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
[L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L758] 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)
[L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L758] 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)
[L758] 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)
[L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L760] 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
[L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L762] 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
[L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L867] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L867] RET 0 assume_abort_if_not(main$tmp_guard0)
[L869] 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)
[L869] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L869] 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)
[L869] 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)
[L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L871] 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
[L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L873] 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
[L876] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L877] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L878] 0 x$flush_delayed = weak$$choice2
[L879] 0 x$mem_tmp = x
[L880] 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)
[L880] 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)
[L881] 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))
[L881] 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))
[L882] 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))
[L882] 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))
[L883] 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))
[L883] 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))
[L884] 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))
[L884] 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))
[L885] 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))
[L885] 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))
[L886] 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))
[L886] 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))
[L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L888] EXPR 0 x$flush_delayed ? x$mem_tmp : x
[L888] 0 x = x$flush_delayed ? x$mem_tmp : x
[L889] 0 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=49, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L891] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
[L18] 0 reach_error()
VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2]
- 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: 863]: 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: 859]: 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: 861]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 9 procedures, 177 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 84.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 3.0s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5715 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5715 mSDsluCounter, 14719 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12727 mSDsCounter, 410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2623 IncrementalHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 410 mSolverCounterUnsat, 2936 mSDtfsCounter, 2623 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142880occurred in iteration=0, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 13616 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1736 NumberOfCodeBlocks, 1736 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1611 ConstructedInterpolants, 0 QuantifiedInterpolants, 9663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:36:12,112 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...