/usr/bin/java -Xmx16000000000 -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-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:01:30,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:01:30,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-23 23:01:31,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:01:31,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:01:31,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:01:31,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:01:31,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:01:31,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:01:31,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:01:31,036 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:01:31,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:01:31,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:01:31,037 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:01:31,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:01:31,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:01:31,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:01:31,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:01:31,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:01:31,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:01:31,039 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:01:31,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:01:31,041 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:01:31,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:01:31,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:01:31,042 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:01:31,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:01:31,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:01:31,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:01:31,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:01:31,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:01:31,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:01:31,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:01:31,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:01:31,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:01:31,045 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-08-23 23:01:31,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:01:31,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:01:31,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:01:31,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:01:31,408 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:01:31,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-08-23 23:01:32,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:01:32,910 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:01:32,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-08-23 23:01:32,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cacff7e67/c1a75a62c7d24b5e9d2c34f308bd7dc0/FLAG312d0a8e8 [2023-08-23 23:01:32,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cacff7e67/c1a75a62c7d24b5e9d2c34f308bd7dc0 [2023-08-23 23:01:32,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:01:32,958 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:01:32,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:01:32,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:01:32,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:01:32,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:01:32" (1/1) ... [2023-08-23 23:01:32,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fbba78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:32, skipping insertion in model container [2023-08-23 23:01:32,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:01:32" (1/1) ... [2023-08-23 23:01:33,025 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:01:33,190 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2023-08-23 23:01:33,408 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:01:33,418 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:01:33,427 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2023-08-23 23:01:33,444 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:01:33,446 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:01:33,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:01:33,502 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:01:33,502 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:01:33,508 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:01:33,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33 WrapperNode [2023-08-23 23:01:33,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:01:33,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:01:33,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:01:33,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:01:33,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,550 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-23 23:01:33,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:01:33,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:01:33,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:01:33,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:01:33,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:01:33,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:01:33,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:01:33,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:01:33,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (1/1) ... [2023-08-23 23:01:33,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:01:33,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:01:33,622 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) [2023-08-23 23:01:33,649 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 [2023-08-23 23:01:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:01:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:01:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:01:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:01:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:01:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:01:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:01:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:01:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:01:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:01:33,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:01:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 23:01:33,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 23:01:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:01:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:01:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:01:33,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:01:33,672 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:01:33,815 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:01:33,816 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:01:34,194 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:01:34,316 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:01:34,316 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:01:34,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:01:34 BoogieIcfgContainer [2023-08-23 23:01:34,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:01:34,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:01:34,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:01:34,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:01:34,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:01:32" (1/3) ... [2023-08-23 23:01:34,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7621f5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:01:34, skipping insertion in model container [2023-08-23 23:01:34,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:33" (2/3) ... [2023-08-23 23:01:34,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7621f5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:01:34, skipping insertion in model container [2023-08-23 23:01:34,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:01:34" (3/3) ... [2023-08-23 23:01:34,325 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2023-08-23 23:01:34,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:01:34,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:01:34,339 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:01:34,385 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:01:34,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-08-23 23:01:34,503 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-23 23:01:34,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:01:34,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-23 23:01:34,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-08-23 23:01:34,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-08-23 23:01:34,520 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:01:34,532 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-23 23:01:34,535 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-23 23:01:34,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-08-23 23:01:34,571 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-23 23:01:34,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:01:34,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-23 23:01:34,574 INFO L119 LiptonReduction]: Number of co-enabled transitions 2852 [2023-08-23 23:01:39,022 INFO L134 LiptonReduction]: Checked pairs total: 8050 [2023-08-23 23:01:39,023 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-23 23:01:39,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:01:39,040 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1441958d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:01:39,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-23 23:01:39,044 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:01:39,044 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-23 23:01:39,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:01:39,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:39,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:39,045 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:39,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2017430224, now seen corresponding path program 1 times [2023-08-23 23:01:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393159042] [2023-08-23 23:01:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:39,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:39,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393159042] [2023-08-23 23:01:39,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393159042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:39,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:39,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:01:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597019887] [2023-08-23 23:01:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:39,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:01:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:39,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:01:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:01:39,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 239 [2023-08-23 23:01:39,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:39,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:39,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 239 [2023-08-23 23:01:39,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:40,122 INFO L124 PetriNetUnfolderBase]: 2855/4136 cut-off events. [2023-08-23 23:01:40,122 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-08-23 23:01:40,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8212 conditions, 4136 events. 2855/4136 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 21089 event pairs, 785 based on Foata normal form. 0/3895 useless extension candidates. Maximal degree in co-relation 8200. Up to 3103 conditions per place. [2023-08-23 23:01:40,152 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-23 23:01:40,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 171 flow [2023-08-23 23:01:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:01:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:01:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-08-23 23:01:40,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5369595536959554 [2023-08-23 23:01:40,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-08-23 23:01:40,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-08-23 23:01:40,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:40,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-08-23 23:01:40,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:40,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:40,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:40,189 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 385 transitions. [2023-08-23 23:01:40,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 171 flow [2023-08-23 23:01:40,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 23:01:40,196 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-08-23 23:01:40,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-23 23:01:40,201 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-23 23:01:40,201 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-08-23 23:01:40,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:40,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:40,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:40,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:01:40,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:40,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash -392258494, now seen corresponding path program 1 times [2023-08-23 23:01:40,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:40,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199191614] [2023-08-23 23:01:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199191614] [2023-08-23 23:01:40,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199191614] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:40,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:40,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:01:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71770505] [2023-08-23 23:01:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:40,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:01:40,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:40,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:01:40,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:01:40,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 239 [2023-08-23 23:01:40,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:40,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:40,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 239 [2023-08-23 23:01:40,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:41,603 INFO L124 PetriNetUnfolderBase]: 8755/12032 cut-off events. [2023-08-23 23:01:41,603 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2023-08-23 23:01:41,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24754 conditions, 12032 events. 8755/12032 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 59508 event pairs, 2987 based on Foata normal form. 296/12328 useless extension candidates. Maximal degree in co-relation 24744. Up to 8389 conditions per place. [2023-08-23 23:01:41,677 INFO L140 encePairwiseOnDemand]: 231/239 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-23 23:01:41,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 216 flow [2023-08-23 23:01:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:01:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:01:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-23 23:01:41,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5090655509065551 [2023-08-23 23:01:41,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-23 23:01:41,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-23 23:01:41,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:41,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-23 23:01:41,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:41,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:41,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:41,683 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 365 transitions. [2023-08-23 23:01:41,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 216 flow [2023-08-23 23:01:41,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:01:41,685 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 114 flow [2023-08-23 23:01:41,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-23 23:01:41,686 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-23 23:01:41,686 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 114 flow [2023-08-23 23:01:41,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:41,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:41,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:41,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:01:41,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:41,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash 724886369, now seen corresponding path program 1 times [2023-08-23 23:01:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:41,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515525495] [2023-08-23 23:01:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515525495] [2023-08-23 23:01:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515525495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:41,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:01:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658217172] [2023-08-23 23:01:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:41,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:41,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 239 [2023-08-23 23:01:41,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:41,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:41,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 239 [2023-08-23 23:01:41,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:42,871 INFO L124 PetriNetUnfolderBase]: 8127/11180 cut-off events. [2023-08-23 23:01:42,871 INFO L125 PetriNetUnfolderBase]: For 3893/3893 co-relation queries the response was YES. [2023-08-23 23:01:42,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27576 conditions, 11180 events. 8127/11180 cut-off events. For 3893/3893 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 53529 event pairs, 2207 based on Foata normal form. 140/11320 useless extension candidates. Maximal degree in co-relation 27564. Up to 5569 conditions per place. [2023-08-23 23:01:42,941 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 49 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-08-23 23:01:42,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 290 flow [2023-08-23 23:01:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:01:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:01:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-23 23:01:42,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49372384937238495 [2023-08-23 23:01:42,944 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-23 23:01:42,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-23 23:01:42,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:42,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-23 23:01:42,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:42,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:42,948 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:42,948 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 114 flow. Second operand 4 states and 472 transitions. [2023-08-23 23:01:42,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 290 flow [2023-08-23 23:01:42,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:01:42,975 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 148 flow [2023-08-23 23:01:42,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-08-23 23:01:42,977 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-23 23:01:42,980 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 148 flow [2023-08-23 23:01:42,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:42,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:42,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:42,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:01:42,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:42,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash 994245151, now seen corresponding path program 1 times [2023-08-23 23:01:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58392458] [2023-08-23 23:01:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:43,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58392458] [2023-08-23 23:01:43,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58392458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:43,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:43,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:01:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264918129] [2023-08-23 23:01:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:43,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:43,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 239 [2023-08-23 23:01:43,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:43,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:43,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 239 [2023-08-23 23:01:43,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:43,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 40#L784true, 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, 68#L2true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-08-23 23:01:43,922 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:01:43,922 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:43,923 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:43,923 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:43,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, 68#L2true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-08-23 23:01:43,984 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,984 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,984 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,984 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= v_~z~0_18 2) (= 0 v_~__unbuffered_p3_EBX~0_12) (= v_~__unbuffered_p1_EAX~0_24 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][78], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 119#L832true, 40#L784true, 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-08-23 23:01:43,986 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,986 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,986 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,986 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 40#L784true, 61#P2EXITtrue, 78#L874true, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-08-23 23:01:43,986 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,986 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,986 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:43,986 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:44,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= v_~z~0_18 2) (= 0 v_~__unbuffered_p3_EBX~0_12) (= v_~__unbuffered_p1_EAX~0_24 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][78], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 119#L832true, 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-08-23 23:01:44,027 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-23 23:01:44,028 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:44,028 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:44,028 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:44,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 61#P2EXITtrue, 78#L874true, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-08-23 23:01:44,028 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-23 23:01:44,028 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:44,028 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:44,028 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-23 23:01:44,055 INFO L124 PetriNetUnfolderBase]: 5047/7554 cut-off events. [2023-08-23 23:01:44,055 INFO L125 PetriNetUnfolderBase]: For 2573/2704 co-relation queries the response was YES. [2023-08-23 23:01:44,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17728 conditions, 7554 events. 5047/7554 cut-off events. For 2573/2704 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 44939 event pairs, 929 based on Foata normal form. 594/7863 useless extension candidates. Maximal degree in co-relation 17713. Up to 4925 conditions per place. [2023-08-23 23:01:44,108 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2023-08-23 23:01:44,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 448 flow [2023-08-23 23:01:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:01:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:01:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-23 23:01:44,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054393305439331 [2023-08-23 23:01:44,110 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-23 23:01:44,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-23 23:01:44,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:44,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-23 23:01:44,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:44,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:44,115 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:44,115 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 148 flow. Second operand 5 states and 604 transitions. [2023-08-23 23:01:44,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 448 flow [2023-08-23 23:01:44,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:01:44,124 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 220 flow [2023-08-23 23:01:44,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-23 23:01:44,125 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-23 23:01:44,125 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 220 flow [2023-08-23 23:01:44,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:44,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:44,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:44,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:01:44,126 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:44,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1627285210, now seen corresponding path program 1 times [2023-08-23 23:01:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049592244] [2023-08-23 23:01:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049592244] [2023-08-23 23:01:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049592244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:44,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:44,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593748372] [2023-08-23 23:01:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:44,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:01:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:44,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:01:44,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:01:44,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 239 [2023-08-23 23:01:44,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:44,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:44,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 239 [2023-08-23 23:01:44,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:44,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork2InUse, Black: 163#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 40#L784true, 179#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, 68#L2true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-08-23 23:01:44,802 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-23 23:01:44,802 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:44,802 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:44,802 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-23 23:01:44,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][103], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 163#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 61#P2EXITtrue, 175#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, 68#L2true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-08-23 23:01:44,837 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-23 23:01:44,837 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:44,837 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:44,837 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-23 23:01:44,876 INFO L124 PetriNetUnfolderBase]: 4012/6224 cut-off events. [2023-08-23 23:01:44,876 INFO L125 PetriNetUnfolderBase]: For 4612/4688 co-relation queries the response was YES. [2023-08-23 23:01:44,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19238 conditions, 6224 events. 4012/6224 cut-off events. For 4612/4688 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 37970 event pairs, 410 based on Foata normal form. 416/6447 useless extension candidates. Maximal degree in co-relation 19219. Up to 2171 conditions per place. [2023-08-23 23:01:44,918 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 87 selfloop transitions, 19 changer transitions 1/117 dead transitions. [2023-08-23 23:01:44,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 117 transitions, 720 flow [2023-08-23 23:01:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:01:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:01:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2023-08-23 23:01:44,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062761506276151 [2023-08-23 23:01:44,921 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2023-08-23 23:01:44,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2023-08-23 23:01:44,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:44,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2023-08-23 23:01:44,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:44,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:44,927 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:44,927 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 220 flow. Second operand 7 states and 847 transitions. [2023-08-23 23:01:44,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 117 transitions, 720 flow [2023-08-23 23:01:44,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 117 transitions, 715 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:01:44,945 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 349 flow [2023-08-23 23:01:44,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-08-23 23:01:44,946 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-23 23:01:44,946 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 349 flow [2023-08-23 23:01:44,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:44,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:44,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:44,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:01:44,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:44,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1632423467, now seen corresponding path program 1 times [2023-08-23 23:01:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918657241] [2023-08-23 23:01:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918657241] [2023-08-23 23:01:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918657241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:01:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9238927] [2023-08-23 23:01:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:45,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:45,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:45,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-23 23:01:45,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:45,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:45,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-23 23:01:45,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:46,038 INFO L124 PetriNetUnfolderBase]: 7067/10435 cut-off events. [2023-08-23 23:01:46,039 INFO L125 PetriNetUnfolderBase]: For 25553/25553 co-relation queries the response was YES. [2023-08-23 23:01:46,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40376 conditions, 10435 events. 7067/10435 cut-off events. For 25553/25553 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 59505 event pairs, 706 based on Foata normal form. 56/10491 useless extension candidates. Maximal degree in co-relation 40353. Up to 4947 conditions per place. [2023-08-23 23:01:46,088 INFO L140 encePairwiseOnDemand]: 230/239 looper letters, 103 selfloop transitions, 21 changer transitions 36/160 dead transitions. [2023-08-23 23:01:46,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 160 transitions, 1381 flow [2023-08-23 23:01:46,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:01:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:01:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-23 23:01:46,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054393305439331 [2023-08-23 23:01:46,091 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-23 23:01:46,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-23 23:01:46,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:46,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-23 23:01:46,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:46,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:46,095 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:46,095 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 349 flow. Second operand 5 states and 604 transitions. [2023-08-23 23:01:46,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 160 transitions, 1381 flow [2023-08-23 23:01:46,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 160 transitions, 1209 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-08-23 23:01:46,377 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 387 flow [2023-08-23 23:01:46,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-08-23 23:01:46,378 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-23 23:01:46,378 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 387 flow [2023-08-23 23:01:46,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:46,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:46,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:46,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:01:46,379 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:46,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:46,380 INFO L85 PathProgramCache]: Analyzing trace with hash -261349626, now seen corresponding path program 1 times [2023-08-23 23:01:46,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:46,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827572075] [2023-08-23 23:01:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:46,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:46,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827572075] [2023-08-23 23:01:46,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827572075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:46,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:46,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:46,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487146915] [2023-08-23 23:01:46,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:46,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:01:46,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:46,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:01:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:01:46,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-23 23:01:46,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:46,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:46,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-23 23:01:46,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:47,382 INFO L124 PetriNetUnfolderBase]: 4838/7450 cut-off events. [2023-08-23 23:01:47,382 INFO L125 PetriNetUnfolderBase]: For 20133/20133 co-relation queries the response was YES. [2023-08-23 23:01:47,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30310 conditions, 7450 events. 4838/7450 cut-off events. For 20133/20133 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 42241 event pairs, 713 based on Foata normal form. 46/7496 useless extension candidates. Maximal degree in co-relation 30284. Up to 2925 conditions per place. [2023-08-23 23:01:47,414 INFO L140 encePairwiseOnDemand]: 230/239 looper letters, 113 selfloop transitions, 34 changer transitions 25/172 dead transitions. [2023-08-23 23:01:47,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 172 transitions, 1464 flow [2023-08-23 23:01:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:01:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:01:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 723 transitions. [2023-08-23 23:01:47,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50418410041841 [2023-08-23 23:01:47,417 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 723 transitions. [2023-08-23 23:01:47,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 723 transitions. [2023-08-23 23:01:47,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:47,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 723 transitions. [2023-08-23 23:01:47,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:47,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:47,422 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:47,422 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 387 flow. Second operand 6 states and 723 transitions. [2023-08-23 23:01:47,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 172 transitions, 1464 flow [2023-08-23 23:01:47,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 172 transitions, 1398 flow, removed 33 selfloop flow, removed 3 redundant places. [2023-08-23 23:01:47,471 INFO L231 Difference]: Finished difference. Result has 61 places, 71 transitions, 619 flow [2023-08-23 23:01:47,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2023-08-23 23:01:47,472 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-23 23:01:47,472 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 71 transitions, 619 flow [2023-08-23 23:01:47,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:47,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:47,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:47,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:01:47,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:47,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1889729100, now seen corresponding path program 2 times [2023-08-23 23:01:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:47,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775904640] [2023-08-23 23:01:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775904640] [2023-08-23 23:01:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775904640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:47,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:47,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:01:47,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329803865] [2023-08-23 23:01:47,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:47,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:01:47,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:01:47,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:01:47,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 239 [2023-08-23 23:01:47,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 71 transitions, 619 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:47,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:47,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 239 [2023-08-23 23:01:47,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:48,153 INFO L124 PetriNetUnfolderBase]: 2826/4659 cut-off events. [2023-08-23 23:01:48,154 INFO L125 PetriNetUnfolderBase]: For 9409/9630 co-relation queries the response was YES. [2023-08-23 23:01:48,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16756 conditions, 4659 events. 2826/4659 cut-off events. For 9409/9630 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 28897 event pairs, 299 based on Foata normal form. 391/4909 useless extension candidates. Maximal degree in co-relation 16729. Up to 1447 conditions per place. [2023-08-23 23:01:48,174 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 97 selfloop transitions, 17 changer transitions 27/170 dead transitions. [2023-08-23 23:01:48,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 170 transitions, 1549 flow [2023-08-23 23:01:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:01:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:01:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2023-08-23 23:01:48,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068738792588166 [2023-08-23 23:01:48,178 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2023-08-23 23:01:48,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2023-08-23 23:01:48,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:48,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2023-08-23 23:01:48,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:48,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:48,183 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:48,183 INFO L175 Difference]: Start difference. First operand has 61 places, 71 transitions, 619 flow. Second operand 7 states and 848 transitions. [2023-08-23 23:01:48,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 170 transitions, 1549 flow [2023-08-23 23:01:48,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 170 transitions, 1549 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-23 23:01:48,200 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 733 flow [2023-08-23 23:01:48,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=733, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2023-08-23 23:01:48,200 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-08-23 23:01:48,200 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 733 flow [2023-08-23 23:01:48,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:48,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:48,201 INFO L208 CegarLoopForPetriNet]: 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] [2023-08-23 23:01:48,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:01:48,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:48,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash 43134830, now seen corresponding path program 1 times [2023-08-23 23:01:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:48,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224825223] [2023-08-23 23:01:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:48,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224825223] [2023-08-23 23:01:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224825223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:48,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:48,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:48,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772878363] [2023-08-23 23:01:48,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:48,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:01:48,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:01:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:01:48,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 239 [2023-08-23 23:01:48,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 78 transitions, 733 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:48,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:48,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 239 [2023-08-23 23:01:48,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:49,265 INFO L124 PetriNetUnfolderBase]: 5588/8958 cut-off events. [2023-08-23 23:01:49,265 INFO L125 PetriNetUnfolderBase]: For 32205/32205 co-relation queries the response was YES. [2023-08-23 23:01:49,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39839 conditions, 8958 events. 5588/8958 cut-off events. For 32205/32205 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 56308 event pairs, 1316 based on Foata normal form. 24/8982 useless extension candidates. Maximal degree in co-relation 39807. Up to 3590 conditions per place. [2023-08-23 23:01:49,293 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 71 selfloop transitions, 15 changer transitions 80/166 dead transitions. [2023-08-23 23:01:49,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 166 transitions, 1769 flow [2023-08-23 23:01:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:01:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:01:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-08-23 23:01:49,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49874476987447697 [2023-08-23 23:01:49,303 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-08-23 23:01:49,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-08-23 23:01:49,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:49,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-08-23 23:01:49,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:49,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:49,307 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:49,307 INFO L175 Difference]: Start difference. First operand has 70 places, 78 transitions, 733 flow. Second operand 5 states and 596 transitions. [2023-08-23 23:01:49,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 166 transitions, 1769 flow [2023-08-23 23:01:49,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 166 transitions, 1594 flow, removed 69 selfloop flow, removed 2 redundant places. [2023-08-23 23:01:49,581 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 506 flow [2023-08-23 23:01:49,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=506, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2023-08-23 23:01:49,582 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2023-08-23 23:01:49,583 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 506 flow [2023-08-23 23:01:49,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:49,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:49,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:49,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:01:49,584 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:49,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1467396562, now seen corresponding path program 1 times [2023-08-23 23:01:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:49,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090342255] [2023-08-23 23:01:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:49,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:49,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090342255] [2023-08-23 23:01:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090342255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495817446] [2023-08-23 23:01:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:49,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:01:49,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:49,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:01:49,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:01:49,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-23 23:01:49,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 506 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:49,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:49,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-23 23:01:49,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:50,297 INFO L124 PetriNetUnfolderBase]: 3060/5032 cut-off events. [2023-08-23 23:01:50,297 INFO L125 PetriNetUnfolderBase]: For 13191/13191 co-relation queries the response was YES. [2023-08-23 23:01:50,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19824 conditions, 5032 events. 3060/5032 cut-off events. For 13191/13191 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 29674 event pairs, 492 based on Foata normal form. 12/5044 useless extension candidates. Maximal degree in co-relation 19788. Up to 2247 conditions per place. [2023-08-23 23:01:50,318 INFO L140 encePairwiseOnDemand]: 231/239 looper letters, 97 selfloop transitions, 18 changer transitions 35/150 dead transitions. [2023-08-23 23:01:50,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 150 transitions, 1317 flow [2023-08-23 23:01:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:01:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:01:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-08-23 23:01:50,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496513249651325 [2023-08-23 23:01:50,323 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-08-23 23:01:50,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-08-23 23:01:50,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:50,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-08-23 23:01:50,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:50,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:50,327 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:50,327 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 506 flow. Second operand 6 states and 712 transitions. [2023-08-23 23:01:50,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 150 transitions, 1317 flow [2023-08-23 23:01:50,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 150 transitions, 1271 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-08-23 23:01:50,403 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 482 flow [2023-08-23 23:01:50,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-08-23 23:01:50,404 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-08-23 23:01:50,404 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 482 flow [2023-08-23 23:01:50,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:50,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:50,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:50,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:01:50,405 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:50,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash -674152556, now seen corresponding path program 2 times [2023-08-23 23:01:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352976600] [2023-08-23 23:01:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:50,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352976600] [2023-08-23 23:01:50,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352976600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:50,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:50,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:01:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165005304] [2023-08-23 23:01:50,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:50,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:01:50,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:50,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:01:50,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:01:50,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 239 [2023-08-23 23:01:50,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 482 flow. Second operand has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:50,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:50,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 239 [2023-08-23 23:01:50,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:51,123 INFO L124 PetriNetUnfolderBase]: 1839/3151 cut-off events. [2023-08-23 23:01:51,123 INFO L125 PetriNetUnfolderBase]: For 8024/8136 co-relation queries the response was YES. [2023-08-23 23:01:51,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11736 conditions, 3151 events. 1839/3151 cut-off events. For 8024/8136 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19540 event pairs, 286 based on Foata normal form. 115/3167 useless extension candidates. Maximal degree in co-relation 11701. Up to 1172 conditions per place. [2023-08-23 23:01:51,140 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 34 selfloop transitions, 17 changer transitions 62/117 dead transitions. [2023-08-23 23:01:51,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 117 transitions, 1104 flow [2023-08-23 23:01:51,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:01:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:01:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 945 transitions. [2023-08-23 23:01:51,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942468619246862 [2023-08-23 23:01:51,143 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 945 transitions. [2023-08-23 23:01:51,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 945 transitions. [2023-08-23 23:01:51,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:51,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 945 transitions. [2023-08-23 23:01:51,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:51,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:51,148 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:51,148 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 482 flow. Second operand 8 states and 945 transitions. [2023-08-23 23:01:51,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 117 transitions, 1104 flow [2023-08-23 23:01:51,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 117 transitions, 982 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-23 23:01:51,208 INFO L231 Difference]: Finished difference. Result has 77 places, 38 transitions, 267 flow [2023-08-23 23:01:51,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=267, PETRI_PLACES=77, PETRI_TRANSITIONS=38} [2023-08-23 23:01:51,208 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2023-08-23 23:01:51,208 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 38 transitions, 267 flow [2023-08-23 23:01:51,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:51,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:51,209 INFO L208 CegarLoopForPetriNet]: 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] [2023-08-23 23:01:51,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:01:51,209 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:51,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1382399212, now seen corresponding path program 1 times [2023-08-23 23:01:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:51,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928495439] [2023-08-23 23:01:51,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:51,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:52,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928495439] [2023-08-23 23:01:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928495439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:52,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:52,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:01:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40846829] [2023-08-23 23:01:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:52,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:01:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:52,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:01:52,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:01:52,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-23 23:01:52,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 38 transitions, 267 flow. Second operand has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:52,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:52,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-23 23:01:52,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:52,431 INFO L124 PetriNetUnfolderBase]: 355/633 cut-off events. [2023-08-23 23:01:52,431 INFO L125 PetriNetUnfolderBase]: For 1504/1513 co-relation queries the response was YES. [2023-08-23 23:01:52,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2508 conditions, 633 events. 355/633 cut-off events. For 1504/1513 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2943 event pairs, 75 based on Foata normal form. 3/599 useless extension candidates. Maximal degree in co-relation 2485. Up to 317 conditions per place. [2023-08-23 23:01:52,434 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 43 selfloop transitions, 3 changer transitions 26/76 dead transitions. [2023-08-23 23:01:52,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 76 transitions, 688 flow [2023-08-23 23:01:52,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:01:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:01:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 661 transitions. [2023-08-23 23:01:52,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609483960948396 [2023-08-23 23:01:52,436 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 661 transitions. [2023-08-23 23:01:52,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 661 transitions. [2023-08-23 23:01:52,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:52,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 661 transitions. [2023-08-23 23:01:52,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:52,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:52,441 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:52,441 INFO L175 Difference]: Start difference. First operand has 77 places, 38 transitions, 267 flow. Second operand 6 states and 661 transitions. [2023-08-23 23:01:52,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 76 transitions, 688 flow [2023-08-23 23:01:52,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 515 flow, removed 38 selfloop flow, removed 18 redundant places. [2023-08-23 23:01:52,447 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 187 flow [2023-08-23 23:01:52,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-08-23 23:01:52,448 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-08-23 23:01:52,448 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 187 flow [2023-08-23 23:01:52,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:52,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:52,448 INFO L208 CegarLoopForPetriNet]: 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] [2023-08-23 23:01:52,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:01:52,449 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:52,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:52,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1212922438, now seen corresponding path program 2 times [2023-08-23 23:01:52,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:52,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529736588] [2023-08-23 23:01:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:01:52,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:01:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:01:52,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:01:52,548 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:01:52,549 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-23 23:01:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-23 23:01:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-23 23:01:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-23 23:01:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-23 23:01:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-23 23:01:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-23 23:01:52,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 23:01:52,552 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:52,557 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:01:52,557 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:01:52,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:01:52 BasicIcfg [2023-08-23 23:01:52,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:01:52,627 INFO L158 Benchmark]: Toolchain (without parser) took 19669.02ms. Allocated memory was 371.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 346.3MB in the beginning and 927.2MB in the end (delta: -580.9MB). Peak memory consumption was 774.4MB. Max. memory is 16.0GB. [2023-08-23 23:01:52,628 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 371.2MB. Free memory is still 347.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:01:52,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.86ms. Allocated memory is still 371.2MB. Free memory was 345.8MB in the beginning and 322.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:01:52,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.75ms. Allocated memory is still 371.2MB. Free memory was 322.6MB in the beginning and 320.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:01:52,628 INFO L158 Benchmark]: Boogie Preprocessor took 28.53ms. Allocated memory is still 371.2MB. Free memory was 320.1MB in the beginning and 318.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:01:52,628 INFO L158 Benchmark]: RCFGBuilder took 738.07ms. Allocated memory is still 371.2MB. Free memory was 318.1MB in the beginning and 334.4MB in the end (delta: -16.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-23 23:01:52,629 INFO L158 Benchmark]: TraceAbstraction took 18306.95ms. Allocated memory was 371.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 334.4MB in the beginning and 927.2MB in the end (delta: -592.8MB). Peak memory consumption was 761.8MB. Max. memory is 16.0GB. [2023-08-23 23:01:52,630 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 371.2MB. Free memory is still 347.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 549.86ms. Allocated memory is still 371.2MB. Free memory was 345.8MB in the beginning and 322.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.75ms. Allocated memory is still 371.2MB. Free memory was 322.6MB in the beginning and 320.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.53ms. Allocated memory is still 371.2MB. Free memory was 320.1MB in the beginning and 318.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 738.07ms. Allocated memory is still 371.2MB. Free memory was 318.1MB in the beginning and 334.4MB in the end (delta: -16.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 18306.95ms. Allocated memory was 371.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 334.4MB in the beginning and 927.2MB in the end (delta: -592.8MB). Peak memory consumption was 761.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 136 PlacesBefore, 41 PlacesAfterwards, 125 TransitionsBefore, 29 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 8 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8050 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3416, independent: 3172, independent conditional: 0, independent unconditional: 3172, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1560, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3416, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1560, unknown conditional: 0, unknown unconditional: 1560] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=-3, t693={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=-2, t693={5:0}, t694={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=-1, t693={5:0}, t694={6:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1284 IncrementalHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 44 mSDtfsCounter, 1284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=733occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-23 23:01:52,660 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...