/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/mix011_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:24:22,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:24:22,482 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:24:22,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:24:22,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:24:22,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:24:22,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:24:22,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:24:22,519 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:24:22,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:24:22,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:24:22,520 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:24:22,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:24:22,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:24:22,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:24:22,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:24:22,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:24:22,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:24:22,528 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:24:22,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:24:22,529 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:24:22,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:24:22,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:24:22,534 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:24:22,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:24:22,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:22,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:24:22,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:24:22,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:24:22,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:24:22,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:24:22,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:24:22,536 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:24:22,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:24:22,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:24:22,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:24:22,800 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:24:22,801 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:24:22,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 11:24:24,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:24:24,338 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:24:24,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 11:24:24,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76c19a85/799c5eb84cc7493fa7fb6a8d68690276/FLAG6c9b15c50 [2023-11-17 11:24:24,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76c19a85/799c5eb84cc7493fa7fb6a8d68690276 [2023-11-17 11:24:24,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:24:24,388 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:24:24,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:24,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:24:24,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:24:24,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:24,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46394ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24, skipping insertion in model container [2023-11-17 11:24:24,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:24,448 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:24:24,590 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 11:24:24,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:24,839 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:24:24,851 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 11:24:24,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:24,928 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:24,928 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:24,935 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:24:24,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24 WrapperNode [2023-11-17 11:24:24,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:24,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:24,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:24:24,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:24:24,943 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:24:24" (1/1) ... [2023-11-17 11:24:24,976 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:24:24" (1/1) ... [2023-11-17 11:24:25,016 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-11-17 11:24:25,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:25,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:24:25,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:24:25,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:24:25,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:25,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:25,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:25,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:25,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:25,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:25,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:25,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:25,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:24:25,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:24:25,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:24:25,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:24:25,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (1/1) ... [2023-11-17 11:24:25,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:25,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:24:25,108 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:24:25,137 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:24:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:24:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:24:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:24:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:24:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:24:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:24:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:24:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:24:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:24:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:24:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:24:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:24:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:24:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:24:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:24:25,144 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:24:25,300 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:24:25,302 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:24:25,686 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:24:25,883 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:24:25,883 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:24:25,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:25 BoogieIcfgContainer [2023-11-17 11:24:25,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:24:25,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:24:25,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:24:25,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:24:25,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:24:24" (1/3) ... [2023-11-17 11:24:25,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f0e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:25, skipping insertion in model container [2023-11-17 11:24:25,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:24" (2/3) ... [2023-11-17 11:24:25,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f0e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:25, skipping insertion in model container [2023-11-17 11:24:25,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:25" (3/3) ... [2023-11-17 11:24:25,895 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 11:24:25,912 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:24:25,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:24:25,912 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:24:25,965 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:24:26,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2023-11-17 11:24:26,045 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-17 11:24:26,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-11-17 11:24:26,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2023-11-17 11:24:26,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:26,060 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:24:26,074 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:26,077 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:26,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:26,088 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-17 11:24:26,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:26,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-11-17 11:24:26,091 INFO L119 LiptonReduction]: Number of co-enabled transitions 954 [2023-11-17 11:24:27,027 INFO L134 LiptonReduction]: Checked pairs total: 3174 [2023-11-17 11:24:27,028 INFO L136 LiptonReduction]: Total number of compositions: 23 [2023-11-17 11:24:27,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:24:27,051 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;@64189c51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:24:27,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:24:27,055 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:24:27,056 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-17 11:24:27,056 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:27,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:27,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:24:27,057 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:27,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash 374311, now seen corresponding path program 1 times [2023-11-17 11:24:27,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:27,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809834086] [2023-11-17 11:24:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:27,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:27,492 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:24:27,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:27,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809834086] [2023-11-17 11:24:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809834086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:27,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:27,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:27,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665479007] [2023-11-17 11:24:27,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:27,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:27,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:27,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2023-11-17 11:24:27,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:24:27,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:27,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2023-11-17 11:24:27,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:27,957 INFO L124 PetriNetUnfolderBase]: 1144/1841 cut-off events. [2023-11-17 11:24:27,957 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-17 11:24:27,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1841 events. 1144/1841 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9917 event pairs, 184 based on Foata normal form. 0/1735 useless extension candidates. Maximal degree in co-relation 3578. Up to 1372 conditions per place. [2023-11-17 11:24:27,973 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 33 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-17 11:24:27,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 169 flow [2023-11-17 11:24:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2023-11-17 11:24:27,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-11-17 11:24:27,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 102 transitions. [2023-11-17 11:24:27,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 102 transitions. [2023-11-17 11:24:27,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:27,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 102 transitions. [2023-11-17 11:24:27,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:27,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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:24:27,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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:24:27,995 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 102 transitions. [2023-11-17 11:24:27,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 169 flow [2023-11-17 11:24:27,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:28,000 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-11-17 11:24:28,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 11:24:28,004 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-11-17 11:24:28,005 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-11-17 11:24:28,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:24:28,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:28,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:28,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:24:28,006 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:28,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash 62997987, now seen corresponding path program 1 times [2023-11-17 11:24:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146488639] [2023-11-17 11:24:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:28,276 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:24:28,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:28,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146488639] [2023-11-17 11:24:28,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146488639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:28,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:28,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:28,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114895751] [2023-11-17 11:24:28,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:28,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:28,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:28,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:28,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2023-11-17 11:24:28,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:24:28,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:28,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2023-11-17 11:24:28,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:28,535 INFO L124 PetriNetUnfolderBase]: 991/1491 cut-off events. [2023-11-17 11:24:28,535 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-11-17 11:24:28,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 1491 events. 991/1491 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6497 event pairs, 335 based on Foata normal form. 40/1521 useless extension candidates. Maximal degree in co-relation 3137. Up to 1037 conditions per place. [2023-11-17 11:24:28,547 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-11-17 11:24:28,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 136 flow [2023-11-17 11:24:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-17 11:24:28,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-11-17 11:24:28,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-17 11:24:28,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-17 11:24:28,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:28,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-17 11:24:28,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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:24:28,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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:24:28,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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:24:28,556 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 88 transitions. [2023-11-17 11:24:28,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 136 flow [2023-11-17 11:24:28,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:28,559 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 60 flow [2023-11-17 11:24:28,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 11:24:28,560 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-11-17 11:24:28,561 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 60 flow [2023-11-17 11:24:28,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:24:28,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:28,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:28,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:24:28,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:28,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash 413159228, now seen corresponding path program 1 times [2023-11-17 11:24:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:28,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315450019] [2023-11-17 11:24:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:28,786 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:24:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315450019] [2023-11-17 11:24:28,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315450019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:28,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:28,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:28,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387771003] [2023-11-17 11:24:28,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:28,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:28,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:28,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:28,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:28,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 66 [2023-11-17 11:24:28,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:28,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:28,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 66 [2023-11-17 11:24:28,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:29,258 INFO L124 PetriNetUnfolderBase]: 2246/3365 cut-off events. [2023-11-17 11:24:29,258 INFO L125 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2023-11-17 11:24:29,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7219 conditions, 3365 events. 2246/3365 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 16771 event pairs, 127 based on Foata normal form. 80/3445 useless extension candidates. Maximal degree in co-relation 7208. Up to 2260 conditions per place. [2023-11-17 11:24:29,279 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2023-11-17 11:24:29,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 238 flow [2023-11-17 11:24:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2023-11-17 11:24:29,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2023-11-17 11:24:29,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 115 transitions. [2023-11-17 11:24:29,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 115 transitions. [2023-11-17 11:24:29,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:29,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 115 transitions. [2023-11-17 11:24:29,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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:24:29,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 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:24:29,286 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 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:24:29,286 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 60 flow. Second operand 4 states and 115 transitions. [2023-11-17 11:24:29,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 238 flow [2023-11-17 11:24:29,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:29,289 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 113 flow [2023-11-17 11:24:29,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-11-17 11:24:29,290 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-11-17 11:24:29,290 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 113 flow [2023-11-17 11:24:29,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:29,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:29,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:29,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:24:29,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:29,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash -76965794, now seen corresponding path program 1 times [2023-11-17 11:24:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382180089] [2023-11-17 11:24:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:29,422 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:24:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:29,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382180089] [2023-11-17 11:24:29,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382180089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:29,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:29,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:29,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501774735] [2023-11-17 11:24:29,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:29,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:29,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:29,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:29,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2023-11-17 11:24:29,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 113 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:24:29,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:29,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2023-11-17 11:24:29,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:29,818 INFO L124 PetriNetUnfolderBase]: 1611/2594 cut-off events. [2023-11-17 11:24:29,819 INFO L125 PetriNetUnfolderBase]: For 1002/1032 co-relation queries the response was YES. [2023-11-17 11:24:29,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 2594 events. 1611/2594 cut-off events. For 1002/1032 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13828 event pairs, 541 based on Foata normal form. 38/2602 useless extension candidates. Maximal degree in co-relation 6295. Up to 1677 conditions per place. [2023-11-17 11:24:29,839 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-11-17 11:24:29,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 216 flow [2023-11-17 11:24:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-17 11:24:29,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2023-11-17 11:24:29,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-17 11:24:29,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-17 11:24:29,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:29,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-17 11:24:29,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:24:29,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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:24:29,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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:24:29,845 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 113 flow. Second operand 3 states and 89 transitions. [2023-11-17 11:24:29,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 216 flow [2023-11-17 11:24:29,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:24:29,848 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 124 flow [2023-11-17 11:24:29,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-11-17 11:24:29,849 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-11-17 11:24:29,849 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 124 flow [2023-11-17 11:24:29,850 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:24:29,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:29,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:29,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:24:29,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:29,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2142348799, now seen corresponding path program 1 times [2023-11-17 11:24:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:29,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243767829] [2023-11-17 11:24:29,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:29,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:29,958 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:24:29,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243767829] [2023-11-17 11:24:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243767829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:29,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:29,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336120703] [2023-11-17 11:24:29,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:29,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:29,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2023-11-17 11:24:29,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:24:29,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:29,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2023-11-17 11:24:29,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:30,197 INFO L124 PetriNetUnfolderBase]: 878/1526 cut-off events. [2023-11-17 11:24:30,197 INFO L125 PetriNetUnfolderBase]: For 749/751 co-relation queries the response was YES. [2023-11-17 11:24:30,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 1526 events. 878/1526 cut-off events. For 749/751 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7817 event pairs, 242 based on Foata normal form. 103/1618 useless extension candidates. Maximal degree in co-relation 3957. Up to 1121 conditions per place. [2023-11-17 11:24:30,207 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-11-17 11:24:30,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 276 flow [2023-11-17 11:24:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-17 11:24:30,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2023-11-17 11:24:30,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-17 11:24:30,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-17 11:24:30,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:30,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-17 11:24:30,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:24:30,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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:24:30,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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:24:30,210 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 124 flow. Second operand 3 states and 87 transitions. [2023-11-17 11:24:30,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 276 flow [2023-11-17 11:24:30,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 260 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:30,214 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 139 flow [2023-11-17 11:24:30,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-11-17 11:24:30,215 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-11-17 11:24:30,215 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 139 flow [2023-11-17 11:24:30,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:24:30,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:30,215 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:24:30,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:24:30,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:30,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1180518989, now seen corresponding path program 1 times [2023-11-17 11:24:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62710689] [2023-11-17 11:24:30,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:30,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:30,347 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:24:30,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:30,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62710689] [2023-11-17 11:24:30,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62710689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:30,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:30,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:30,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62709450] [2023-11-17 11:24:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:30,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:30,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:30,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:30,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 66 [2023-11-17 11:24:30,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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:24:30,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:30,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 66 [2023-11-17 11:24:30,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:30,685 INFO L124 PetriNetUnfolderBase]: 1376/2281 cut-off events. [2023-11-17 11:24:30,685 INFO L125 PetriNetUnfolderBase]: For 1142/1142 co-relation queries the response was YES. [2023-11-17 11:24:30,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6673 conditions, 2281 events. 1376/2281 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11751 event pairs, 110 based on Foata normal form. 36/2317 useless extension candidates. Maximal degree in co-relation 6657. Up to 985 conditions per place. [2023-11-17 11:24:30,697 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 61 selfloop transitions, 18 changer transitions 0/79 dead transitions. [2023-11-17 11:24:30,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 79 transitions, 468 flow [2023-11-17 11:24:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:24:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:24:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2023-11-17 11:24:30,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2023-11-17 11:24:30,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 133 transitions. [2023-11-17 11:24:30,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 133 transitions. [2023-11-17 11:24:30,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:30,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 133 transitions. [2023-11-17 11:24:30,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.6) internal successors, (133), 5 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:24:30,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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:24:30,701 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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:24:30,701 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 139 flow. Second operand 5 states and 133 transitions. [2023-11-17 11:24:30,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 79 transitions, 468 flow [2023-11-17 11:24:30,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 79 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:24:30,703 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 270 flow [2023-11-17 11:24:30,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-11-17 11:24:30,704 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2023-11-17 11:24:30,704 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 270 flow [2023-11-17 11:24:30,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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:24:30,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:30,705 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:24:30,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:24:30,705 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:30,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash -783288657, now seen corresponding path program 2 times [2023-11-17 11:24:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:30,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140947042] [2023-11-17 11:24:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:30,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:30,849 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:24:30,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:30,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140947042] [2023-11-17 11:24:30,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140947042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:30,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796139643] [2023-11-17 11:24:30,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:30,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:30,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:30,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:30,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2023-11-17 11:24:30,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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:24:30,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:30,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2023-11-17 11:24:30,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:31,022 INFO L124 PetriNetUnfolderBase]: 549/1041 cut-off events. [2023-11-17 11:24:31,023 INFO L125 PetriNetUnfolderBase]: For 921/955 co-relation queries the response was YES. [2023-11-17 11:24:31,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 1041 events. 549/1041 cut-off events. For 921/955 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5369 event pairs, 152 based on Foata normal form. 117/1148 useless extension candidates. Maximal degree in co-relation 3295. Up to 361 conditions per place. [2023-11-17 11:24:31,029 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 64 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-11-17 11:24:31,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 605 flow [2023-11-17 11:24:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2023-11-17 11:24:31,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2023-11-17 11:24:31,031 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 117 transitions. [2023-11-17 11:24:31,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 117 transitions. [2023-11-17 11:24:31,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:31,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 117 transitions. [2023-11-17 11:24:31,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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:24:31,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 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:24:31,033 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 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:24:31,033 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 270 flow. Second operand 4 states and 117 transitions. [2023-11-17 11:24:31,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 605 flow [2023-11-17 11:24:31,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 605 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:24:31,039 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 310 flow [2023-11-17 11:24:31,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2023-11-17 11:24:31,039 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-11-17 11:24:31,040 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 310 flow [2023-11-17 11:24:31,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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:24:31,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:31,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:31,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:24:31,042 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:31,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:31,042 INFO L85 PathProgramCache]: Analyzing trace with hash -787745254, now seen corresponding path program 1 times [2023-11-17 11:24:31,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:31,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695421861] [2023-11-17 11:24:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:31,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:31,235 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:24:31,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695421861] [2023-11-17 11:24:31,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695421861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:31,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:24:31,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138895815] [2023-11-17 11:24:31,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:31,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:24:31,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:31,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:24:31,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:24:31,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2023-11-17 11:24:31,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:31,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:31,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2023-11-17 11:24:31,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:31,431 INFO L124 PetriNetUnfolderBase]: 483/893 cut-off events. [2023-11-17 11:24:31,431 INFO L125 PetriNetUnfolderBase]: For 1300/1325 co-relation queries the response was YES. [2023-11-17 11:24:31,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 893 events. 483/893 cut-off events. For 1300/1325 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4497 event pairs, 145 based on Foata normal form. 35/918 useless extension candidates. Maximal degree in co-relation 3150. Up to 361 conditions per place. [2023-11-17 11:24:31,437 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 55 selfloop transitions, 10 changer transitions 6/83 dead transitions. [2023-11-17 11:24:31,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 633 flow [2023-11-17 11:24:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:24:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:24:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2023-11-17 11:24:31,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2023-11-17 11:24:31,439 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 134 transitions. [2023-11-17 11:24:31,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 134 transitions. [2023-11-17 11:24:31,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:31,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 134 transitions. [2023-11-17 11:24:31,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.8) internal successors, (134), 5 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:24:31,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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:24:31,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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:24:31,440 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 310 flow. Second operand 5 states and 134 transitions. [2023-11-17 11:24:31,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 633 flow [2023-11-17 11:24:31,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 602 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-17 11:24:31,446 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 312 flow [2023-11-17 11:24:31,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-11-17 11:24:31,448 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2023-11-17 11:24:31,448 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 312 flow [2023-11-17 11:24:31,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:31,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:31,449 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:24:31,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:24:31,449 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:31,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:31,453 INFO L85 PathProgramCache]: Analyzing trace with hash 678456257, now seen corresponding path program 1 times [2023-11-17 11:24:31,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:31,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41297428] [2023-11-17 11:24:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:31,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:32,304 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:24:32,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:32,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41297428] [2023-11-17 11:24:32,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41297428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:32,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:32,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:24:32,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646484529] [2023-11-17 11:24:32,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:32,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:24:32,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:32,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:24:32,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:24:32,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2023-11-17 11:24:32,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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:24:32,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:32,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2023-11-17 11:24:32,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:32,645 INFO L124 PetriNetUnfolderBase]: 532/991 cut-off events. [2023-11-17 11:24:32,645 INFO L125 PetriNetUnfolderBase]: For 1717/1756 co-relation queries the response was YES. [2023-11-17 11:24:32,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 991 events. 532/991 cut-off events. For 1717/1756 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5185 event pairs, 56 based on Foata normal form. 6/988 useless extension candidates. Maximal degree in co-relation 3499. Up to 457 conditions per place. [2023-11-17 11:24:32,652 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 61 selfloop transitions, 4 changer transitions 25/102 dead transitions. [2023-11-17 11:24:32,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 102 transitions, 804 flow [2023-11-17 11:24:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:24:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:24:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2023-11-17 11:24:32,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199134199134199 [2023-11-17 11:24:32,654 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 194 transitions. [2023-11-17 11:24:32,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 194 transitions. [2023-11-17 11:24:32,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:32,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 194 transitions. [2023-11-17 11:24:32,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 27.714285714285715) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 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:24:32,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 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:24:32,656 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 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:24:32,656 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 312 flow. Second operand 7 states and 194 transitions. [2023-11-17 11:24:32,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 102 transitions, 804 flow [2023-11-17 11:24:32,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 102 transitions, 742 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:32,666 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 304 flow [2023-11-17 11:24:32,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-11-17 11:24:32,667 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2023-11-17 11:24:32,668 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 304 flow [2023-11-17 11:24:32,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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:24:32,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:32,669 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:24:32,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:24:32,671 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:32,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash -385627659, now seen corresponding path program 2 times [2023-11-17 11:24:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:32,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418700427] [2023-11-17 11:24:32,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:32,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:32,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:24:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:32,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:24:32,825 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:24:32,826 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:24:32,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:24:32,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:24:32,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:24:32,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:24:32,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:24:32,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:24:32,829 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:32,834 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:24:32,834 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:24:32,868 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:24:32,873 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:24:32,874 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:24:32,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:24:32 BasicIcfg [2023-11-17 11:24:32,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:24:32,900 INFO L158 Benchmark]: Toolchain (without parser) took 8512.26ms. Allocated memory was 184.5MB in the beginning and 408.9MB in the end (delta: 224.4MB). Free memory was 132.7MB in the beginning and 201.9MB in the end (delta: -69.2MB). Peak memory consumption was 156.0MB. Max. memory is 8.0GB. [2023-11-17 11:24:32,900 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:24:32,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.17ms. Allocated memory is still 184.5MB. Free memory was 132.7MB in the beginning and 108.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:32,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.22ms. Allocated memory is still 184.5MB. Free memory was 108.9MB in the beginning and 106.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:32,901 INFO L158 Benchmark]: Boogie Preprocessor took 57.59ms. Allocated memory is still 184.5MB. Free memory was 106.5MB in the beginning and 104.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 11:24:32,901 INFO L158 Benchmark]: RCFGBuilder took 809.41ms. Allocated memory was 184.5MB in the beginning and 340.8MB in the end (delta: 156.2MB). Free memory was 104.4MB in the beginning and 268.9MB in the end (delta: -164.5MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2023-11-17 11:24:32,901 INFO L158 Benchmark]: TraceAbstraction took 7011.41ms. Allocated memory was 340.8MB in the beginning and 408.9MB in the end (delta: 68.2MB). Free memory was 268.3MB in the beginning and 201.9MB in the end (delta: 66.5MB). Peak memory consumption was 134.6MB. Max. memory is 8.0GB. [2023-11-17 11:24:32,903 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 184.5MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.17ms. Allocated memory is still 184.5MB. Free memory was 132.7MB in the beginning and 108.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.22ms. Allocated memory is still 184.5MB. Free memory was 108.9MB in the beginning and 106.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.59ms. Allocated memory is still 184.5MB. Free memory was 106.5MB in the beginning and 104.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 809.41ms. Allocated memory was 184.5MB in the beginning and 340.8MB in the end (delta: 156.2MB). Free memory was 104.4MB in the beginning and 268.9MB in the end (delta: -164.5MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7011.41ms. Allocated memory was 340.8MB in the beginning and 408.9MB in the end (delta: 68.2MB). Free memory was 268.3MB in the beginning and 201.9MB in the end (delta: 66.5MB). Peak memory consumption was 134.6MB. 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 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, 48 PlacesBefore, 35 PlacesAfterwards, 40 TransitionsBefore, 26 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 23 TotalNumberOfCompositions, 3174 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1151, independent: 1021, independent conditional: 0, independent unconditional: 1021, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 623, independent: 578, independent conditional: 0, independent unconditional: 578, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 623, independent: 548, independent conditional: 0, independent unconditional: 548, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 279, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1151, independent: 443, independent conditional: 0, independent unconditional: 443, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 623, unknown conditional: 0, unknown unconditional: 623] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L790] 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) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 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 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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$$choice2=0, x=2, y=1, z=1] [L826] 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) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 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 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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$$choice2=0, x=2, y=1, z=1] [L764] 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) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 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 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 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 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - 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: 849]: 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: 853]: 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: 851]: 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 7 procedures, 70 locations, 6 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: 6.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 671 IncrementalHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 9 mSDtfsCounter, 671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=8, InterpolantAutomatonStates: 37, 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.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 693 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:24:32,923 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...