/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:27:23,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:27:23,192 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-SemanticLbe.epf [2023-11-17 11:27:23,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:27:23,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:27:23,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:27:23,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:27:23,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:27:23,229 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:27:23,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:27:23,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:27:23,233 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:27:23,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:27:23,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:27:23,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:27:23,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:27:23,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:27:23,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:27:23,236 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:27:23,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:27:23,236 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:27:23,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:27:23,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:27:23,237 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:27:23,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:27:23,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:27:23,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:27:23,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:27:23,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:27:23,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:27:23,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:27:23,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:27:23,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:27:23,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:27:23,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:27:23,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:27:23,512 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:27:23,513 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:27:23,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 11:27:24,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:27:25,012 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:27:25,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 11:27:25,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ed7abc3/1eb00e5967aa44b79b804b508001f695/FLAG936f564a1 [2023-11-17 11:27:25,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ed7abc3/1eb00e5967aa44b79b804b508001f695 [2023-11-17 11:27:25,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:27:25,042 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:27:25,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:27:25,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:27:25,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:27:25,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f56cbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25, skipping insertion in model container [2023-11-17 11:27:25,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,099 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:27:25,264 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/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 11:27:25,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:27:25,524 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:27:25,538 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/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 11:27:25,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:27:25,626 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:27:25,626 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:27:25,633 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:27:25,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25 WrapperNode [2023-11-17 11:27:25,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:27:25,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:27:25,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:27:25,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:27:25,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,708 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-11-17 11:27:25,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:27:25,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:27:25,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:27:25,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:27:25,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:27:25,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:27:25,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:27:25,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:27:25,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (1/1) ... [2023-11-17 11:27:25,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:27:25,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:27:25,835 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-11-17 11:27:25,846 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-11-17 11:27:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:27:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:27:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:27:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:27:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:27:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:27:25,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:27:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:27:25,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:27:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:27:25,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:27:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 11:27:25,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 11:27:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:27:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:27:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:27:25,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:27:25,878 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:27:26,005 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:27:26,007 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:27:26,392 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:27:26,623 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:27:26,623 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:27:26,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:27:26 BoogieIcfgContainer [2023-11-17 11:27:26,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:27:26,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:27:26,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:27:26,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:27:26,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:27:25" (1/3) ... [2023-11-17 11:27:26,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723b8da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:27:26, skipping insertion in model container [2023-11-17 11:27:26,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:25" (2/3) ... [2023-11-17 11:27:26,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723b8da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:27:26, skipping insertion in model container [2023-11-17 11:27:26,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:27:26" (3/3) ... [2023-11-17 11:27:26,634 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 11:27:26,651 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:27:26,652 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:27:26,652 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:27:26,714 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:27:26,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 49 transitions, 114 flow [2023-11-17 11:27:26,793 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2023-11-17 11:27:26,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:27:26,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-17 11:27:26,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 49 transitions, 114 flow [2023-11-17 11:27:26,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 45 transitions, 102 flow [2023-11-17 11:27:26,806 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:27:26,827 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 102 flow [2023-11-17 11:27:26,829 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 102 flow [2023-11-17 11:27:26,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 102 flow [2023-11-17 11:27:26,861 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2023-11-17 11:27:26,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:27:26,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-17 11:27:26,863 INFO L119 LiptonReduction]: Number of co-enabled transitions 1244 [2023-11-17 11:27:27,871 INFO L134 LiptonReduction]: Checked pairs total: 3956 [2023-11-17 11:27:27,872 INFO L136 LiptonReduction]: Total number of compositions: 24 [2023-11-17 11:27:27,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:27:27,902 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=LoopHeads, 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;@ecd2144, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:27:27,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:27:27,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:27:27,907 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-17 11:27:27,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:27:27,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:27,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:27:27,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:27,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 408293, now seen corresponding path program 1 times [2023-11-17 11:27:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:27,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984557603] [2023-11-17 11:27:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984557603] [2023-11-17 11:27:28,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984557603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:28,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:28,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:27:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804529791] [2023-11-17 11:27:28,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:28,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:28,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:28,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:28,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 73 [2023-11-17 11:27:28,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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-11-17 11:27:28,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:28,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 73 [2023-11-17 11:27:28,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:29,419 INFO L124 PetriNetUnfolderBase]: 4903/7121 cut-off events. [2023-11-17 11:27:29,419 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-17 11:27:29,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13969 conditions, 7121 events. 4903/7121 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 41581 event pairs, 895 based on Foata normal form. 0/6795 useless extension candidates. Maximal degree in co-relation 13957. Up to 5335 conditions per place. [2023-11-17 11:27:29,480 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-17 11:27:29,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2023-11-17 11:27:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-17 11:27:29,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5296803652968036 [2023-11-17 11:27:29,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-17 11:27:29,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-17 11:27:29,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:29,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-17 11:27:29,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-17 11:27:29,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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-11-17 11:27:29,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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-11-17 11:27:29,507 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 116 transitions. [2023-11-17 11:27:29,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2023-11-17 11:27:29,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:27:29,511 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-11-17 11:27:29,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, 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-11-17 11:27:29,516 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-17 11:27:29,516 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-11-17 11:27:29,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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-11-17 11:27:29,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:29,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:29,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:27:29,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:29,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:29,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1378810699, now seen corresponding path program 1 times [2023-11-17 11:27:29,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:29,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468916920] [2023-11-17 11:27:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:29,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:29,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468916920] [2023-11-17 11:27:29,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468916920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:29,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:29,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:27:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952347669] [2023-11-17 11:27:29,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:29,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:29,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:29,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:29,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 73 [2023-11-17 11:27:29,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-17 11:27:29,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:29,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 73 [2023-11-17 11:27:29,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:31,668 INFO L124 PetriNetUnfolderBase]: 13530/18448 cut-off events. [2023-11-17 11:27:31,668 INFO L125 PetriNetUnfolderBase]: For 932/932 co-relation queries the response was YES. [2023-11-17 11:27:31,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38229 conditions, 18448 events. 13530/18448 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 95929 event pairs, 5412 based on Foata normal form. 587/19035 useless extension candidates. Maximal degree in co-relation 38219. Up to 9251 conditions per place. [2023-11-17 11:27:31,811 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 41 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2023-11-17 11:27:31,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2023-11-17 11:27:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-17 11:27:31,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4474885844748858 [2023-11-17 11:27:31,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-17 11:27:31,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-17 11:27:31,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:31,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-17 11:27:31,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:31,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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-11-17 11:27:31,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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-11-17 11:27:31,816 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 98 transitions. [2023-11-17 11:27:31,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2023-11-17 11:27:31,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:31,818 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 124 flow [2023-11-17 11:27:31,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-11-17 11:27:31,819 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-17 11:27:31,820 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 124 flow [2023-11-17 11:27:31,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-17 11:27:31,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:31,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:31,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:27:31,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:31,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash -206541290, now seen corresponding path program 1 times [2023-11-17 11:27:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:31,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010432071] [2023-11-17 11:27:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:32,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:32,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010432071] [2023-11-17 11:27:32,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010432071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:32,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:32,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:27:32,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261536818] [2023-11-17 11:27:32,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:32,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:32,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:32,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:32,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:32,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 73 [2023-11-17 11:27:32,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:32,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:32,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 73 [2023-11-17 11:27:32,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:34,008 INFO L124 PetriNetUnfolderBase]: 13208/18015 cut-off events. [2023-11-17 11:27:34,008 INFO L125 PetriNetUnfolderBase]: For 6869/6869 co-relation queries the response was YES. [2023-11-17 11:27:34,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46391 conditions, 18015 events. 13208/18015 cut-off events. For 6869/6869 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 93719 event pairs, 1386 based on Foata normal form. 45/18060 useless extension candidates. Maximal degree in co-relation 46379. Up to 8772 conditions per place. [2023-11-17 11:27:34,128 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 58 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2023-11-17 11:27:34,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 378 flow [2023-11-17 11:27:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2023-11-17 11:27:34,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417808219178082 [2023-11-17 11:27:34,131 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 129 transitions. [2023-11-17 11:27:34,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 129 transitions. [2023-11-17 11:27:34,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:34,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 129 transitions. [2023-11-17 11:27:34,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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-11-17 11:27:34,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:34,133 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:34,133 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 124 flow. Second operand 4 states and 129 transitions. [2023-11-17 11:27:34,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 378 flow [2023-11-17 11:27:34,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:34,151 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 202 flow [2023-11-17 11:27:34,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2023-11-17 11:27:34,152 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-11-17 11:27:34,152 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 202 flow [2023-11-17 11:27:34,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:34,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:34,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:34,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:27:34,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:34,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash -206540980, now seen corresponding path program 1 times [2023-11-17 11:27:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:34,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296155455] [2023-11-17 11:27:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:34,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:34,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296155455] [2023-11-17 11:27:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296155455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:34,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:34,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:27:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468020392] [2023-11-17 11:27:34,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:34,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:34,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:34,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:34,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 73 [2023-11-17 11:27:34,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:34,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:34,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 73 [2023-11-17 11:27:34,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:35,951 INFO L124 PetriNetUnfolderBase]: 13012/17752 cut-off events. [2023-11-17 11:27:35,951 INFO L125 PetriNetUnfolderBase]: For 16566/16566 co-relation queries the response was YES. [2023-11-17 11:27:36,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50162 conditions, 17752 events. 13012/17752 cut-off events. For 16566/16566 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 91192 event pairs, 1025 based on Foata normal form. 25/17777 useless extension candidates. Maximal degree in co-relation 50147. Up to 8340 conditions per place. [2023-11-17 11:27:36,073 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 63 selfloop transitions, 18 changer transitions 0/81 dead transitions. [2023-11-17 11:27:36,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 81 transitions, 526 flow [2023-11-17 11:27:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2023-11-17 11:27:36,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349315068493151 [2023-11-17 11:27:36,077 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 127 transitions. [2023-11-17 11:27:36,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 127 transitions. [2023-11-17 11:27:36,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:36,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 127 transitions. [2023-11-17 11:27:36,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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-11-17 11:27:36,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:36,080 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:36,080 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 202 flow. Second operand 4 states and 127 transitions. [2023-11-17 11:27:36,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 81 transitions, 526 flow [2023-11-17 11:27:36,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 526 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:27:36,111 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 380 flow [2023-11-17 11:27:36,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2023-11-17 11:27:36,113 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-11-17 11:27:36,113 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 380 flow [2023-11-17 11:27:36,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:36,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:36,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:36,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:27:36,114 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:36,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1900824465, now seen corresponding path program 1 times [2023-11-17 11:27:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:36,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271095618] [2023-11-17 11:27:36,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:36,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:36,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:36,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271095618] [2023-11-17 11:27:36,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271095618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:36,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:36,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:27:36,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647611079] [2023-11-17 11:27:36,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:36,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:36,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:36,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:36,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:36,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 73 [2023-11-17 11:27:36,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11-17 11:27:36,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:36,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 73 [2023-11-17 11:27:36,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:38,103 INFO L124 PetriNetUnfolderBase]: 11035/15613 cut-off events. [2023-11-17 11:27:38,104 INFO L125 PetriNetUnfolderBase]: For 32249/32582 co-relation queries the response was YES. [2023-11-17 11:27:38,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48896 conditions, 15613 events. 11035/15613 cut-off events. For 32249/32582 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 86784 event pairs, 4687 based on Foata normal form. 335/15930 useless extension candidates. Maximal degree in co-relation 48876. Up to 14084 conditions per place. [2023-11-17 11:27:38,227 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 63 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2023-11-17 11:27:38,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 678 flow [2023-11-17 11:27:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2023-11-17 11:27:38,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748858447488584 [2023-11-17 11:27:38,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 104 transitions. [2023-11-17 11:27:38,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 104 transitions. [2023-11-17 11:27:38,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:38,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 104 transitions. [2023-11-17 11:27:38,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-11-17 11:27:38,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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-11-17 11:27:38,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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-11-17 11:27:38,234 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 380 flow. Second operand 3 states and 104 transitions. [2023-11-17 11:27:38,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 678 flow [2023-11-17 11:27:38,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 678 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:27:38,280 INFO L231 Difference]: Finished difference. Result has 53 places, 61 transitions, 480 flow [2023-11-17 11:27:38,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=53, PETRI_TRANSITIONS=61} [2023-11-17 11:27:38,282 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-11-17 11:27:38,282 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 61 transitions, 480 flow [2023-11-17 11:27:38,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11-17 11:27:38,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:38,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:38,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:27:38,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:38,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash -917710702, now seen corresponding path program 1 times [2023-11-17 11:27:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405219253] [2023-11-17 11:27:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:38,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:38,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405219253] [2023-11-17 11:27:38,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405219253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:38,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:38,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67580193] [2023-11-17 11:27:38,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:38,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:38,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:38,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:38,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:38,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 73 [2023-11-17 11:27:38,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 61 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-17 11:27:38,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:38,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 73 [2023-11-17 11:27:38,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:40,547 INFO L124 PetriNetUnfolderBase]: 17657/24312 cut-off events. [2023-11-17 11:27:40,547 INFO L125 PetriNetUnfolderBase]: For 56279/56279 co-relation queries the response was YES. [2023-11-17 11:27:40,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77229 conditions, 24312 events. 17657/24312 cut-off events. For 56279/56279 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 135659 event pairs, 3254 based on Foata normal form. 300/24612 useless extension candidates. Maximal degree in co-relation 77206. Up to 10131 conditions per place. [2023-11-17 11:27:40,793 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 67 selfloop transitions, 31 changer transitions 2/100 dead transitions. [2023-11-17 11:27:40,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 100 transitions, 834 flow [2023-11-17 11:27:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-11-17 11:27:40,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4589041095890411 [2023-11-17 11:27:40,794 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 134 transitions. [2023-11-17 11:27:40,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 134 transitions. [2023-11-17 11:27:40,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:40,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 134 transitions. [2023-11-17 11:27:40,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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-11-17 11:27:40,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:40,796 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:40,796 INFO L175 Difference]: Start difference. First operand has 53 places, 61 transitions, 480 flow. Second operand 4 states and 134 transitions. [2023-11-17 11:27:40,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 100 transitions, 834 flow [2023-11-17 11:27:40,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 100 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:40,857 INFO L231 Difference]: Finished difference. Result has 58 places, 65 transitions, 660 flow [2023-11-17 11:27:40,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=660, PETRI_PLACES=58, PETRI_TRANSITIONS=65} [2023-11-17 11:27:40,858 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-11-17 11:27:40,858 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 65 transitions, 660 flow [2023-11-17 11:27:40,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-17 11:27:40,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:40,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:40,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:27:40,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:40,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash -917674184, now seen corresponding path program 1 times [2023-11-17 11:27:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156249639] [2023-11-17 11:27:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:40,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:40,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:40,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156249639] [2023-11-17 11:27:40,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156249639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:40,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:40,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:27:40,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659879942] [2023-11-17 11:27:40,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:41,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:41,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:41,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 73 [2023-11-17 11:27:41,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 65 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-11-17 11:27:41,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:41,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 73 [2023-11-17 11:27:41,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:42,382 INFO L124 PetriNetUnfolderBase]: 8623/12971 cut-off events. [2023-11-17 11:27:42,382 INFO L125 PetriNetUnfolderBase]: For 48449/49637 co-relation queries the response was YES. [2023-11-17 11:27:42,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41183 conditions, 12971 events. 8623/12971 cut-off events. For 48449/49637 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 80923 event pairs, 1794 based on Foata normal form. 884/13789 useless extension candidates. Maximal degree in co-relation 41156. Up to 10934 conditions per place. [2023-11-17 11:27:42,453 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 79 selfloop transitions, 5 changer transitions 0/104 dead transitions. [2023-11-17 11:27:42,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 1168 flow [2023-11-17 11:27:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-17 11:27:42,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4474885844748858 [2023-11-17 11:27:42,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-17 11:27:42,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-17 11:27:42,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:42,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-17 11:27:42,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:42,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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-11-17 11:27:42,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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-11-17 11:27:42,456 INFO L175 Difference]: Start difference. First operand has 58 places, 65 transitions, 660 flow. Second operand 3 states and 98 transitions. [2023-11-17 11:27:42,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 1168 flow [2023-11-17 11:27:42,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 104 transitions, 1164 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-17 11:27:42,480 INFO L231 Difference]: Finished difference. Result has 61 places, 69 transitions, 691 flow [2023-11-17 11:27:42,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=61, PETRI_TRANSITIONS=69} [2023-11-17 11:27:42,481 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-11-17 11:27:42,481 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 691 flow [2023-11-17 11:27:42,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-11-17 11:27:42,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:42,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:42,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:27:42,482 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:42,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash -534305382, now seen corresponding path program 1 times [2023-11-17 11:27:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:42,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996691849] [2023-11-17 11:27:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:42,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996691849] [2023-11-17 11:27:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996691849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:42,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571619241] [2023-11-17 11:27:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:42,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:42,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 73 [2023-11-17 11:27:42,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 691 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:42,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:42,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 73 [2023-11-17 11:27:42,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:44,623 INFO L124 PetriNetUnfolderBase]: 15448/22350 cut-off events. [2023-11-17 11:27:44,624 INFO L125 PetriNetUnfolderBase]: For 83965/83965 co-relation queries the response was YES. [2023-11-17 11:27:44,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82789 conditions, 22350 events. 15448/22350 cut-off events. For 83965/83965 co-relation queries the response was YES. Maximal size of possible extension queue 937. Compared 137190 event pairs, 2511 based on Foata normal form. 165/22515 useless extension candidates. Maximal degree in co-relation 82759. Up to 10040 conditions per place. [2023-11-17 11:27:44,764 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 79 selfloop transitions, 34 changer transitions 5/118 dead transitions. [2023-11-17 11:27:44,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 118 transitions, 1203 flow [2023-11-17 11:27:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-11-17 11:27:44,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2023-11-17 11:27:44,765 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 132 transitions. [2023-11-17 11:27:44,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 132 transitions. [2023-11-17 11:27:44,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:44,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 132 transitions. [2023-11-17 11:27:44,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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-11-17 11:27:44,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:44,766 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:44,767 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 691 flow. Second operand 4 states and 132 transitions. [2023-11-17 11:27:44,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 118 transitions, 1203 flow [2023-11-17 11:27:44,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 1190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:44,837 INFO L231 Difference]: Finished difference. Result has 66 places, 73 transitions, 902 flow [2023-11-17 11:27:44,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=902, PETRI_PLACES=66, PETRI_TRANSITIONS=73} [2023-11-17 11:27:44,838 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-11-17 11:27:44,838 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 902 flow [2023-11-17 11:27:44,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:44,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:44,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:44,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:27:44,839 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:44,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash -592384617, now seen corresponding path program 1 times [2023-11-17 11:27:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:44,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704250311] [2023-11-17 11:27:44,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:45,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704250311] [2023-11-17 11:27:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704250311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:45,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54889008] [2023-11-17 11:27:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:45,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:45,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:45,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:45,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 73 [2023-11-17 11:27:45,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 902 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-17 11:27:45,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:45,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 73 [2023-11-17 11:27:45,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:48,458 INFO L124 PetriNetUnfolderBase]: 21271/31071 cut-off events. [2023-11-17 11:27:48,458 INFO L125 PetriNetUnfolderBase]: For 150112/150112 co-relation queries the response was YES. [2023-11-17 11:27:48,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116400 conditions, 31071 events. 21271/31071 cut-off events. For 150112/150112 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 203840 event pairs, 6633 based on Foata normal form. 168/31239 useless extension candidates. Maximal degree in co-relation 116366. Up to 13949 conditions per place. [2023-11-17 11:27:48,628 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 87 selfloop transitions, 33 changer transitions 13/133 dead transitions. [2023-11-17 11:27:48,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 133 transitions, 1620 flow [2023-11-17 11:27:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-11-17 11:27:48,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657534246575342 [2023-11-17 11:27:48,630 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 136 transitions. [2023-11-17 11:27:48,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 136 transitions. [2023-11-17 11:27:48,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:48,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 136 transitions. [2023-11-17 11:27:48,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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-11-17 11:27:48,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:48,632 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:48,632 INFO L175 Difference]: Start difference. First operand has 66 places, 73 transitions, 902 flow. Second operand 4 states and 136 transitions. [2023-11-17 11:27:48,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 133 transitions, 1620 flow [2023-11-17 11:27:48,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 133 transitions, 1618 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-17 11:27:48,789 INFO L231 Difference]: Finished difference. Result has 72 places, 77 transitions, 1134 flow [2023-11-17 11:27:48,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1134, PETRI_PLACES=72, PETRI_TRANSITIONS=77} [2023-11-17 11:27:48,790 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-11-17 11:27:48,790 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 77 transitions, 1134 flow [2023-11-17 11:27:48,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-17 11:27:48,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:48,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:48,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:27:48,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:48,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1618605991, now seen corresponding path program 1 times [2023-11-17 11:27:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:48,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295220137] [2023-11-17 11:27:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:48,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:48,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295220137] [2023-11-17 11:27:48,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295220137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:48,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:48,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946827743] [2023-11-17 11:27:48,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:48,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:48,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:48,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:48,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 73 [2023-11-17 11:27:48,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 77 transitions, 1134 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:48,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:48,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 73 [2023-11-17 11:27:48,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:50,675 INFO L124 PetriNetUnfolderBase]: 8646/13783 cut-off events. [2023-11-17 11:27:50,675 INFO L125 PetriNetUnfolderBase]: For 66970/67594 co-relation queries the response was YES. [2023-11-17 11:27:50,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48658 conditions, 13783 events. 8646/13783 cut-off events. For 66970/67594 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 96440 event pairs, 1548 based on Foata normal form. 1282/14896 useless extension candidates. Maximal degree in co-relation 48619. Up to 7435 conditions per place. [2023-11-17 11:27:50,766 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 117 selfloop transitions, 9 changer transitions 6/153 dead transitions. [2023-11-17 11:27:50,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 153 transitions, 2394 flow [2023-11-17 11:27:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2023-11-17 11:27:50,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4554794520547945 [2023-11-17 11:27:50,769 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 133 transitions. [2023-11-17 11:27:50,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 133 transitions. [2023-11-17 11:27:50,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:50,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 133 transitions. [2023-11-17 11:27:50,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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-11-17 11:27:50,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:50,770 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:50,770 INFO L175 Difference]: Start difference. First operand has 72 places, 77 transitions, 1134 flow. Second operand 4 states and 133 transitions. [2023-11-17 11:27:50,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 153 transitions, 2394 flow [2023-11-17 11:27:50,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 153 transitions, 2372 flow, removed 11 selfloop flow, removed 0 redundant places. [2023-11-17 11:27:50,808 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 1158 flow [2023-11-17 11:27:50,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1158, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2023-11-17 11:27:50,809 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-11-17 11:27:50,809 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 1158 flow [2023-11-17 11:27:50,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:50,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:50,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:50,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:27:50,810 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:50,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 37751382, now seen corresponding path program 1 times [2023-11-17 11:27:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005547653] [2023-11-17 11:27:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:51,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:51,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005547653] [2023-11-17 11:27:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005547653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:51,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:51,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:51,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104498741] [2023-11-17 11:27:51,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:51,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:27:51,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:51,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:27:51,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:27:51,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 73 [2023-11-17 11:27:51,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 1158 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:51,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:51,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 73 [2023-11-17 11:27:51,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:52,356 INFO L124 PetriNetUnfolderBase]: 5845/9363 cut-off events. [2023-11-17 11:27:52,357 INFO L125 PetriNetUnfolderBase]: For 52196/52719 co-relation queries the response was YES. [2023-11-17 11:27:52,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38746 conditions, 9363 events. 5845/9363 cut-off events. For 52196/52719 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 62855 event pairs, 1096 based on Foata normal form. 715/9924 useless extension candidates. Maximal degree in co-relation 38704. Up to 3527 conditions per place. [2023-11-17 11:27:52,399 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 112 selfloop transitions, 13 changer transitions 34/174 dead transitions. [2023-11-17 11:27:52,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 174 transitions, 2670 flow [2023-11-17 11:27:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:27:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:27:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2023-11-17 11:27:52,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547945205479452 [2023-11-17 11:27:52,401 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 166 transitions. [2023-11-17 11:27:52,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 166 transitions. [2023-11-17 11:27:52,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:52,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 166 transitions. [2023-11-17 11:27:52,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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-11-17 11:27:52,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 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-11-17 11:27:52,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 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-11-17 11:27:52,402 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 1158 flow. Second operand 5 states and 166 transitions. [2023-11-17 11:27:52,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 174 transitions, 2670 flow [2023-11-17 11:27:52,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 174 transitions, 2652 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:52,435 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 954 flow [2023-11-17 11:27:52,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=954, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2023-11-17 11:27:52,436 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2023-11-17 11:27:52,436 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 954 flow [2023-11-17 11:27:52,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:52,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:52,437 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-11-17 11:27:52,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:27:52,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:52,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:52,437 INFO L85 PathProgramCache]: Analyzing trace with hash 755119322, now seen corresponding path program 1 times [2023-11-17 11:27:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:52,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413857806] [2023-11-17 11:27:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:52,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:52,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:52,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413857806] [2023-11-17 11:27:52,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413857806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:52,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:52,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:27:52,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085260676] [2023-11-17 11:27:52,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:52,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:27:52,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:52,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:27:52,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:27:52,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 73 [2023-11-17 11:27:52,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 954 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 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-11-17 11:27:52,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:52,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 73 [2023-11-17 11:27:52,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:53,566 INFO L124 PetriNetUnfolderBase]: 4372/7051 cut-off events. [2023-11-17 11:27:53,567 INFO L125 PetriNetUnfolderBase]: For 40649/41084 co-relation queries the response was YES. [2023-11-17 11:27:53,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29555 conditions, 7051 events. 4372/7051 cut-off events. For 40649/41084 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 47004 event pairs, 906 based on Foata normal form. 229/7139 useless extension candidates. Maximal degree in co-relation 29512. Up to 2859 conditions per place. [2023-11-17 11:27:53,605 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 52 selfloop transitions, 17 changer transitions 73/145 dead transitions. [2023-11-17 11:27:53,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 145 transitions, 2094 flow [2023-11-17 11:27:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:27:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:27:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2023-11-17 11:27:53,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4200913242009132 [2023-11-17 11:27:53,607 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 184 transitions. [2023-11-17 11:27:53,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 184 transitions. [2023-11-17 11:27:53,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:53,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 184 transitions. [2023-11-17 11:27:53,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 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-11-17 11:27:53,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 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-11-17 11:27:53,609 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 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-11-17 11:27:53,609 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 954 flow. Second operand 6 states and 184 transitions. [2023-11-17 11:27:53,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 145 transitions, 2094 flow [2023-11-17 11:27:53,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 145 transitions, 1982 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-11-17 11:27:53,813 INFO L231 Difference]: Finished difference. Result has 80 places, 39 transitions, 338 flow [2023-11-17 11:27:53,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=80, PETRI_TRANSITIONS=39} [2023-11-17 11:27:53,814 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2023-11-17 11:27:53,814 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 39 transitions, 338 flow [2023-11-17 11:27:53,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 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-11-17 11:27:53,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:53,815 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-11-17 11:27:53,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:27:53,815 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:53,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:53,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1781879390, now seen corresponding path program 1 times [2023-11-17 11:27:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:53,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117667177] [2023-11-17 11:27:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:53,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117667177] [2023-11-17 11:27:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117667177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:27:54,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993752747] [2023-11-17 11:27:54,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:54,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:27:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:54,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:27:54,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:27:54,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 73 [2023-11-17 11:27:54,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 39 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 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-11-17 11:27:54,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:54,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 73 [2023-11-17 11:27:54,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:55,095 INFO L124 PetriNetUnfolderBase]: 623/1014 cut-off events. [2023-11-17 11:27:55,095 INFO L125 PetriNetUnfolderBase]: For 4905/4905 co-relation queries the response was YES. [2023-11-17 11:27:55,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 1014 events. 623/1014 cut-off events. For 4905/4905 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4103 event pairs, 83 based on Foata normal form. 1/1015 useless extension candidates. Maximal degree in co-relation 4321. Up to 439 conditions per place. [2023-11-17 11:27:55,099 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 45 selfloop transitions, 4 changer transitions 43/95 dead transitions. [2023-11-17 11:27:55,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 95 transitions, 899 flow [2023-11-17 11:27:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:27:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:27:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2023-11-17 11:27:55,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246575342465753 [2023-11-17 11:27:55,100 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 217 transitions. [2023-11-17 11:27:55,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 217 transitions. [2023-11-17 11:27:55,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:55,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 217 transitions. [2023-11-17 11:27:55,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 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-11-17 11:27:55,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 73.0) internal successors, (584), 8 states have internal predecessors, (584), 0 states have call successors, (0), 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-11-17 11:27:55,103 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 73.0) internal successors, (584), 8 states have internal predecessors, (584), 0 states have call successors, (0), 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-11-17 11:27:55,103 INFO L175 Difference]: Start difference. First operand has 80 places, 39 transitions, 338 flow. Second operand 7 states and 217 transitions. [2023-11-17 11:27:55,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 95 transitions, 899 flow [2023-11-17 11:27:55,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 576 flow, removed 39 selfloop flow, removed 33 redundant places. [2023-11-17 11:27:55,111 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 185 flow [2023-11-17 11:27:55,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-11-17 11:27:55,112 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-11-17 11:27:55,112 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 185 flow [2023-11-17 11:27:55,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 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-11-17 11:27:55,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:55,113 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-11-17 11:27:55,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:27:55,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:55,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:55,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1905213006, now seen corresponding path program 2 times [2023-11-17 11:27:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:55,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659352178] [2023-11-17 11:27:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:55,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659352178] [2023-11-17 11:27:55,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659352178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:55,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:55,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:27:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351828083] [2023-11-17 11:27:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:55,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:27:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:27:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:27:55,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 73 [2023-11-17 11:27:55,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 185 flow. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 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-11-17 11:27:55,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:55,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 73 [2023-11-17 11:27:55,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:56,337 INFO L124 PetriNetUnfolderBase]: 560/951 cut-off events. [2023-11-17 11:27:56,337 INFO L125 PetriNetUnfolderBase]: For 1024/1024 co-relation queries the response was YES. [2023-11-17 11:27:56,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3149 conditions, 951 events. 560/951 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4110 event pairs, 27 based on Foata normal form. 1/952 useless extension candidates. Maximal degree in co-relation 3135. Up to 347 conditions per place. [2023-11-17 11:27:56,341 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 85 selfloop transitions, 10 changer transitions 40/138 dead transitions. [2023-11-17 11:27:56,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 138 transitions, 930 flow [2023-11-17 11:27:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:27:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:27:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 255 transitions. [2023-11-17 11:27:56,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4366438356164384 [2023-11-17 11:27:56,346 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 255 transitions. [2023-11-17 11:27:56,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 255 transitions. [2023-11-17 11:27:56,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:56,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 255 transitions. [2023-11-17 11:27:56,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 31.875) internal successors, (255), 8 states have internal predecessors, (255), 0 states have call successors, (0), 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-11-17 11:27:56,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 73.0) internal successors, (657), 9 states have internal predecessors, (657), 0 states have call successors, (0), 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-11-17 11:27:56,348 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 73.0) internal successors, (657), 9 states have internal predecessors, (657), 0 states have call successors, (0), 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-11-17 11:27:56,348 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 185 flow. Second operand 8 states and 255 transitions. [2023-11-17 11:27:56,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 138 transitions, 930 flow [2023-11-17 11:27:56,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 138 transitions, 909 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-17 11:27:56,356 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 243 flow [2023-11-17 11:27:56,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=243, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-11-17 11:27:56,357 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-11-17 11:27:56,357 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 243 flow [2023-11-17 11:27:56,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 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-11-17 11:27:56,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:56,357 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-11-17 11:27:56,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:27:56,358 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:56,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1415084552, now seen corresponding path program 3 times [2023-11-17 11:27:56,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:56,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895881255] [2023-11-17 11:27:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:56,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:56,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:27:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:56,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:27:56,514 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:27:56,515 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 11:27:56,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 11:27:56,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 11:27:56,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 11:27:56,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 11:27:56,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 11:27:56,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 11:27:56,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 11:27:56,521 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:56,527 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:27:56,528 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:27:56,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:27:56,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:27:56,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:27:56,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 11:27:56,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:27:56 BasicIcfg [2023-11-17 11:27:56,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:27:56,625 INFO L158 Benchmark]: Toolchain (without parser) took 31582.31ms. Allocated memory was 215.0MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 145.9MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-11-17 11:27:56,625 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 215.0MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:27:56,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.98ms. Allocated memory was 215.0MB in the beginning and 294.6MB in the end (delta: 79.7MB). Free memory was 145.7MB in the beginning and 252.7MB in the end (delta: -107.0MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. [2023-11-17 11:27:56,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.83ms. Allocated memory is still 294.6MB. Free memory was 252.7MB in the beginning and 250.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:56,626 INFO L158 Benchmark]: Boogie Preprocessor took 58.40ms. Allocated memory is still 294.6MB. Free memory was 250.1MB in the beginning and 248.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:56,626 INFO L158 Benchmark]: RCFGBuilder took 851.18ms. Allocated memory is still 294.6MB. Free memory was 248.0MB in the beginning and 195.0MB in the end (delta: 53.0MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2023-11-17 11:27:56,626 INFO L158 Benchmark]: TraceAbstraction took 29997.37ms. Allocated memory was 294.6MB in the beginning and 5.2GB in the end (delta: 4.9GB). Free memory was 194.5MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-11-17 11:27:56,627 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.13ms. Allocated memory is still 215.0MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 589.98ms. Allocated memory was 215.0MB in the beginning and 294.6MB in the end (delta: 79.7MB). Free memory was 145.7MB in the beginning and 252.7MB in the end (delta: -107.0MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.83ms. Allocated memory is still 294.6MB. Free memory was 252.7MB in the beginning and 250.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.40ms. Allocated memory is still 294.6MB. Free memory was 250.1MB in the beginning and 248.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 851.18ms. Allocated memory is still 294.6MB. Free memory was 248.0MB in the beginning and 195.0MB in the end (delta: 53.0MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * TraceAbstraction took 29997.37ms. Allocated memory was 294.6MB in the beginning and 5.2GB in the end (delta: 4.9GB). Free memory was 194.5MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 56 PlacesBefore, 42 PlacesAfterwards, 45 TransitionsBefore, 30 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 24 TotalNumberOfCompositions, 3956 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1699, independent: 1562, independent conditional: 0, independent unconditional: 1562, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 824, independent: 776, independent conditional: 0, independent unconditional: 776, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 824, independent: 737, independent conditional: 0, independent unconditional: 737, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 361, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1699, independent: 786, independent conditional: 0, independent unconditional: 786, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 824, unknown conditional: 0, unknown unconditional: 824] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L796] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L799] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L816] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=2, z=2] [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=2, z=2] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=2] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 81 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: 29.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1372 IncrementalHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 32 mSDtfsCounter, 1372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1158occurred in iteration=10, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-11-17 11:27:56,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...