/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 --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:26:59,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:26:59,347 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-24 05:26:59,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:26:59,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:26:59,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:26:59,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:26:59,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:26:59,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:26:59,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:26:59,393 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:26:59,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:26:59,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:26:59,395 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:26:59,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:26:59,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:26:59,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:26:59,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:26:59,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:26:59,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:26:59,396 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:26:59,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:26:59,397 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:26:59,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:26:59,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:26:59,398 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:26:59,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:26:59,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:26:59,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:26:59,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:26:59,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:26:59,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:26:59,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:26:59,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:26:59,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:26:59,401 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:26:59,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:26:59,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:26:59,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:26:59,761 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:26:59,761 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:26:59,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-08-24 05:27:01,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:27:01,314 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:27:01,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-08-24 05:27:01,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f50d9c5a/b1d71852119b46e283ade495d8200033/FLAG02836081f [2023-08-24 05:27:01,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f50d9c5a/b1d71852119b46e283ade495d8200033 [2023-08-24 05:27:01,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:27:01,357 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:27:01,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:27:01,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:27:01,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:27:01,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:01,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc7ef88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01, skipping insertion in model container [2023-08-24 05:27:01,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:01,423 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:27:01,598 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_power.opt_tso.opt.i[1001,1014] [2023-08-24 05:27:01,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:27:01,827 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:27:01,840 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_power.opt_tso.opt.i[1001,1014] [2023-08-24 05:27:01,860 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:27:01,862 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:27:01,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:27:01,948 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:27:01,948 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:27:01,954 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:27:01,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01 WrapperNode [2023-08-24 05:27:01,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:27:01,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:27:01,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:27:01,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:27:01,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:01,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,023 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-24 05:27:02,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:27:02,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:27:02,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:27:02,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:27:02,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:27:02,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:27:02,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:27:02,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:27:02,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (1/1) ... [2023-08-24 05:27:02,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:27:02,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:27:02,105 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-24 05:27:02,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:27:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:27:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:27:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:27:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:27:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:27:02,136 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:27:02,283 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:27:02,284 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:27:02,544 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:27:02,642 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:27:02,643 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:27:02,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:27:02 BoogieIcfgContainer [2023-08-24 05:27:02,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:27:02,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:27:02,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:27:02,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:27:02,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:27:01" (1/3) ... [2023-08-24 05:27:02,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3ca5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:27:02, skipping insertion in model container [2023-08-24 05:27:02,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:27:01" (2/3) ... [2023-08-24 05:27:02,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3ca5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:27:02, skipping insertion in model container [2023-08-24 05:27:02,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:27:02" (3/3) ... [2023-08-24 05:27:02,655 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-08-24 05:27:02,672 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:27:02,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:27:02,673 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:27:02,747 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:27:02,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-24 05:27:02,860 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-24 05:27:02,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:27:02,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 05:27:02,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-24 05:27:02,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-24 05:27:02,877 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:27:02,889 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-24 05:27:02,893 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-24 05:27:02,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-24 05:27:02,939 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-24 05:27:02,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:27:02,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 05:27:02,943 INFO L119 LiptonReduction]: Number of co-enabled transitions 3000 [2023-08-24 05:27:07,047 INFO L134 LiptonReduction]: Checked pairs total: 7767 [2023-08-24 05:27:07,047 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-24 05:27:07,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:27:07,064 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;@5babe2cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:27:07,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:27:07,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:27:07,068 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-24 05:27:07,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:27:07,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:07,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:27:07,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:07,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash 514990672, now seen corresponding path program 1 times [2023-08-24 05:27:07,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:07,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492126953] [2023-08-24 05:27:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:07,539 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-24 05:27:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:07,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492126953] [2023-08-24 05:27:07,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492126953] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:07,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:07,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:27:07,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285821374] [2023-08-24 05:27:07,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:07,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:27:07,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:07,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:27:07,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:27:07,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 237 [2023-08-24 05:27:07,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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-24 05:27:07,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:07,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 237 [2023-08-24 05:27:07,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:08,359 INFO L124 PetriNetUnfolderBase]: 3927/5792 cut-off events. [2023-08-24 05:27:08,359 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-24 05:27:08,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11344 conditions, 5792 events. 3927/5792 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32920 event pairs, 717 based on Foata normal form. 0/5464 useless extension candidates. Maximal degree in co-relation 11332. Up to 4291 conditions per place. [2023-08-24 05:27:08,397 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-08-24 05:27:08,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 190 flow [2023-08-24 05:27:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:27:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:27:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-24 05:27:08,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5443037974683544 [2023-08-24 05:27:08,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-24 05:27:08,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-24 05:27:08,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:08,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-24 05:27:08,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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-24 05:27:08,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 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-24 05:27:08,426 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 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-24 05:27:08,428 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 387 transitions. [2023-08-24 05:27:08,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 190 flow [2023-08-24 05:27:08,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:27:08,435 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-24 05:27:08,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-24 05:27:08,440 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-24 05:27:08,440 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-24 05:27:08,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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-24 05:27:08,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:08,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:27:08,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:27:08,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:08,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2000565703, now seen corresponding path program 1 times [2023-08-24 05:27:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041577433] [2023-08-24 05:27:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:08,686 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-24 05:27:08,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:08,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041577433] [2023-08-24 05:27:08,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041577433] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:08,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:08,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:27:08,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932986646] [2023-08-24 05:27:08,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:08,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:27:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:08,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:27:08,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:27:08,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-24 05:27:08,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 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-24 05:27:08,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:08,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-24 05:27:08,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:10,275 INFO L124 PetriNetUnfolderBase]: 11225/15342 cut-off events. [2023-08-24 05:27:10,276 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2023-08-24 05:27:10,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31828 conditions, 15342 events. 11225/15342 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 77111 event pairs, 3963 based on Foata normal form. 368/15710 useless extension candidates. Maximal degree in co-relation 31818. Up to 10655 conditions per place. [2023-08-24 05:27:10,368 INFO L140 encePairwiseOnDemand]: 229/237 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-24 05:27:10,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 224 flow [2023-08-24 05:27:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:27:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:27:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-24 05:27:10,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161744022503516 [2023-08-24 05:27:10,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-24 05:27:10,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-24 05:27:10,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:10,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-24 05:27:10,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-24 05:27:10,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 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-24 05:27:10,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 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-24 05:27:10,375 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 367 transitions. [2023-08-24 05:27:10,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 224 flow [2023-08-24 05:27:10,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:27:10,377 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2023-08-24 05:27:10,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-24 05:27:10,382 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-24 05:27:10,382 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2023-08-24 05:27:10,387 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-24 05:27:10,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:10,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:27:10,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:27:10,388 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:10,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1887992981, now seen corresponding path program 1 times [2023-08-24 05:27:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294787191] [2023-08-24 05:27:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:10,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:10,565 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-24 05:27:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294787191] [2023-08-24 05:27:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294787191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:27:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280475713] [2023-08-24 05:27:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:10,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:27:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:27:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:27:10,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 237 [2023-08-24 05:27:10,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-24 05:27:10,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:10,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 237 [2023-08-24 05:27:10,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:11,769 INFO L124 PetriNetUnfolderBase]: 8107/11650 cut-off events. [2023-08-24 05:27:11,770 INFO L125 PetriNetUnfolderBase]: For 3454/3506 co-relation queries the response was YES. [2023-08-24 05:27:11,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27046 conditions, 11650 events. 8107/11650 cut-off events. For 3454/3506 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 64474 event pairs, 2842 based on Foata normal form. 188/11707 useless extension candidates. Maximal degree in co-relation 27034. Up to 7144 conditions per place. [2023-08-24 05:27:11,835 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 36 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-24 05:27:11,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 224 flow [2023-08-24 05:27:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:27:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:27:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-24 05:27:11,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274261603375527 [2023-08-24 05:27:11,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-24 05:27:11,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-24 05:27:11,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:11,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-24 05:27:11,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-24 05:27:11,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 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-24 05:27:11,840 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 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-24 05:27:11,840 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 3 states and 375 transitions. [2023-08-24 05:27:11,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 224 flow [2023-08-24 05:27:11,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:27:11,860 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 113 flow [2023-08-24 05:27:11,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-24 05:27:11,861 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-08-24 05:27:11,864 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 113 flow [2023-08-24 05:27:11,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-24 05:27:11,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:11,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:27:11,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:27:11,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:11,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:11,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1640365980, now seen corresponding path program 1 times [2023-08-24 05:27:11,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:11,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9587844] [2023-08-24 05:27:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:11,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:12,085 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-24 05:27:12,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:12,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9587844] [2023-08-24 05:27:12,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9587844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:12,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:12,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:27:12,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532140114] [2023-08-24 05:27:12,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:12,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:27:12,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:12,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:27:12,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:27:12,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 05:27:12,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 113 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-24 05:27:12,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:12,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 05:27:12,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:12,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [154#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true]) [2023-08-24 05:27:12,862 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 05:27:12,862 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:12,862 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:12,862 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:12,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [154#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 159#true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true]) [2023-08-24 05:27:12,946 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,946 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,946 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,947 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([502] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~main$tmp_guard1~0_14 (ite (= (ite (not (and (= v_~z~0_16 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_16, ~__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][74], [154#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 125#L838true, Black: 150#(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))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 05:27:12,948 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,948 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,948 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,948 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [154#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 34#L880true, Black: 150#(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#(= ~__unbuffered_p3_EAX~0 0), 92#L845true]) [2023-08-24 05:27:12,949 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,949 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,949 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:12,949 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:13,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([502] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~main$tmp_guard1~0_14 (ite (= (ite (not (and (= v_~z~0_16 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_16, ~__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][74], [154#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 125#L838true, 112#P0EXITtrue, Black: 150#(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))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 05:27:13,002 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-24 05:27:13,002 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 05:27:13,003 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 05:27:13,003 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 05:27:13,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [154#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 34#L880true, 112#P0EXITtrue, Black: 150#(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))), 92#L845true, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 05:27:13,003 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-24 05:27:13,003 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 05:27:13,003 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 05:27:13,003 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 05:27:13,058 INFO L124 PetriNetUnfolderBase]: 6614/9762 cut-off events. [2023-08-24 05:27:13,058 INFO L125 PetriNetUnfolderBase]: For 1817/1951 co-relation queries the response was YES. [2023-08-24 05:27:13,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21949 conditions, 9762 events. 6614/9762 cut-off events. For 1817/1951 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 58825 event pairs, 1247 based on Foata normal form. 723/10131 useless extension candidates. Maximal degree in co-relation 21936. Up to 6200 conditions per place. [2023-08-24 05:27:13,137 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 64 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2023-08-24 05:27:13,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 82 transitions, 389 flow [2023-08-24 05:27:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:27:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:27:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-24 05:27:13,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130801687763713 [2023-08-24 05:27:13,140 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-24 05:27:13,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-24 05:27:13,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:13,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-24 05:27:13,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 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-24 05:27:13,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 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-24 05:27:13,148 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 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-24 05:27:13,149 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 113 flow. Second operand 5 states and 608 transitions. [2023-08-24 05:27:13,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 82 transitions, 389 flow [2023-08-24 05:27:13,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 82 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:27:13,153 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 182 flow [2023-08-24 05:27:13,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-24 05:27:13,154 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-24 05:27:13,155 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 182 flow [2023-08-24 05:27:13,155 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-24 05:27:13,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:13,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:27:13,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:27:13,155 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:13,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 317217735, now seen corresponding path program 1 times [2023-08-24 05:27:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:13,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919159635] [2023-08-24 05:27:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:13,385 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-24 05:27:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:13,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919159635] [2023-08-24 05:27:13,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919159635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:13,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:13,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:27:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973985391] [2023-08-24 05:27:13,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:13,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:27:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:13,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:27:13,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:27:13,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 05:27:13,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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-24 05:27:13,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:13,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 05:27:13,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:13,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][74], [Black: 161#(= ~__unbuffered_cnt~0 0), 32#L770true, Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 150#(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))), 45#L873true, 92#L845true, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 05:27:13,983 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 05:27:13,983 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:13,983 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:13,983 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:14,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][105], [Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true]) [2023-08-24 05:27:14,025 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 05:27:14,025 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:14,025 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:14,025 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:14,106 INFO L124 PetriNetUnfolderBase]: 5294/8067 cut-off events. [2023-08-24 05:27:14,107 INFO L125 PetriNetUnfolderBase]: For 4243/4279 co-relation queries the response was YES. [2023-08-24 05:27:14,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23527 conditions, 8067 events. 5294/8067 cut-off events. For 4243/4279 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 49700 event pairs, 635 based on Foata normal form. 476/8312 useless extension candidates. Maximal degree in co-relation 23511. Up to 2558 conditions per place. [2023-08-24 05:27:14,158 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 88 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2023-08-24 05:27:14,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 115 transitions, 642 flow [2023-08-24 05:27:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:27:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:27:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-08-24 05:27:14,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141651597347799 [2023-08-24 05:27:14,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-08-24 05:27:14,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-08-24 05:27:14,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:14,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-08-24 05:27:14,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 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-24 05:27:14,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 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-24 05:27:14,167 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 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-24 05:27:14,168 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 182 flow. Second operand 7 states and 853 transitions. [2023-08-24 05:27:14,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 115 transitions, 642 flow [2023-08-24 05:27:14,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 115 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:27:14,201 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 311 flow [2023-08-24 05:27:14,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2023-08-24 05:27:14,202 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-24 05:27:14,202 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 311 flow [2023-08-24 05:27:14,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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-24 05:27:14,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:14,203 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-24 05:27:14,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:27:14,203 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:14,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1254189260, now seen corresponding path program 1 times [2023-08-24 05:27:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:14,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935730188] [2023-08-24 05:27:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:14,435 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-24 05:27:14,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935730188] [2023-08-24 05:27:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935730188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:14,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:14,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:27:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628064095] [2023-08-24 05:27:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:14,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:27:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:14,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:27:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:27:14,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-08-24 05:27:14,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 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-24 05:27:14,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:14,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-08-24 05:27:14,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:15,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L835-->L838: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][44], [Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 125#L838true, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 05:27:15,208 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-24 05:27:15,208 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-24 05:27:15,208 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-24 05:27:15,208 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-24 05:27:15,384 INFO L124 PetriNetUnfolderBase]: 7635/11666 cut-off events. [2023-08-24 05:27:15,384 INFO L125 PetriNetUnfolderBase]: For 21823/22123 co-relation queries the response was YES. [2023-08-24 05:27:15,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41786 conditions, 11666 events. 7635/11666 cut-off events. For 21823/22123 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 75309 event pairs, 1310 based on Foata normal form. 148/11618 useless extension candidates. Maximal degree in co-relation 41766. Up to 6447 conditions per place. [2023-08-24 05:27:15,434 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 84 selfloop transitions, 3 changer transitions 24/117 dead transitions. [2023-08-24 05:27:15,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 117 transitions, 980 flow [2023-08-24 05:27:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:27:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:27:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-08-24 05:27:15,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274261603375527 [2023-08-24 05:27:15,436 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-08-24 05:27:15,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-08-24 05:27:15,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:15,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-08-24 05:27:15,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 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-24 05:27:15,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 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-24 05:27:15,440 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 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-24 05:27:15,440 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 311 flow. Second operand 4 states and 500 transitions. [2023-08-24 05:27:15,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 117 transitions, 980 flow [2023-08-24 05:27:15,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 117 transitions, 845 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-24 05:27:15,833 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 270 flow [2023-08-24 05:27:15,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-24 05:27:15,834 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-24 05:27:15,834 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 270 flow [2023-08-24 05:27:15,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 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-24 05:27:15,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:15,835 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-24 05:27:15,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:27:15,835 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:15,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash -202141348, now seen corresponding path program 2 times [2023-08-24 05:27:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:15,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110169127] [2023-08-24 05:27:15,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:15,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:16,058 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-24 05:27:16,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:16,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110169127] [2023-08-24 05:27:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110169127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:16,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:16,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:27:16,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542456716] [2023-08-24 05:27:16,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:16,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:27:16,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:16,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:27:16,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:27:16,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 05:27:16,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 270 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-24 05:27:16,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:16,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 05:27:16,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:16,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][74], [162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_cnt~0 0), 32#L770true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 150#(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))), 45#L873true, 92#L845true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~a~0 1)]) [2023-08-24 05:27:16,787 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 05:27:16,788 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:16,788 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:16,788 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:16,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][74], [Black: 161#(= ~__unbuffered_cnt~0 0), 32#L770true, Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~a~0 1), 92#L845true]) [2023-08-24 05:27:16,790 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 05:27:16,790 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:16,790 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:16,790 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:16,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][105], [162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_cnt~0 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 150#(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))), 45#L873true, 92#L845true, 202#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~a~0 1)]) [2023-08-24 05:27:16,863 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 05:27:16,863 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:16,863 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:16,863 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:16,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][105], [Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 150#(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))), 45#L873true, 92#L845true, 202#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~a~0 1)]) [2023-08-24 05:27:16,865 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 05:27:16,865 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:16,865 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:16,865 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:27:16,960 INFO L124 PetriNetUnfolderBase]: 5993/9321 cut-off events. [2023-08-24 05:27:16,961 INFO L125 PetriNetUnfolderBase]: For 11952/11988 co-relation queries the response was YES. [2023-08-24 05:27:16,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29623 conditions, 9321 events. 5993/9321 cut-off events. For 11952/11988 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 60750 event pairs, 609 based on Foata normal form. 292/9453 useless extension candidates. Maximal degree in co-relation 29602. Up to 1919 conditions per place. [2023-08-24 05:27:17,008 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 97 selfloop transitions, 26 changer transitions 13/146 dead transitions. [2023-08-24 05:27:17,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 146 transitions, 921 flow [2023-08-24 05:27:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:27:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:27:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1094 transitions. [2023-08-24 05:27:17,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128926394749179 [2023-08-24 05:27:17,012 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1094 transitions. [2023-08-24 05:27:17,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1094 transitions. [2023-08-24 05:27:17,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:17,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1094 transitions. [2023-08-24 05:27:17,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.55555555555556) internal successors, (1094), 9 states have internal predecessors, (1094), 0 states have call successors, (0), 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-24 05:27:17,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 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-24 05:27:17,019 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 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-24 05:27:17,019 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 270 flow. Second operand 9 states and 1094 transitions. [2023-08-24 05:27:17,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 146 transitions, 921 flow [2023-08-24 05:27:17,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 146 transitions, 913 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:27:17,357 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 443 flow [2023-08-24 05:27:17,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=443, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2023-08-24 05:27:17,358 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-24 05:27:17,358 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 443 flow [2023-08-24 05:27:17,359 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-24 05:27:17,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:17,359 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] [2023-08-24 05:27:17,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:27:17,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:17,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash 593381539, now seen corresponding path program 1 times [2023-08-24 05:27:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:17,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953493552] [2023-08-24 05:27:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:17,588 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-24 05:27:17,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:17,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953493552] [2023-08-24 05:27:17,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953493552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:17,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:17,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:27:17,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695585357] [2023-08-24 05:27:17,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:17,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:27:17,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:17,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:27:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:27:17,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-24 05:27:17,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 443 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-24 05:27:17,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:17,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-24 05:27:17,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:18,797 INFO L124 PetriNetUnfolderBase]: 10531/15683 cut-off events. [2023-08-24 05:27:18,797 INFO L125 PetriNetUnfolderBase]: For 39292/39292 co-relation queries the response was YES. [2023-08-24 05:27:18,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58703 conditions, 15683 events. 10531/15683 cut-off events. For 39292/39292 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 95767 event pairs, 2252 based on Foata normal form. 13/15696 useless extension candidates. Maximal degree in co-relation 58678. Up to 9016 conditions per place. [2023-08-24 05:27:18,855 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 69 selfloop transitions, 8 changer transitions 40/117 dead transitions. [2023-08-24 05:27:18,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 117 transitions, 1092 flow [2023-08-24 05:27:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:27:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:27:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-24 05:27:18,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063291139240507 [2023-08-24 05:27:18,858 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-24 05:27:18,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-24 05:27:18,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:18,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-24 05:27:18,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 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-24 05:27:18,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 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-24 05:27:18,861 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 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-24 05:27:18,862 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 443 flow. Second operand 4 states and 480 transitions. [2023-08-24 05:27:18,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 117 transitions, 1092 flow [2023-08-24 05:27:20,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 905 flow, removed 68 selfloop flow, removed 4 redundant places. [2023-08-24 05:27:20,050 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 290 flow [2023-08-24 05:27:20,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2023-08-24 05:27:20,050 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-24 05:27:20,050 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 290 flow [2023-08-24 05:27:20,051 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-24 05:27:20,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:20,051 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-24 05:27:20,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:27:20,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:20,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash 586013674, now seen corresponding path program 1 times [2023-08-24 05:27:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:20,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753567897] [2023-08-24 05:27:20,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:20,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:20,557 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-24 05:27:20,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:20,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753567897] [2023-08-24 05:27:20,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753567897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:20,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:20,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:27:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245488127] [2023-08-24 05:27:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:20,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:27:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:20,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:27:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:27:20,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-08-24 05:27:20,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 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-24 05:27:20,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:20,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-08-24 05:27:20,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:21,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][70], [32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 195#(<= ~__unbuffered_cnt~0 2), P0Thread1of1ForFork3InUse, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 202#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 209#(= ~z~0 1), P2Thread1of1ForFork2InUse, 214#true, Black: 210#(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: 150#(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#(= ~__unbuffered_p3_EAX~0 0), 92#L845true, 172#(<= ~__unbuffered_cnt~0 1), 59#L869-3true, Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 184#(= ~a~0 1)]) [2023-08-24 05:27:21,295 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 05:27:21,295 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 05:27:21,295 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 05:27:21,295 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 05:27:21,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][70], [P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 202#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 209#(= ~z~0 1), P2Thread1of1ForFork2InUse, 214#true, Black: 210#(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: 150#(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#(= ~__unbuffered_p3_EAX~0 0), 92#L845true, 59#L869-3true, Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, 112#P0EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 195#(<= ~__unbuffered_cnt~0 2), Black: 184#(= ~a~0 1)]) [2023-08-24 05:27:21,400 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 05:27:21,400 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:21,400 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:21,400 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:21,675 INFO L124 PetriNetUnfolderBase]: 5500/9136 cut-off events. [2023-08-24 05:27:21,675 INFO L125 PetriNetUnfolderBase]: For 13130/13189 co-relation queries the response was YES. [2023-08-24 05:27:21,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30722 conditions, 9136 events. 5500/9136 cut-off events. For 13130/13189 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 63653 event pairs, 1221 based on Foata normal form. 27/8934 useless extension candidates. Maximal degree in co-relation 30694. Up to 4680 conditions per place. [2023-08-24 05:27:21,702 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 86 selfloop transitions, 11 changer transitions 56/161 dead transitions. [2023-08-24 05:27:21,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 161 transitions, 1287 flow [2023-08-24 05:27:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:27:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:27:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2023-08-24 05:27:21,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232067510548524 [2023-08-24 05:27:21,704 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2023-08-24 05:27:21,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2023-08-24 05:27:21,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:21,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2023-08-24 05:27:21,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 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-24 05:27:21,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 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-24 05:27:21,709 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 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-24 05:27:21,709 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 290 flow. Second operand 6 states and 744 transitions. [2023-08-24 05:27:21,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 161 transitions, 1287 flow [2023-08-24 05:27:21,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 161 transitions, 1203 flow, removed 42 selfloop flow, removed 5 redundant places. [2023-08-24 05:27:21,840 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 359 flow [2023-08-24 05:27:21,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=359, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-24 05:27:21,841 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-08-24 05:27:21,841 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 359 flow [2023-08-24 05:27:21,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 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-24 05:27:21,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:21,842 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-24 05:27:21,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:27:21,842 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:21,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash 531315468, now seen corresponding path program 2 times [2023-08-24 05:27:21,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:21,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427603023] [2023-08-24 05:27:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:21,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:22,663 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-24 05:27:22,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427603023] [2023-08-24 05:27:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427603023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:22,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:22,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:27:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568702957] [2023-08-24 05:27:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:22,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:27:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:22,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:27:22,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:27:22,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 05:27:22,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 359 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 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-24 05:27:22,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:22,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 05:27:22,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:23,771 INFO L124 PetriNetUnfolderBase]: 5875/9817 cut-off events. [2023-08-24 05:27:23,772 INFO L125 PetriNetUnfolderBase]: For 16992/17721 co-relation queries the response was YES. [2023-08-24 05:27:23,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37167 conditions, 9817 events. 5875/9817 cut-off events. For 16992/17721 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 70508 event pairs, 774 based on Foata normal form. 394/9957 useless extension candidates. Maximal degree in co-relation 37140. Up to 3516 conditions per place. [2023-08-24 05:27:23,805 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 116 selfloop transitions, 13 changer transitions 28/165 dead transitions. [2023-08-24 05:27:23,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 165 transitions, 1305 flow [2023-08-24 05:27:23,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:27:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:27:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2023-08-24 05:27:23,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161744022503516 [2023-08-24 05:27:23,808 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2023-08-24 05:27:23,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2023-08-24 05:27:23,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:23,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2023-08-24 05:27:23,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 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-24 05:27:23,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 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-24 05:27:23,813 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 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-24 05:27:23,813 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 359 flow. Second operand 6 states and 734 transitions. [2023-08-24 05:27:23,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 165 transitions, 1305 flow [2023-08-24 05:27:24,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 165 transitions, 1295 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-24 05:27:24,032 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 442 flow [2023-08-24 05:27:24,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-08-24 05:27:24,032 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-08-24 05:27:24,032 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 442 flow [2023-08-24 05:27:24,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 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-24 05:27:24,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:24,033 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-24 05:27:24,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:27:24,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:24,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2123183322, now seen corresponding path program 3 times [2023-08-24 05:27:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9270187] [2023-08-24 05:27:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:24,243 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-24 05:27:24,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9270187] [2023-08-24 05:27:24,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9270187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:24,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:24,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:27:24,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628344069] [2023-08-24 05:27:24,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:24,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:27:24,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:24,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:27:24,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:27:24,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 05:27:24,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 442 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 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-24 05:27:24,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:24,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 05:27:24,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:24,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][69], [32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 195#(<= ~__unbuffered_cnt~0 2), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 209#(= ~z~0 1), 214#true, Black: 210#(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))), 244#(<= ~__unbuffered_cnt~0 1), Black: 150#(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))), 226#true, 92#L845true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff0~0 1) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0)), Black: 217#(and (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 172#(<= ~__unbuffered_cnt~0 1), 59#L869-3true, Black: 161#(= ~__unbuffered_cnt~0 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, Black: 236#(and (not (= 0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (<= 0 ~x$r_buff0_thd4~0)), Black: 229#(and (<= (div ~x$w_buff0_used~0 256) 0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0~0 1) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (<= 0 ~x$r_buff0_thd4~0)), Black: 234#(and (not (= 0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (<= 0 ~x$r_buff0_thd4~0)), Black: 184#(= ~a~0 1)]) [2023-08-24 05:27:24,782 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 05:27:24,782 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 05:27:24,782 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 05:27:24,782 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 05:27:24,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][98], [P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 209#(= ~z~0 1), 214#true, Black: 210#(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: 150#(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))), 245#(<= ~__unbuffered_cnt~0 2), 226#true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true, Black: 216#(and (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff0~0 1) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0)), Black: 217#(and (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 59#L869-3true, Black: 161#(= ~__unbuffered_cnt~0 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, Black: 236#(and (not (= 0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (<= 0 ~x$r_buff0_thd4~0)), Black: 229#(and (<= (div ~x$w_buff0_used~0 256) 0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0~0 1) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (<= 0 ~x$r_buff0_thd4~0)), Black: 234#(and (not (= 0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (<= 0 ~x$r_buff0_thd4~0)), 112#P0EXITtrue, Black: 172#(<= ~__unbuffered_cnt~0 1), 195#(<= ~__unbuffered_cnt~0 2), Black: 184#(= ~a~0 1)]) [2023-08-24 05:27:24,872 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 05:27:24,872 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:24,872 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:24,872 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 05:27:25,085 INFO L124 PetriNetUnfolderBase]: 5395/9033 cut-off events. [2023-08-24 05:27:25,085 INFO L125 PetriNetUnfolderBase]: For 25227/25662 co-relation queries the response was YES. [2023-08-24 05:27:25,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37608 conditions, 9033 events. 5395/9033 cut-off events. For 25227/25662 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 64935 event pairs, 594 based on Foata normal form. 322/9177 useless extension candidates. Maximal degree in co-relation 37577. Up to 3228 conditions per place. [2023-08-24 05:27:25,120 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 77 selfloop transitions, 18 changer transitions 50/152 dead transitions. [2023-08-24 05:27:25,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 152 transitions, 1355 flow [2023-08-24 05:27:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:27:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:27:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 950 transitions. [2023-08-24 05:27:25,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010548523206751 [2023-08-24 05:27:25,123 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 950 transitions. [2023-08-24 05:27:25,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 950 transitions. [2023-08-24 05:27:25,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:25,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 950 transitions. [2023-08-24 05:27:25,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 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-24 05:27:25,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 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-24 05:27:25,129 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 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-24 05:27:25,129 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 442 flow. Second operand 8 states and 950 transitions. [2023-08-24 05:27:25,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 152 transitions, 1355 flow [2023-08-24 05:27:25,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 152 transitions, 1296 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-24 05:27:25,529 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 387 flow [2023-08-24 05:27:25,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2023-08-24 05:27:25,529 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-08-24 05:27:25,529 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 387 flow [2023-08-24 05:27:25,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 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-24 05:27:25,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:25,530 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, 1] [2023-08-24 05:27:25,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:27:25,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:25,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1449487193, now seen corresponding path program 1 times [2023-08-24 05:27:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:25,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257455385] [2023-08-24 05:27:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:27:25,696 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-24 05:27:25,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:27:25,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257455385] [2023-08-24 05:27:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257455385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:27:25,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:27:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:27:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791190532] [2023-08-24 05:27:25,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:27:25,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:27:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:27:25,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:27:25,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:27:25,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-08-24 05:27:25,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 54 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-24 05:27:25,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:27:25,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-08-24 05:27:25,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:27:26,074 INFO L124 PetriNetUnfolderBase]: 2220/3730 cut-off events. [2023-08-24 05:27:26,075 INFO L125 PetriNetUnfolderBase]: For 10157/10180 co-relation queries the response was YES. [2023-08-24 05:27:26,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15983 conditions, 3730 events. 2220/3730 cut-off events. For 10157/10180 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 21473 event pairs, 513 based on Foata normal form. 11/3711 useless extension candidates. Maximal degree in co-relation 15954. Up to 2016 conditions per place. [2023-08-24 05:27:26,091 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 42 selfloop transitions, 1 changer transitions 56/102 dead transitions. [2023-08-24 05:27:26,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 946 flow [2023-08-24 05:27:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:27:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:27:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-24 05:27:26,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189873417721519 [2023-08-24 05:27:26,094 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-24 05:27:26,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-24 05:27:26,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:27:26,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-24 05:27:26,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 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-24 05:27:26,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 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-24 05:27:26,097 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 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-24 05:27:26,097 INFO L175 Difference]: Start difference. First operand has 76 places, 54 transitions, 387 flow. Second operand 4 states and 492 transitions. [2023-08-24 05:27:26,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 946 flow [2023-08-24 05:27:26,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 102 transitions, 772 flow, removed 47 selfloop flow, removed 11 redundant places. [2023-08-24 05:27:26,154 INFO L231 Difference]: Finished difference. Result has 67 places, 44 transitions, 245 flow [2023-08-24 05:27:26,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=67, PETRI_TRANSITIONS=44} [2023-08-24 05:27:26,155 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-24 05:27:26,155 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 245 flow [2023-08-24 05:27:26,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-24 05:27:26,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:27:26,155 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, 1] [2023-08-24 05:27:26,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:27:26,156 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:27:26,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:27:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash -624746367, now seen corresponding path program 2 times [2023-08-24 05:27:26,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:27:26,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112049855] [2023-08-24 05:27:26,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:27:26,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:27:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:27:26,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:27:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:27:26,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:27:26,311 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:27:26,312 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:27:26,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:27:26,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:27:26,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:27:26,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:27:26,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:27:26,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:27:26,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:27:26,318 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-24 05:27:26,324 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:27:26,325 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:27:26,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:27:26 BasicIcfg [2023-08-24 05:27:26,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:27:26,413 INFO L158 Benchmark]: Toolchain (without parser) took 25056.53ms. Allocated memory was 377.5MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 319.7MB in the beginning and 1.1GB in the end (delta: -799.4MB). Peak memory consumption was 613.1MB. Max. memory is 16.0GB. [2023-08-24 05:27:26,413 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 377.5MB. Free memory is still 353.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:27:26,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.20ms. Allocated memory is still 377.5MB. Free memory was 319.7MB in the beginning and 295.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:27:26,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.56ms. Allocated memory is still 377.5MB. Free memory was 295.7MB in the beginning and 293.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:27:26,414 INFO L158 Benchmark]: Boogie Preprocessor took 44.20ms. Allocated memory is still 377.5MB. Free memory was 293.6MB in the beginning and 291.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:27:26,414 INFO L158 Benchmark]: RCFGBuilder took 576.92ms. Allocated memory is still 377.5MB. Free memory was 291.5MB in the beginning and 253.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-24 05:27:26,415 INFO L158 Benchmark]: TraceAbstraction took 23764.32ms. Allocated memory was 377.5MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 252.7MB in the beginning and 1.1GB in the end (delta: -866.5MB). Peak memory consumption was 546.0MB. Max. memory is 16.0GB. [2023-08-24 05:27:26,416 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.14ms. Allocated memory is still 377.5MB. Free memory is still 353.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 595.20ms. Allocated memory is still 377.5MB. Free memory was 319.7MB in the beginning and 295.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.56ms. Allocated memory is still 377.5MB. Free memory was 295.7MB in the beginning and 293.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.20ms. Allocated memory is still 377.5MB. Free memory was 293.6MB in the beginning and 291.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 576.92ms. Allocated memory is still 377.5MB. Free memory was 291.5MB in the beginning and 253.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 23764.32ms. Allocated memory was 377.5MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 252.7MB in the beginning and 1.1GB in the end (delta: -866.5MB). Peak memory consumption was 546.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 29 TransitionsAfterwards, 3000 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 7767 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3176, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1542, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3176, independent: 1447, independent conditional: 0, independent unconditional: 1447, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1542, unknown conditional: 0, unknown unconditional: 1542] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((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(&t685, ((void *)0), P0, ((void *)0))=0, t685={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=1, t685={6:0}, t686={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L866] 0 pthread_t t687; [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t687, ((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(&t687, ((void *)0), P2, ((void *)0))=2, t685={6:0}, t686={7:0}, t687={8:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((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(&t688, ((void *)0), P3, ((void *)0))=3, t685={6:0}, t686={7:0}, t687={8:0}, t688={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L811] 3 y = 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L814] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L831] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L834] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L837] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 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, t685={6:0}, t686={7:0}, t687={8:0}, t688={5:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 19]: 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: 869]: 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: 865]: 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: 867]: 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, 166 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: 23.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 415 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1407 IncrementalHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 14 mSDtfsCounter, 1407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=7, InterpolantAutomatonStates: 62, 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.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 1198 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-24 05:27:26,437 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...