/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/mix046.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 14:50:30,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 14:50:30,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 14:50:30,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 14:50:30,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 14:50:30,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 14:50:30,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 14:50:30,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 14:50:30,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 14:50:30,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 14:50:30,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 14:50:30,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 14:50:30,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 14:50:30,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 14:50:30,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 14:50:30,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 14:50:30,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 14:50:30,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 14:50:30,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 14:50:30,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 14:50:30,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 14:50:30,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 14:50:30,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 14:50:30,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 14:50:30,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 14:50:30,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 14:50:30,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 14:50:30,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 14:50:30,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 14:50:30,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 14:50:30,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 14:50:30,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 14:50:30,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 14:50:30,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 14:50:30,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 14:50:30,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 14:50:30,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 14:50:30,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 14:50:30,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 14:50:30,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 14:50:30,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 14:50:30,441 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-03-01 14:50:30,459 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 14:50:30,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 14:50:30,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 14:50:30,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 14:50:30,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 14:50:30,460 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 14:50:30,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 14:50:30,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 14:50:30,460 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 14:50:30,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 14:50:30,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 14:50:30,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 14:50:30,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 14:50:30,462 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 14:50:30,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 14:50:30,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:50:30,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 14:50:30,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 14:50:30,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 14:50:30,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 14:50:30,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 14:50:30,462 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 14:50:30,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 14:50:30,463 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-03-01 14:50:30,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 14:50:30,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 14:50:30,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 14:50:30,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 14:50:30,653 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 14:50:30,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-03-01 14:50:30,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba334919/d6033a5ec1f340d5a61ab1f0dc2db30c/FLAG21b9885a0 [2022-03-01 14:50:31,140 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 14:50:31,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-03-01 14:50:31,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba334919/d6033a5ec1f340d5a61ab1f0dc2db30c/FLAG21b9885a0 [2022-03-01 14:50:31,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba334919/d6033a5ec1f340d5a61ab1f0dc2db30c [2022-03-01 14:50:31,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 14:50:31,565 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 14:50:31,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 14:50:31,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 14:50:31,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 14:50:31,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:50:31" (1/1) ... [2022-03-01 14:50:31,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce12982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:31, skipping insertion in model container [2022-03-01 14:50:31,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:50:31" (1/1) ... [2022-03-01 14:50:31,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 14:50:31,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 14:50:31,755 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/mix046.opt.i[944,957] [2022-03-01 14:50:31,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:50:31,929 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 14:50:31,941 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/mix046.opt.i[944,957] [2022-03-01 14:50:31,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:50:32,000 INFO L208 MainTranslator]: Completed translation [2022-03-01 14:50:32,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32 WrapperNode [2022-03-01 14:50:32,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 14:50:32,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 14:50:32,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 14:50:32,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 14:50:32,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,044 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 298 [2022-03-01 14:50:32,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 14:50:32,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 14:50:32,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 14:50:32,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 14:50:32,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 14:50:32,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 14:50:32,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 14:50:32,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 14:50:32,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (1/1) ... [2022-03-01 14:50:32,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:50:32,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:50:32,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 14:50:32,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 14:50:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 14:50:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 14:50:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 14:50:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 14:50:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 14:50:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-01 14:50:32,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-01 14:50:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-01 14:50:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-01 14:50:32,146 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-01 14:50:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-01 14:50:32,146 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-03-01 14:50:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-03-01 14:50:32,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 14:50:32,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 14:50:32,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 14:50:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 14:50:32,147 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 14:50:32,302 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 14:50:32,304 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 14:50:32,655 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 14:50:32,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 14:50:32,918 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-01 14:50:32,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:50:32 BoogieIcfgContainer [2022-03-01 14:50:32,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 14:50:32,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 14:50:32,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 14:50:32,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 14:50:32,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 02:50:31" (1/3) ... [2022-03-01 14:50:32,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e9f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:50:32, skipping insertion in model container [2022-03-01 14:50:32,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:50:32" (2/3) ... [2022-03-01 14:50:32,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e9f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:50:32, skipping insertion in model container [2022-03-01 14:50:32,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:50:32" (3/3) ... [2022-03-01 14:50:32,928 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2022-03-01 14:50:32,932 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 14:50:32,932 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 14:50:32,932 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-01 14:50:32,932 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 14:50:32,980 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,980 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,980 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,981 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,981 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,981 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,982 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,982 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,982 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,982 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,982 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,982 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,984 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,985 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,985 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,985 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,985 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,985 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,986 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,986 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,986 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,986 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,987 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,987 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,987 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,987 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,988 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,988 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,988 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,988 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,988 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,988 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,989 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,989 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,989 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,989 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,989 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,990 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,990 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,990 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,991 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,991 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,991 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,991 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,991 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,991 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,991 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,992 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,992 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,992 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,992 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,992 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,992 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,992 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,993 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,993 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,993 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,993 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,993 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,994 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,994 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,994 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,994 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,994 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,994 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,994 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,995 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,995 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,996 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,996 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,996 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,996 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,996 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,997 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,998 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,998 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:32,998 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,001 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,002 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,003 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,006 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,010 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,010 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,011 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,011 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,011 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,011 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,011 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,011 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,012 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,012 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,013 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,013 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,013 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,013 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:50:33,015 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 14:50:33,065 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 14:50:33,073 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-03-01 14:50:33,074 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-01 14:50:33,086 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 137 transitions, 294 flow [2022-03-01 14:50:36,191 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 102752 states, 102749 states have (on average 4.4352061820553) internal successors, (455713), 102751 states have internal predecessors, (455713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:50:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 102752 states, 102749 states have (on average 4.4352061820553) internal successors, (455713), 102751 states have internal predecessors, (455713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:50:36,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-01 14:50:36,620 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:50:36,621 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] [2022-03-01 14:50:36,621 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:50:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:50:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1364924999, now seen corresponding path program 1 times [2022-03-01 14:50:36,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:50:36,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534349088] [2022-03-01 14:50:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:50:36,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:50:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:50:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:50:36,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:50:36,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534349088] [2022-03-01 14:50:36,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534349088] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:50:36,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:50:36,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 14:50:36,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955475731] [2022-03-01 14:50:36,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:50:36,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 14:50:36,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:50:36,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 14:50:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:50:37,252 INFO L87 Difference]: Start difference. First operand has 102752 states, 102749 states have (on average 4.4352061820553) internal successors, (455713), 102751 states have internal predecessors, (455713), 0 states have call successors, (0), 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 35.5) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:50:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:50:38,840 INFO L93 Difference]: Finished difference Result 88640 states and 386245 transitions. [2022-03-01 14:50:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 14:50:38,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-03-01 14:50:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:50:39,758 INFO L225 Difference]: With dead ends: 88640 [2022-03-01 14:50:39,759 INFO L226 Difference]: Without dead ends: 73744 [2022-03-01 14:50:39,760 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-03-01 14:50:39,769 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 14:50:39,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 194 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 14:50:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73744 states. [2022-03-01 14:50:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73744 to 73744. [2022-03-01 14:50:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73744 states, 73743 states have (on average 4.390423497823522) internal successors, (323763), 73743 states have internal predecessors, (323763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:50:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73744 states to 73744 states and 323763 transitions. [2022-03-01 14:50:43,771 INFO L78 Accepts]: Start accepts. Automaton has 73744 states and 323763 transitions. Word has length 71 [2022-03-01 14:50:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:50:43,772 INFO L470 AbstractCegarLoop]: Abstraction has 73744 states and 323763 transitions. [2022-03-01 14:50:43,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:50:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 73744 states and 323763 transitions. [2022-03-01 14:50:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-03-01 14:50:43,884 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:50:43,884 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-03-01 14:50:43,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 14:50:43,885 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:50:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:50:43,887 INFO L85 PathProgramCache]: Analyzing trace with hash -836884992, now seen corresponding path program 1 times [2022-03-01 14:50:43,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:50:43,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888933919] [2022-03-01 14:50:43,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:50:43,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:50:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:50:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:50:44,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:50:44,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888933919] [2022-03-01 14:50:44,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888933919] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:50:44,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:50:44,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 14:50:44,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503135426] [2022-03-01 14:50:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:50:44,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 14:50:44,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:50:44,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 14:50:44,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 14:50:44,120 INFO L87 Difference]: Start difference. First operand 73744 states and 323763 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-03-01 14:50:45,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:50:45,350 INFO L93 Difference]: Finished difference Result 82368 states and 359029 transitions. [2022-03-01 14:50:45,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 14:50:45,351 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-03-01 14:50:45,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:50:45,968 INFO L225 Difference]: With dead ends: 82368 [2022-03-01 14:50:45,969 INFO L226 Difference]: Without dead ends: 62768 [2022-03-01 14:50:45,969 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-03-01 14:50:45,970 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 176 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:50:45,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 671 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:50:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62768 states. [2022-03-01 14:50:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62768 to 62768. [2022-03-01 14:50:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62768 states, 62767 states have (on average 4.355648668886516) internal successors, (273391), 62767 states have internal predecessors, (273391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:50:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62768 states to 62768 states and 273391 transitions. [2022-03-01 14:50:48,970 INFO L78 Accepts]: Start accepts. Automaton has 62768 states and 273391 transitions. Word has length 86 [2022-03-01 14:50:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:50:48,970 INFO L470 AbstractCegarLoop]: Abstraction has 62768 states and 273391 transitions. [2022-03-01 14:50:48,971 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-03-01 14:50:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 62768 states and 273391 transitions. [2022-03-01 14:50:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-01 14:50:49,106 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:50:49,106 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-03-01 14:50:49,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 14:50:49,107 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:50:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:50:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1307844733, now seen corresponding path program 1 times [2022-03-01 14:50:49,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:50:49,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675104036] [2022-03-01 14:50:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:50:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:50:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:50:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:50:49,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:50:49,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675104036] [2022-03-01 14:50:49,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675104036] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:50:49,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:50:49,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 14:50:49,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051437140] [2022-03-01 14:50:49,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:50:49,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 14:50:49,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:50:49,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 14:50:49,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 14:50:49,265 INFO L87 Difference]: Start difference. First operand 62768 states and 273391 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-03-01 14:50:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:50:50,320 INFO L93 Difference]: Finished difference Result 72764 states and 315027 transitions. [2022-03-01 14:50:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 14:50:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-03-01 14:50:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:50:50,915 INFO L225 Difference]: With dead ends: 72764 [2022-03-01 14:50:50,916 INFO L226 Difference]: Without dead ends: 61004 [2022-03-01 14:50:50,916 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-03-01 14:50:50,917 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 147 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:50:50,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 671 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:50:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61004 states. [2022-03-01 14:50:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61004 to 61004. [2022-03-01 14:50:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61004 states, 61003 states have (on average 4.3459665918069605) internal successors, (265117), 61003 states have internal predecessors, (265117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:50:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61004 states to 61004 states and 265117 transitions. [2022-03-01 14:50:53,839 INFO L78 Accepts]: Start accepts. Automaton has 61004 states and 265117 transitions. Word has length 90 [2022-03-01 14:50:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:50:53,840 INFO L470 AbstractCegarLoop]: Abstraction has 61004 states and 265117 transitions. [2022-03-01 14:50:53,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-03-01 14:50:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 61004 states and 265117 transitions. [2022-03-01 14:50:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-01 14:50:53,947 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:50:53,948 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-03-01 14:50:53,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 14:50:53,948 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:50:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:50:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1519518654, now seen corresponding path program 1 times [2022-03-01 14:50:53,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:50:53,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975944563] [2022-03-01 14:50:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:50:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:50:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:50:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:50:54,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:50:54,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975944563] [2022-03-01 14:50:54,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975944563] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:50:54,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:50:54,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 14:50:54,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106540821] [2022-03-01 14:50:54,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:50:54,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 14:50:54,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:50:54,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 14:50:54,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:50:54,224 INFO L87 Difference]: Start difference. First operand 61004 states and 265117 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-03-01 14:50:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:50:55,337 INFO L93 Difference]: Finished difference Result 70034 states and 302481 transitions. [2022-03-01 14:50:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 14:50:55,338 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-03-01 14:50:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:50:55,914 INFO L225 Difference]: With dead ends: 70034 [2022-03-01 14:50:55,915 INFO L226 Difference]: Without dead ends: 59534 [2022-03-01 14:50:55,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-01 14:50:55,916 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 384 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:50:55,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 1100 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:50:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59534 states. [2022-03-01 14:50:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59534 to 59534. [2022-03-01 14:50:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59534 states, 59533 states have (on average 4.33828296910957) internal successors, (258271), 59533 states have internal predecessors, (258271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:50:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59534 states to 59534 states and 258271 transitions. [2022-03-01 14:50:58,418 INFO L78 Accepts]: Start accepts. Automaton has 59534 states and 258271 transitions. Word has length 92 [2022-03-01 14:50:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:50:58,419 INFO L470 AbstractCegarLoop]: Abstraction has 59534 states and 258271 transitions. [2022-03-01 14:50:58,421 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-03-01 14:50:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 59534 states and 258271 transitions. [2022-03-01 14:50:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 14:50:58,593 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:50:58,594 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-03-01 14:50:58,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 14:50:58,594 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:50:58,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:50:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1496523180, now seen corresponding path program 1 times [2022-03-01 14:50:58,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:50:58,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678748314] [2022-03-01 14:50:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:50:58,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:50:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:50:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:50:58,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:50:58,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678748314] [2022-03-01 14:50:58,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678748314] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:50:58,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:50:58,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-01 14:50:58,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884123383] [2022-03-01 14:50:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:50:58,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 14:50:58,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:50:58,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 14:50:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-01 14:50:58,878 INFO L87 Difference]: Start difference. First operand 59534 states and 258271 transitions. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 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-03-01 14:51:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:00,040 INFO L93 Difference]: Finished difference Result 79624 states and 345288 transitions. [2022-03-01 14:51:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 14:51:00,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 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-03-01 14:51:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:00,704 INFO L225 Difference]: With dead ends: 79624 [2022-03-01 14:51:00,704 INFO L226 Difference]: Without dead ends: 70314 [2022-03-01 14:51:00,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-03-01 14:51:00,719 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 335 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:00,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 1433 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 14:51:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2022-03-01 14:51:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 70314. [2022-03-01 14:51:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70314 states, 70313 states have (on average 4.351329057215593) internal successors, (305955), 70313 states have internal predecessors, (305955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70314 states to 70314 states and 305955 transitions. [2022-03-01 14:51:03,712 INFO L78 Accepts]: Start accepts. Automaton has 70314 states and 305955 transitions. Word has length 93 [2022-03-01 14:51:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:03,713 INFO L470 AbstractCegarLoop]: Abstraction has 70314 states and 305955 transitions. [2022-03-01 14:51:03,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 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-03-01 14:51:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 70314 states and 305955 transitions. [2022-03-01 14:51:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 14:51:03,889 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:03,889 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-03-01 14:51:03,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 14:51:03,890 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash 95497702, now seen corresponding path program 2 times [2022-03-01 14:51:03,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:03,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599679384] [2022-03-01 14:51:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:04,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:04,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599679384] [2022-03-01 14:51:04,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599679384] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:04,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:04,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 14:51:04,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468651945] [2022-03-01 14:51:04,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:04,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 14:51:04,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 14:51:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-01 14:51:04,097 INFO L87 Difference]: Start difference. First operand 70314 states and 305955 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-03-01 14:51:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:05,713 INFO L93 Difference]: Finished difference Result 81486 states and 353037 transitions. [2022-03-01 14:51:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 14:51:05,714 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-03-01 14:51:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:06,173 INFO L225 Difference]: With dead ends: 81486 [2022-03-01 14:51:06,173 INFO L226 Difference]: Without dead ends: 73156 [2022-03-01 14:51:06,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-03-01 14:51:06,174 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 443 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:06,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 1165 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:51:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73156 states. [2022-03-01 14:51:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73156 to 69628. [2022-03-01 14:51:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69628 states, 69627 states have (on average 4.340011777040516) internal successors, (302182), 69627 states have internal predecessors, (302182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69628 states to 69628 states and 302182 transitions. [2022-03-01 14:51:09,457 INFO L78 Accepts]: Start accepts. Automaton has 69628 states and 302182 transitions. Word has length 93 [2022-03-01 14:51:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:09,457 INFO L470 AbstractCegarLoop]: Abstraction has 69628 states and 302182 transitions. [2022-03-01 14:51:09,457 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-03-01 14:51:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 69628 states and 302182 transitions. [2022-03-01 14:51:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-01 14:51:09,651 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:09,651 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-03-01 14:51:09,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 14:51:09,652 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1464675601, now seen corresponding path program 1 times [2022-03-01 14:51:09,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:09,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026442038] [2022-03-01 14:51:09,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:10,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:10,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026442038] [2022-03-01 14:51:10,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026442038] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:10,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:10,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-01 14:51:10,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065048135] [2022-03-01 14:51:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:10,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-01 14:51:10,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:10,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-01 14:51:10,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-01 14:51:10,563 INFO L87 Difference]: Start difference. First operand 69628 states and 302182 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-03-01 14:51:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:11,878 INFO L93 Difference]: Finished difference Result 88052 states and 381688 transitions. [2022-03-01 14:51:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 14:51:11,879 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-03-01 14:51:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:12,287 INFO L225 Difference]: With dead ends: 88052 [2022-03-01 14:51:12,287 INFO L226 Difference]: Without dead ends: 82172 [2022-03-01 14:51:12,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-01 14:51:12,288 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 379 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:12,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 1569 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:51:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82172 states. [2022-03-01 14:51:14,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82172 to 71784. [2022-03-01 14:51:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71784 states, 71783 states have (on average 4.348522630706435) internal successors, (312150), 71783 states have internal predecessors, (312150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71784 states to 71784 states and 312150 transitions. [2022-03-01 14:51:15,704 INFO L78 Accepts]: Start accepts. Automaton has 71784 states and 312150 transitions. Word has length 94 [2022-03-01 14:51:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:15,704 INFO L470 AbstractCegarLoop]: Abstraction has 71784 states and 312150 transitions. [2022-03-01 14:51:15,705 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-03-01 14:51:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 71784 states and 312150 transitions. [2022-03-01 14:51:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-01 14:51:15,875 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:15,875 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-03-01 14:51:15,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 14:51:15,875 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash -3109795, now seen corresponding path program 1 times [2022-03-01 14:51:15,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:15,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055354557] [2022-03-01 14:51:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:15,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:15,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055354557] [2022-03-01 14:51:15,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055354557] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:15,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:15,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 14:51:15,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781910338] [2022-03-01 14:51:15,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:15,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 14:51:15,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:15,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 14:51:15,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 14:51:15,976 INFO L87 Difference]: Start difference. First operand 71784 states and 312150 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-03-01 14:51:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:17,009 INFO L93 Difference]: Finished difference Result 91016 states and 391003 transitions. [2022-03-01 14:51:17,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 14:51:17,010 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-03-01 14:51:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:17,336 INFO L225 Difference]: With dead ends: 91016 [2022-03-01 14:51:17,336 INFO L226 Difference]: Without dead ends: 65536 [2022-03-01 14:51:17,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:51:17,337 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 237 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:17,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 510 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:51:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65536 states. [2022-03-01 14:51:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65536 to 65536. [2022-03-01 14:51:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65536 states, 65535 states have (on average 4.286411841000992) internal successors, (280910), 65535 states have internal predecessors, (280910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65536 states to 65536 states and 280910 transitions. [2022-03-01 14:51:20,286 INFO L78 Accepts]: Start accepts. Automaton has 65536 states and 280910 transitions. Word has length 94 [2022-03-01 14:51:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:20,287 INFO L470 AbstractCegarLoop]: Abstraction has 65536 states and 280910 transitions. [2022-03-01 14:51:20,287 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-03-01 14:51:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 65536 states and 280910 transitions. [2022-03-01 14:51:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-01 14:51:20,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:20,457 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-03-01 14:51:20,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 14:51:20,457 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:20,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2018206925, now seen corresponding path program 1 times [2022-03-01 14:51:20,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:20,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163245000] [2022-03-01 14:51:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:20,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:20,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163245000] [2022-03-01 14:51:20,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163245000] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:20,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:20,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:51:20,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789168290] [2022-03-01 14:51:20,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:20,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:51:20,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:20,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:51:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:51:20,563 INFO L87 Difference]: Start difference. First operand 65536 states and 280910 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-03-01 14:51:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:21,537 INFO L93 Difference]: Finished difference Result 69286 states and 290295 transitions. [2022-03-01 14:51:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-01 14:51:21,538 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-03-01 14:51:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:21,749 INFO L225 Difference]: With dead ends: 69286 [2022-03-01 14:51:21,749 INFO L226 Difference]: Without dead ends: 47326 [2022-03-01 14:51:21,750 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-03-01 14:51:21,750 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 404 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:21,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 605 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:51:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47326 states. [2022-03-01 14:51:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47326 to 47326. [2022-03-01 14:51:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47326 states, 47325 states have (on average 4.140095087163233) internal successors, (195930), 47325 states have internal predecessors, (195930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47326 states to 47326 states and 195930 transitions. [2022-03-01 14:51:23,514 INFO L78 Accepts]: Start accepts. Automaton has 47326 states and 195930 transitions. Word has length 95 [2022-03-01 14:51:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:23,514 INFO L470 AbstractCegarLoop]: Abstraction has 47326 states and 195930 transitions. [2022-03-01 14:51:23,514 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-03-01 14:51:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 47326 states and 195930 transitions. [2022-03-01 14:51:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-03-01 14:51:23,612 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:23,612 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] [2022-03-01 14:51:23,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 14:51:23,612 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1741190506, now seen corresponding path program 1 times [2022-03-01 14:51:23,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:23,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891289453] [2022-03-01 14:51:23,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:23,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:23,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:23,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891289453] [2022-03-01 14:51:23,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891289453] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:23,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:23,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 14:51:23,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276270513] [2022-03-01 14:51:23,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:23,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 14:51:23,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 14:51:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 14:51:23,678 INFO L87 Difference]: Start difference. First operand 47326 states and 195930 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:24,665 INFO L93 Difference]: Finished difference Result 77401 states and 317720 transitions. [2022-03-01 14:51:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 14:51:24,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-03-01 14:51:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:24,884 INFO L225 Difference]: With dead ends: 77401 [2022-03-01 14:51:24,884 INFO L226 Difference]: Without dead ends: 49468 [2022-03-01 14:51:24,884 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-03-01 14:51:24,885 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 140 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:24,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 831 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:51:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49468 states. [2022-03-01 14:51:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49468 to 46192. [2022-03-01 14:51:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46192 states, 46191 states have (on average 4.059232317984023) internal successors, (187500), 46191 states have internal predecessors, (187500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46192 states to 46192 states and 187500 transitions. [2022-03-01 14:51:26,903 INFO L78 Accepts]: Start accepts. Automaton has 46192 states and 187500 transitions. Word has length 97 [2022-03-01 14:51:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:26,903 INFO L470 AbstractCegarLoop]: Abstraction has 46192 states and 187500 transitions. [2022-03-01 14:51:26,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 46192 states and 187500 transitions. [2022-03-01 14:51:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-01 14:51:27,039 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:27,040 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-03-01 14:51:27,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 14:51:27,040 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:27,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1653374646, now seen corresponding path program 1 times [2022-03-01 14:51:27,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:27,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690907992] [2022-03-01 14:51:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:27,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:27,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690907992] [2022-03-01 14:51:27,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690907992] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:27,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:27,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-01 14:51:27,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034896353] [2022-03-01 14:51:27,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:27,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-01 14:51:27,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:27,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-01 14:51:27,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-01 14:51:27,148 INFO L87 Difference]: Start difference. First operand 46192 states and 187500 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-03-01 14:51:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:27,607 INFO L93 Difference]: Finished difference Result 40333 states and 160338 transitions. [2022-03-01 14:51:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-01 14:51:27,608 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-03-01 14:51:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:27,716 INFO L225 Difference]: With dead ends: 40333 [2022-03-01 14:51:27,716 INFO L226 Difference]: Without dead ends: 27733 [2022-03-01 14:51:27,716 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-03-01 14:51:27,717 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 589 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:27,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 660 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:51:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27733 states. [2022-03-01 14:51:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27733 to 26221. [2022-03-01 14:51:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26221 states, 26220 states have (on average 3.922883295194508) internal successors, (102858), 26220 states have internal predecessors, (102858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26221 states to 26221 states and 102858 transitions. [2022-03-01 14:51:28,962 INFO L78 Accepts]: Start accepts. Automaton has 26221 states and 102858 transitions. Word has length 98 [2022-03-01 14:51:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:28,963 INFO L470 AbstractCegarLoop]: Abstraction has 26221 states and 102858 transitions. [2022-03-01 14:51:28,973 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-03-01 14:51:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26221 states and 102858 transitions. [2022-03-01 14:51:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-01 14:51:29,063 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:29,064 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] [2022-03-01 14:51:29,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 14:51:29,064 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash 986168180, now seen corresponding path program 1 times [2022-03-01 14:51:29,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:29,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977703087] [2022-03-01 14:51:29,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:29,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:29,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:29,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977703087] [2022-03-01 14:51:29,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977703087] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:29,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:29,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:51:29,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237313770] [2022-03-01 14:51:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:29,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:51:29,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:29,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:51:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:51:29,259 INFO L87 Difference]: Start difference. First operand 26221 states and 102858 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:29,749 INFO L93 Difference]: Finished difference Result 37684 states and 147361 transitions. [2022-03-01 14:51:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 14:51:29,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-03-01 14:51:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:29,900 INFO L225 Difference]: With dead ends: 37684 [2022-03-01 14:51:29,901 INFO L226 Difference]: Without dead ends: 21906 [2022-03-01 14:51:29,901 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-03-01 14:51:29,901 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 135 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:29,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 1014 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:51:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21906 states. [2022-03-01 14:51:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21906 to 20961. [2022-03-01 14:51:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20961 states, 20960 states have (on average 3.8416984732824426) internal successors, (80522), 20960 states have internal predecessors, (80522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20961 states to 20961 states and 80522 transitions. [2022-03-01 14:51:30,734 INFO L78 Accepts]: Start accepts. Automaton has 20961 states and 80522 transitions. Word has length 102 [2022-03-01 14:51:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:30,734 INFO L470 AbstractCegarLoop]: Abstraction has 20961 states and 80522 transitions. [2022-03-01 14:51:30,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20961 states and 80522 transitions. [2022-03-01 14:51:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-01 14:51:30,782 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:30,782 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] [2022-03-01 14:51:30,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 14:51:30,783 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash -757219490, now seen corresponding path program 2 times [2022-03-01 14:51:30,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:30,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33498991] [2022-03-01 14:51:30,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:30,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:30,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:30,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33498991] [2022-03-01 14:51:30,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33498991] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:30,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:30,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-01 14:51:30,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021425178] [2022-03-01 14:51:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:30,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 14:51:30,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 14:51:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-01 14:51:30,949 INFO L87 Difference]: Start difference. First operand 20961 states and 80522 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:31,530 INFO L93 Difference]: Finished difference Result 17100 states and 65024 transitions. [2022-03-01 14:51:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 14:51:31,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-03-01 14:51:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:31,557 INFO L225 Difference]: With dead ends: 17100 [2022-03-01 14:51:31,557 INFO L226 Difference]: Without dead ends: 8153 [2022-03-01 14:51:31,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-03-01 14:51:31,558 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 609 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:31,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [609 Valid, 633 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:51:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8153 states. [2022-03-01 14:51:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8153 to 7037. [2022-03-01 14:51:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7037 states, 7036 states have (on average 3.7498578737919273) internal successors, (26384), 7036 states have internal predecessors, (26384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7037 states to 7037 states and 26384 transitions. [2022-03-01 14:51:31,719 INFO L78 Accepts]: Start accepts. Automaton has 7037 states and 26384 transitions. Word has length 102 [2022-03-01 14:51:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:31,719 INFO L470 AbstractCegarLoop]: Abstraction has 7037 states and 26384 transitions. [2022-03-01 14:51:31,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 7037 states and 26384 transitions. [2022-03-01 14:51:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-03-01 14:51:31,732 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:31,732 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] [2022-03-01 14:51:31,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-01 14:51:31,733 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1327329248, now seen corresponding path program 1 times [2022-03-01 14:51:31,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:31,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906898319] [2022-03-01 14:51:31,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:31,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:31,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:31,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906898319] [2022-03-01 14:51:31,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906898319] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:31,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:31,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:51:31,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718604607] [2022-03-01 14:51:31,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:31,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:51:31,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:31,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:51:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:51:31,824 INFO L87 Difference]: Start difference. First operand 7037 states and 26384 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:31,970 INFO L93 Difference]: Finished difference Result 10130 states and 38067 transitions. [2022-03-01 14:51:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 14:51:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-03-01 14:51:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:31,983 INFO L225 Difference]: With dead ends: 10130 [2022-03-01 14:51:31,983 INFO L226 Difference]: Without dead ends: 3941 [2022-03-01 14:51:31,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:51:31,984 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 94 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:31,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 836 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:51:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2022-03-01 14:51:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3941. [2022-03-01 14:51:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3940 states have (on average 3.6644670050761423) internal successors, (14438), 3940 states have internal predecessors, (14438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 14438 transitions. [2022-03-01 14:51:32,060 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 14438 transitions. Word has length 106 [2022-03-01 14:51:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:32,060 INFO L470 AbstractCegarLoop]: Abstraction has 3941 states and 14438 transitions. [2022-03-01 14:51:32,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 14438 transitions. [2022-03-01 14:51:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-03-01 14:51:32,067 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:32,067 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] [2022-03-01 14:51:32,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-01 14:51:32,068 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2031295992, now seen corresponding path program 2 times [2022-03-01 14:51:32,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:32,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432228224] [2022-03-01 14:51:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:51:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:51:32,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:51:32,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432228224] [2022-03-01 14:51:32,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432228224] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:51:32,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:51:32,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-01 14:51:32,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125402657] [2022-03-01 14:51:32,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:51:32,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 14:51:32,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:51:32,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 14:51:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-01 14:51:32,285 INFO L87 Difference]: Start difference. First operand 3941 states and 14438 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:51:32,603 INFO L93 Difference]: Finished difference Result 5954 states and 21867 transitions. [2022-03-01 14:51:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-01 14:51:32,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-03-01 14:51:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:51:32,611 INFO L225 Difference]: With dead ends: 5954 [2022-03-01 14:51:32,612 INFO L226 Difference]: Without dead ends: 2933 [2022-03-01 14:51:32,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-03-01 14:51:32,612 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 223 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:51:32,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 968 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:51:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2022-03-01 14:51:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2933. [2022-03-01 14:51:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2932 states have (on average 3.5409276944065486) internal successors, (10382), 2932 states have internal predecessors, (10382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 10382 transitions. [2022-03-01 14:51:32,662 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 10382 transitions. Word has length 106 [2022-03-01 14:51:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:51:32,662 INFO L470 AbstractCegarLoop]: Abstraction has 2933 states and 10382 transitions. [2022-03-01 14:51:32,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:51:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 10382 transitions. [2022-03-01 14:51:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-03-01 14:51:32,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:51:32,667 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] [2022-03-01 14:51:32,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-01 14:51:32,667 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:51:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:51:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash -506188582, now seen corresponding path program 3 times [2022-03-01 14:51:32,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:51:32,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597206285] [2022-03-01 14:51:32,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:51:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:51:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 14:51:32,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 14:51:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 14:51:32,795 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 14:51:32,797 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 14:51:32,798 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-01 14:51:32,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-01 14:51:32,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-03-01 14:51:32,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-03-01 14:51:32,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-03-01 14:51:32,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-03-01 14:51:32,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-01 14:51:32,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-01 14:51:32,803 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:51:32,807 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 14:51:32,807 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 14:51:32,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 02:51:32 BasicIcfg [2022-03-01 14:51:32,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 14:51:32,936 INFO L158 Benchmark]: Toolchain (without parser) took 61371.11ms. Allocated memory was 185.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 134.4MB in the beginning and 6.7GB in the end (delta: -6.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-03-01 14:51:32,936 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 14:51:32,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.79ms. Allocated memory is still 185.6MB. Free memory was 134.3MB in the beginning and 149.2MB in the end (delta: -14.9MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-03-01 14:51:32,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.62ms. Allocated memory is still 185.6MB. Free memory was 149.2MB in the beginning and 146.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 14:51:32,936 INFO L158 Benchmark]: Boogie Preprocessor took 29.49ms. Allocated memory is still 185.6MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 14:51:32,937 INFO L158 Benchmark]: RCFGBuilder took 844.50ms. Allocated memory was 185.6MB in the beginning and 228.6MB in the end (delta: 43.0MB). Free memory was 144.0MB in the beginning and 178.7MB in the end (delta: -34.7MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. [2022-03-01 14:51:32,937 INFO L158 Benchmark]: TraceAbstraction took 60014.01ms. Allocated memory was 228.6MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 178.1MB in the beginning and 6.7GB in the end (delta: -6.5GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-03-01 14:51:32,938 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.79ms. Allocated memory is still 185.6MB. Free memory was 134.3MB in the beginning and 149.2MB in the end (delta: -14.9MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.62ms. Allocated memory is still 185.6MB. Free memory was 149.2MB in the beginning and 146.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.49ms. Allocated memory is still 185.6MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 844.50ms. Allocated memory was 185.6MB in the beginning and 228.6MB in the end (delta: 43.0MB). Free memory was 144.0MB in the beginning and 178.7MB in the end (delta: -34.7MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. * TraceAbstraction took 60014.01ms. Allocated memory was 228.6MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 178.1MB in the beginning and 6.7GB in the end (delta: -6.5GB). Peak memory consumption was 1.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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_p0_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_p0_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_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1221; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; VAL [__unbuffered_cnt=0, __unbuffered_p0_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, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; VAL [__unbuffered_cnt=0, __unbuffered_p0_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, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; VAL [__unbuffered_cnt=0, __unbuffered_p0_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, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p0_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, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_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=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_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, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_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=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_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, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 853]: 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: 849]: 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: 847]: 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: 851]: 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, 173 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 59.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.1s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4343 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4343 mSDsluCounter, 12860 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10919 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1737 IncrementalHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 2553 mSDtfsCounter, 1737 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102752occurred in iteration=0, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 20765 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1525 NumberOfCodeBlocks, 1525 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1404 ConstructedInterpolants, 0 QuantifiedInterpolants, 6820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-01 14:51:32,971 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...