/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/ldv-races/race-2_4-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:30:25,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:30:25,909 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:30:25,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:30:25,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:30:25,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:30:25,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:30:25,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:30:25,936 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:30:25,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:30:25,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:30:25,942 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:30:25,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:30:25,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:30:25,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:30:25,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:30:25,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:30:25,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:30:25,946 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:30:25,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:30:25,947 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:30:25,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:30:25,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:30:25,948 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:30:25,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:30:25,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:30:25,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:30:25,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:30:25,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:30:25,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:30:25,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:30:25,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:30:25,950 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:30:26,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:30:26,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:30:26,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:30:26,180 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:30:26,180 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:30:26,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2023-11-17 11:30:27,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:30:27,372 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:30:27,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2023-11-17 11:30:27,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7778cbdd8/67b6abee2ef7436ba7ddad3822cf9bea/FLAG4fbbd7151 [2023-11-17 11:30:27,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7778cbdd8/67b6abee2ef7436ba7ddad3822cf9bea [2023-11-17 11:30:27,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:30:27,414 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:30:27,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:30:27,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:30:27,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:30:27,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658361ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27, skipping insertion in model container [2023-11-17 11:30:27,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,481 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:30:27,602 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 11:30:27,877 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[75002,75015] [2023-11-17 11:30:27,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:30:27,909 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:30:27,916 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 11:30:27,959 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[75002,75015] [2023-11-17 11:30:27,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:30:28,040 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:28,040 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:28,041 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:28,045 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:30:28,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28 WrapperNode [2023-11-17 11:30:28,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:30:28,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:30:28,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:30:28,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:30:28,051 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:30:28" (1/1) ... [2023-11-17 11:30:28,071 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:30:28" (1/1) ... [2023-11-17 11:30:28,094 INFO L138 Inliner]: procedures = 470, calls = 64, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2023-11-17 11:30:28,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:30:28,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:30:28,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:30:28,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:30:28,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (1/1) ... [2023-11-17 11:30:28,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (1/1) ... [2023-11-17 11:30:28,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (1/1) ... [2023-11-17 11:30:28,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (1/1) ... [2023-11-17 11:30:28,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (1/1) ... [2023-11-17 11:30:28,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (1/1) ... [2023-11-17 11:30:28,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (1/1) ... [2023-11-17 11:30:28,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (1/1) ... [2023-11-17 11:30:28,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:30:28,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:30:28,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:30:28,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:30:28,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (1/1) ... [2023-11-17 11:30:28,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:30:28,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:30:28,269 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:30:28,270 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:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 11:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-17 11:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:30:28,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:30:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-11-17 11:30:28,289 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-11-17 11:30:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:30:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 11:30:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:30:28,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:30:28,291 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:30:28,482 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:30:28,483 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:30:28,681 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:30:28,820 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:30:28,820 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:30:28,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:30:28 BoogieIcfgContainer [2023-11-17 11:30:28,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:30:28,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:30:28,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:30:28,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:30:28,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:30:27" (1/3) ... [2023-11-17 11:30:28,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235145cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:30:28, skipping insertion in model container [2023-11-17 11:30:28,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:28" (2/3) ... [2023-11-17 11:30:28,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235145cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:30:28, skipping insertion in model container [2023-11-17 11:30:28,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:30:28" (3/3) ... [2023-11-17 11:30:28,827 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2023-11-17 11:30:28,839 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:30:28,839 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-17 11:30:28,839 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:30:28,868 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 11:30:28,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 65 transitions, 144 flow [2023-11-17 11:30:28,920 INFO L124 PetriNetUnfolderBase]: 12/87 cut-off events. [2023-11-17 11:30:28,921 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:30:28,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 87 events. 12/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 255 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-17 11:30:28,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 65 transitions, 144 flow [2023-11-17 11:30:28,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 58 transitions, 128 flow [2023-11-17 11:30:28,929 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:30:28,937 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 58 transitions, 128 flow [2023-11-17 11:30:28,940 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 58 transitions, 128 flow [2023-11-17 11:30:28,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 58 transitions, 128 flow [2023-11-17 11:30:28,964 INFO L124 PetriNetUnfolderBase]: 9/78 cut-off events. [2023-11-17 11:30:28,964 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:30:28,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 9/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 227 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2023-11-17 11:30:28,966 INFO L119 LiptonReduction]: Number of co-enabled transitions 864 [2023-11-17 11:31:05,249 INFO L134 LiptonReduction]: Checked pairs total: 2826 [2023-11-17 11:31:05,249 INFO L136 LiptonReduction]: Total number of compositions: 41 [2023-11-17 11:31:05,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:31:05,263 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;@60446af8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:31:05,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-17 11:31:05,267 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:31:05,267 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2023-11-17 11:31:05,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:31:05,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:05,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:31:05,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:05,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:05,272 INFO L85 PathProgramCache]: Analyzing trace with hash 535042, now seen corresponding path program 1 times [2023-11-17 11:31:05,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:05,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090358879] [2023-11-17 11:31:05,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:05,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:05,468 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:31:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:05,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090358879] [2023-11-17 11:31:05,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090358879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:05,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:05,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595431898] [2023-11-17 11:31:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:05,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:31:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:05,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:31:05,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:31:05,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 106 [2023-11-17 11:31:05,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 80 flow. Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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:31:05,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:05,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 106 [2023-11-17 11:31:05,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:05,703 INFO L124 PetriNetUnfolderBase]: 646/1089 cut-off events. [2023-11-17 11:31:05,704 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:31:05,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 1089 events. 646/1089 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4707 event pairs, 645 based on Foata normal form. 0/938 useless extension candidates. Maximal degree in co-relation 2104. Up to 1081 conditions per place. [2023-11-17 11:31:05,714 INFO L140 encePairwiseOnDemand]: 104/106 looper letters, 31 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-11-17 11:31:05,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 138 flow [2023-11-17 11:31:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:31:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:31:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2023-11-17 11:31:05,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33490566037735847 [2023-11-17 11:31:05,723 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 71 transitions. [2023-11-17 11:31:05,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 71 transitions. [2023-11-17 11:31:05,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:05,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 71 transitions. [2023-11-17 11:31:05,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 35.5) internal successors, (71), 2 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:31:05,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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:31:05,731 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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:31:05,732 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 80 flow. Second operand 2 states and 71 transitions. [2023-11-17 11:31:05,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 138 flow [2023-11-17 11:31:05,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:31:05,739 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 68 flow [2023-11-17 11:31:05,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-11-17 11:31:05,743 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2023-11-17 11:31:05,743 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 68 flow [2023-11-17 11:31:05,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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:31:05,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:05,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:31:05,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:31:05,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:05,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:05,745 INFO L85 PathProgramCache]: Analyzing trace with hash 534583, now seen corresponding path program 1 times [2023-11-17 11:31:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:05,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122436473] [2023-11-17 11:31:05,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:05,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:05,930 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:31:05,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:05,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122436473] [2023-11-17 11:31:05,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122436473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:05,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:05,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:05,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091932055] [2023-11-17 11:31:05,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:05,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:05,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:05,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:05,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 106 [2023-11-17 11:31:05,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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:31:05,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:05,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 106 [2023-11-17 11:31:05,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:06,100 INFO L124 PetriNetUnfolderBase]: 770/1300 cut-off events. [2023-11-17 11:31:06,101 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:31:06,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2610 conditions, 1300 events. 770/1300 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6066 event pairs, 613 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 2607. Up to 1154 conditions per place. [2023-11-17 11:31:06,106 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 37 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2023-11-17 11:31:06,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 176 flow [2023-11-17 11:31:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-17 11:31:06,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3081761006289308 [2023-11-17 11:31:06,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-17 11:31:06,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-17 11:31:06,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:06,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-17 11:31:06,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:06,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:06,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:06,109 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 68 flow. Second operand 3 states and 98 transitions. [2023-11-17 11:31:06,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 176 flow [2023-11-17 11:31:06,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:31:06,111 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 104 flow [2023-11-17 11:31:06,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2023-11-17 11:31:06,112 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-11-17 11:31:06,112 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 104 flow [2023-11-17 11:31:06,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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:31:06,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:06,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:31:06,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:31:06,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:06,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:06,122 INFO L85 PathProgramCache]: Analyzing trace with hash 534558, now seen corresponding path program 1 times [2023-11-17 11:31:06,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:06,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388033748] [2023-11-17 11:31:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:06,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:06,294 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:31:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:06,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388033748] [2023-11-17 11:31:06,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388033748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:06,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:06,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:06,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733367582] [2023-11-17 11:31:06,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:06,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:06,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:06,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 106 [2023-11-17 11:31:06,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:31:06,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:06,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 106 [2023-11-17 11:31:06,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:06,433 INFO L124 PetriNetUnfolderBase]: 598/1031 cut-off events. [2023-11-17 11:31:06,434 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2023-11-17 11:31:06,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 1031 events. 598/1031 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4723 event pairs, 489 based on Foata normal form. 69/1024 useless extension candidates. Maximal degree in co-relation 2418. Up to 873 conditions per place. [2023-11-17 11:31:06,438 INFO L140 encePairwiseOnDemand]: 102/106 looper letters, 41 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2023-11-17 11:31:06,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 218 flow [2023-11-17 11:31:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2023-11-17 11:31:06,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23270440251572327 [2023-11-17 11:31:06,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 74 transitions. [2023-11-17 11:31:06,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 74 transitions. [2023-11-17 11:31:06,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:06,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 74 transitions. [2023-11-17 11:31:06,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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:31:06,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:06,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:06,442 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 104 flow. Second operand 3 states and 74 transitions. [2023-11-17 11:31:06,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 218 flow [2023-11-17 11:31:06,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:31:06,445 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 96 flow [2023-11-17 11:31:06,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2023-11-17 11:31:06,445 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-11-17 11:31:06,445 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 96 flow [2023-11-17 11:31:06,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:31:06,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:06,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:31:06,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:31:06,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:06,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash 16577439, now seen corresponding path program 1 times [2023-11-17 11:31:06,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:06,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597080661] [2023-11-17 11:31:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:06,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:06,493 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:31:06,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:06,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597080661] [2023-11-17 11:31:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597080661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:06,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:06,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667458495] [2023-11-17 11:31:06,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:06,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:06,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:06,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 106 [2023-11-17 11:31:06,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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:31:06,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:06,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 106 [2023-11-17 11:31:06,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:06,617 INFO L124 PetriNetUnfolderBase]: 597/1045 cut-off events. [2023-11-17 11:31:06,617 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2023-11-17 11:31:06,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 1045 events. 597/1045 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4791 event pairs, 481 based on Foata normal form. 1/971 useless extension candidates. Maximal degree in co-relation 2469. Up to 782 conditions per place. [2023-11-17 11:31:06,622 INFO L140 encePairwiseOnDemand]: 103/106 looper letters, 41 selfloop transitions, 1 changer transitions 2/45 dead transitions. [2023-11-17 11:31:06,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 218 flow [2023-11-17 11:31:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-11-17 11:31:06,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29874213836477986 [2023-11-17 11:31:06,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 95 transitions. [2023-11-17 11:31:06,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 95 transitions. [2023-11-17 11:31:06,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:06,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 95 transitions. [2023-11-17 11:31:06,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:06,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:06,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:06,625 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 96 flow. Second operand 3 states and 95 transitions. [2023-11-17 11:31:06,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 218 flow [2023-11-17 11:31:06,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:31:06,626 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 95 flow [2023-11-17 11:31:06,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-17 11:31:06,627 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-11-17 11:31:06,627 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 95 flow [2023-11-17 11:31:06,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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:31:06,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:06,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:31:06,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:31:06,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:06,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1519146955, now seen corresponding path program 1 times [2023-11-17 11:31:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:06,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531273836] [2023-11-17 11:31:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:06,757 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:31:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531273836] [2023-11-17 11:31:06,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531273836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:06,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:06,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:06,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143357166] [2023-11-17 11:31:06,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:06,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:06,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:06,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:06,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:06,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 106 [2023-11-17 11:31:06,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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:31:06,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:06,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 106 [2023-11-17 11:31:06,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:06,923 INFO L124 PetriNetUnfolderBase]: 940/1586 cut-off events. [2023-11-17 11:31:06,923 INFO L125 PetriNetUnfolderBase]: For 465/465 co-relation queries the response was YES. [2023-11-17 11:31:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 1586 events. 940/1586 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7997 event pairs, 387 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 3725. Up to 1114 conditions per place. [2023-11-17 11:31:06,931 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 43 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2023-11-17 11:31:06,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 238 flow [2023-11-17 11:31:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2023-11-17 11:31:06,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31761006289308175 [2023-11-17 11:31:06,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 101 transitions. [2023-11-17 11:31:06,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 101 transitions. [2023-11-17 11:31:06,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:06,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 101 transitions. [2023-11-17 11:31:06,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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:31:06,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:06,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:06,934 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 95 flow. Second operand 3 states and 101 transitions. [2023-11-17 11:31:06,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 238 flow [2023-11-17 11:31:06,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 234 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:31:06,935 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 153 flow [2023-11-17 11:31:06,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2023-11-17 11:31:06,936 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2023-11-17 11:31:06,936 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 153 flow [2023-11-17 11:31:06,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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:31:06,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:06,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:31:06,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:31:06,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:06,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash 990536863, now seen corresponding path program 1 times [2023-11-17 11:31:06,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:06,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940322639] [2023-11-17 11:31:06,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:06,983 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:31:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940322639] [2023-11-17 11:31:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940322639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:06,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:06,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:31:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336569389] [2023-11-17 11:31:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:06,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:06,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:06,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:06,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 106 [2023-11-17 11:31:06,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 153 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:31:06,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:06,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 106 [2023-11-17 11:31:06,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:07,140 INFO L124 PetriNetUnfolderBase]: 696/1222 cut-off events. [2023-11-17 11:31:07,140 INFO L125 PetriNetUnfolderBase]: For 977/977 co-relation queries the response was YES. [2023-11-17 11:31:07,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 1222 events. 696/1222 cut-off events. For 977/977 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6067 event pairs, 149 based on Foata normal form. 36/1188 useless extension candidates. Maximal degree in co-relation 3343. Up to 1090 conditions per place. [2023-11-17 11:31:07,146 INFO L140 encePairwiseOnDemand]: 104/106 looper letters, 41 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-11-17 11:31:07,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 248 flow [2023-11-17 11:31:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2023-11-17 11:31:07,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2861635220125786 [2023-11-17 11:31:07,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 91 transitions. [2023-11-17 11:31:07,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 91 transitions. [2023-11-17 11:31:07,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:07,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 91 transitions. [2023-11-17 11:31:07,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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:31:07,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:07,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:07,148 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 153 flow. Second operand 3 states and 91 transitions. [2023-11-17 11:31:07,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 248 flow [2023-11-17 11:31:07,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 210 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-17 11:31:07,151 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 100 flow [2023-11-17 11:31:07,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-11-17 11:31:07,152 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-11-17 11:31:07,152 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 100 flow [2023-11-17 11:31:07,152 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:31:07,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:07,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:31:07,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:31:07,152 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:07,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash 151085067, now seen corresponding path program 1 times [2023-11-17 11:31:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:07,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777366440] [2023-11-17 11:31:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:07,281 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:31:07,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:07,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777366440] [2023-11-17 11:31:07,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777366440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:07,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:07,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349408162] [2023-11-17 11:31:07,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:07,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:07,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:07,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:07,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 106 [2023-11-17 11:31:07,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 100 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:31:07,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:07,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 106 [2023-11-17 11:31:07,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:07,447 INFO L124 PetriNetUnfolderBase]: 1039/1747 cut-off events. [2023-11-17 11:31:07,448 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2023-11-17 11:31:07,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4200 conditions, 1747 events. 1039/1747 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8885 event pairs, 403 based on Foata normal form. 0/1618 useless extension candidates. Maximal degree in co-relation 4195. Up to 1122 conditions per place. [2023-11-17 11:31:07,456 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 41 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2023-11-17 11:31:07,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 269 flow [2023-11-17 11:31:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-17 11:31:07,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3081761006289308 [2023-11-17 11:31:07,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-17 11:31:07,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-17 11:31:07,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:07,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-17 11:31:07,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:07,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:07,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:31:07,459 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 100 flow. Second operand 3 states and 98 transitions. [2023-11-17 11:31:07,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 269 flow [2023-11-17 11:31:07,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:31:07,460 INFO L231 Difference]: Finished difference. Result has 38 places, 43 transitions, 207 flow [2023-11-17 11:31:07,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=38, PETRI_TRANSITIONS=43} [2023-11-17 11:31:07,461 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-11-17 11:31:07,461 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 43 transitions, 207 flow [2023-11-17 11:31:07,461 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:31:07,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:07,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:31:07,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:31:07,465 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:07,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash 642107687, now seen corresponding path program 1 times [2023-11-17 11:31:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:07,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138899168] [2023-11-17 11:31:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:31:07,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:31:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:31:07,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:31:07,535 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:31:07,535 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-11-17 11:31:07,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-11-17 11:31:07,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-11-17 11:31:07,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-11-17 11:31:07,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-11-17 11:31:07,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-11-17 11:31:07,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-11-17 11:31:07,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-11-17 11:31:07,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:31:07,537 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:31:07,540 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:31:07,540 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:31:07,554 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-17 11:31:07,555 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-17 11:31:07,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:31:07 BasicIcfg [2023-11-17 11:31:07,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:31:07,566 INFO L158 Benchmark]: Toolchain (without parser) took 40152.18ms. Allocated memory is still 393.2MB. Free memory was 342.0MB in the beginning and 146.9MB in the end (delta: 195.1MB). Peak memory consumption was 196.0MB. Max. memory is 8.0GB. [2023-11-17 11:31:07,566 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 206.6MB. Free memory was 159.9MB in the beginning and 159.7MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:31:07,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.04ms. Allocated memory is still 393.2MB. Free memory was 341.7MB in the beginning and 350.2MB in the end (delta: -8.5MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2023-11-17 11:31:07,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.82ms. Allocated memory is still 393.2MB. Free memory was 350.2MB in the beginning and 346.6MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:31:07,567 INFO L158 Benchmark]: Boogie Preprocessor took 35.35ms. Allocated memory is still 393.2MB. Free memory was 346.6MB in the beginning and 343.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:31:07,567 INFO L158 Benchmark]: RCFGBuilder took 688.84ms. Allocated memory is still 393.2MB. Free memory was 343.9MB in the beginning and 297.8MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2023-11-17 11:31:07,567 INFO L158 Benchmark]: TraceAbstraction took 38742.81ms. Allocated memory is still 393.2MB. Free memory was 296.7MB in the beginning and 146.9MB in the end (delta: 149.9MB). Peak memory consumption was 149.9MB. Max. memory is 8.0GB. [2023-11-17 11:31:07,568 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.10ms. Allocated memory is still 206.6MB. Free memory was 159.9MB in the beginning and 159.7MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 621.04ms. Allocated memory is still 393.2MB. Free memory was 341.7MB in the beginning and 350.2MB in the end (delta: -8.5MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.82ms. Allocated memory is still 393.2MB. Free memory was 350.2MB in the beginning and 346.6MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.35ms. Allocated memory is still 393.2MB. Free memory was 346.6MB in the beginning and 343.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 688.84ms. Allocated memory is still 393.2MB. Free memory was 343.9MB in the beginning and 297.8MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 38742.81ms. Allocated memory is still 393.2MB. Free memory was 296.7MB in the beginning and 146.9MB in the end (delta: 149.9MB). Peak memory consumption was 149.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 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: 36.3s, 58 PlacesBefore, 37 PlacesAfterwards, 58 TransitionsBefore, 34 TransitionsAfterwards, 864 CoEnabledTransitionPairs, 4 FixpointIterations, 13 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 41 TotalNumberOfCompositions, 2826 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 992, independent: 859, independent conditional: 0, independent unconditional: 859, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 536, independent: 482, independent conditional: 0, independent unconditional: 482, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 536, independent: 471, independent conditional: 0, independent unconditional: 471, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30893, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 691, dependent conditional: 0, dependent unconditional: 691, unknown: 30122, unknown conditional: 0, unknown unconditional: 30122] ], Cache Queries: [ total: 992, independent: 377, independent conditional: 0, independent unconditional: 377, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 546, unknown conditional: 0, unknown unconditional: 546] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); [L1746] COND TRUE 0 ret==0 [L1747] 0 int probe_ret; [L1748] 0 struct my_data data; [L1749] CALL, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1723] 0 data->shared.a = 3 VAL [arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, status={6:0}, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1726] 0 data->shared.b = 3 VAL [arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, status={6:0}, t1={3:0}, t2={4:0}] [L1729] EXPR 0 data->shared.a [L1729] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: 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: 1675]: 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: 1675]: 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: 1675]: 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: 1675]: 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: 1713]: 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: 1714]: 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 4 procedures, 68 locations, 8 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: 38.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 36.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 425 IncrementalHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1 mSDtfsCounter, 425 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=7, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:31:07,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...