/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:20:20,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:20:20,292 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 15:20:20,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:20:20,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:20:20,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:20:20,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:20:20,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:20:20,323 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:20:20,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:20:20,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:20:20,323 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:20:20,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:20:20,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:20:20,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:20:20,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:20:20,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:20:20,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:20:20,325 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:20:20,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:20:20,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:20:20,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:20:20,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:20:20,329 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:20:20,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:20:20,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:20:20,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:20:20,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:20:20,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:20:20,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:20:20,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:20:20,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:20:20,330 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 [2023-11-17 15:20:20,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:20:20,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:20:20,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:20:20,502 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:20:20,502 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:20:20,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2023-11-17 15:20:21,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:20:21,747 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:20:21,747 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2023-11-17 15:20:21,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f007d3bc0/c45e0ae21c1d4c22bcbdad09eeec9ed2/FLAGe2d50099b [2023-11-17 15:20:21,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f007d3bc0/c45e0ae21c1d4c22bcbdad09eeec9ed2 [2023-11-17 15:20:21,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:20:21,797 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:20:21,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:20:21,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:20:21,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:20:21,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:20:21" (1/1) ... [2023-11-17 15:20:21,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223230ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:21, skipping insertion in model container [2023-11-17 15:20:21,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:20:21" (1/1) ... [2023-11-17 15:20:21,854 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:20:21,951 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 15:20:22,252 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_5-container_of.i[75002,75015] [2023-11-17 15:20:22,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:20:22,298 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:20:22,309 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 15:20:22,353 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_5-container_of.i[75002,75015] [2023-11-17 15:20:22,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:20:22,478 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:20:22,478 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:20:22,478 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:20:22,483 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:20:22,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22 WrapperNode [2023-11-17 15:20:22,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:20:22,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:20:22,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:20:22,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:20:22,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,549 INFO L138 Inliner]: procedures = 470, calls = 64, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2023-11-17 15:20:22,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:20:22,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:20:22,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:20:22,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:20:22,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:20:22,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:20:22,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:20:22,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:20:22,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (1/1) ... [2023-11-17 15:20:22,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:20:22,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:20:22,616 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 15:20:22,650 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 15:20:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:20:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:20:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:20:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:20:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 15:20:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:20:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-17 15:20:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:20:22,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:20:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-11-17 15:20:22,666 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-11-17 15:20:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:20:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 15:20:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:20:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:20:22,669 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 15:20:22,886 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:20:22,887 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:20:23,130 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:20:23,171 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:20:23,172 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:20:23,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:20:23 BoogieIcfgContainer [2023-11-17 15:20:23,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:20:23,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:20:23,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:20:23,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:20:23,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:20:21" (1/3) ... [2023-11-17 15:20:23,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dda4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:20:23, skipping insertion in model container [2023-11-17 15:20:23,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:22" (2/3) ... [2023-11-17 15:20:23,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dda4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:20:23, skipping insertion in model container [2023-11-17 15:20:23,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:20:23" (3/3) ... [2023-11-17 15:20:23,179 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2023-11-17 15:20:23,191 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:20:23,191 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-17 15:20:23,191 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:20:23,250 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 15:20:23,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 181 transitions, 376 flow [2023-11-17 15:20:23,362 INFO L124 PetriNetUnfolderBase]: 10/227 cut-off events. [2023-11-17 15:20:23,362 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:20:23,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 227 events. 10/227 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 115. Up to 4 conditions per place. [2023-11-17 15:20:23,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 181 transitions, 376 flow [2023-11-17 15:20:23,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 165 transitions, 342 flow [2023-11-17 15:20:23,380 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:20:23,391 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 165 transitions, 342 flow [2023-11-17 15:20:23,393 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 165 transitions, 342 flow [2023-11-17 15:20:23,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 165 transitions, 342 flow [2023-11-17 15:20:23,448 INFO L124 PetriNetUnfolderBase]: 7/200 cut-off events. [2023-11-17 15:20:23,448 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:20:23,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 200 events. 7/200 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 359 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2023-11-17 15:20:23,452 INFO L119 LiptonReduction]: Number of co-enabled transitions 3808 [2023-11-17 15:21:14,314 INFO L134 LiptonReduction]: Checked pairs total: 7546 [2023-11-17 15:21:14,314 INFO L136 LiptonReduction]: Total number of compositions: 167 [2023-11-17 15:21:14,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:21:14,336 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;@fb6e6d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:21:14,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-17 15:21:14,339 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:21:14,339 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-17 15:21:14,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:21:14,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:14,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 15:21:14,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:14,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash 21168651, now seen corresponding path program 1 times [2023-11-17 15:21:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331814958] [2023-11-17 15:21:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:14,987 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 15:21:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331814958] [2023-11-17 15:21:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331814958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:14,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:21:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894283013] [2023-11-17 15:21:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:15,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:21:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:15,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:21:15,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:21:15,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 348 [2023-11-17 15:21:15,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 15:21:15,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:15,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 348 [2023-11-17 15:21:15,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:15,245 INFO L124 PetriNetUnfolderBase]: 669/1157 cut-off events. [2023-11-17 15:21:15,245 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 15:21:15,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 1157 events. 669/1157 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5416 event pairs, 336 based on Foata normal form. 0/1073 useless extension candidates. Maximal degree in co-relation 2104. Up to 833 conditions per place. [2023-11-17 15:21:15,294 INFO L140 encePairwiseOnDemand]: 337/348 looper letters, 41 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2023-11-17 15:21:15,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 204 flow [2023-11-17 15:21:15,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:21:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:21:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-17 15:21:15,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099616858237548 [2023-11-17 15:21:15,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-17 15:21:15,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-17 15:21:15,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:15,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-17 15:21:15,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 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 15:21:15,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:15,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:15,318 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 88 flow. Second operand 3 states and 428 transitions. [2023-11-17 15:21:15,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 204 flow [2023-11-17 15:21:15,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:21:15,322 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 124 flow [2023-11-17 15:21:15,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2023-11-17 15:21:15,326 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-17 15:21:15,326 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 124 flow [2023-11-17 15:21:15,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 15:21:15,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:15,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:21:15,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:21:15,327 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 15:21:15,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash 656229502, now seen corresponding path program 1 times [2023-11-17 15:21:15,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705105487] [2023-11-17 15:21:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:15,431 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 15:21:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705105487] [2023-11-17 15:21:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705105487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:15,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:15,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:21:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325472379] [2023-11-17 15:21:15,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:15,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:21:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:15,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:21:15,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:21:15,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 348 [2023-11-17 15:21:15,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 15:21:15,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:15,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 348 [2023-11-17 15:21:15,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:15,681 INFO L124 PetriNetUnfolderBase]: 785/1364 cut-off events. [2023-11-17 15:21:15,681 INFO L125 PetriNetUnfolderBase]: For 480/480 co-relation queries the response was YES. [2023-11-17 15:21:15,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 1364 events. 785/1364 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6760 event pairs, 452 based on Foata normal form. 37/1387 useless extension candidates. Maximal degree in co-relation 861. Up to 1058 conditions per place. [2023-11-17 15:21:15,687 INFO L140 encePairwiseOnDemand]: 341/348 looper letters, 45 selfloop transitions, 9 changer transitions 2/56 dead transitions. [2023-11-17 15:21:15,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 298 flow [2023-11-17 15:21:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:21:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:21:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-11-17 15:21:15,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4051724137931034 [2023-11-17 15:21:15,689 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-11-17 15:21:15,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-11-17 15:21:15,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:15,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-11-17 15:21:15,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 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 15:21:15,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:15,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:15,705 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 124 flow. Second operand 3 states and 423 transitions. [2023-11-17 15:21:15,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 298 flow [2023-11-17 15:21:15,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:21:15,708 INFO L231 Difference]: Finished difference. Result has 41 places, 46 transitions, 181 flow [2023-11-17 15:21:15,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=41, PETRI_TRANSITIONS=46} [2023-11-17 15:21:15,709 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-17 15:21:15,709 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 46 transitions, 181 flow [2023-11-17 15:21:15,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 15:21:15,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:15,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:15,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:21:15,710 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 15:21:15,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1237066775, now seen corresponding path program 1 times [2023-11-17 15:21:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:15,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442092998] [2023-11-17 15:21:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:15,797 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 15:21:15,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442092998] [2023-11-17 15:21:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442092998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:21:15,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481597342] [2023-11-17 15:21:15,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:15,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:21:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:15,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:21:15,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:21:15,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 348 [2023-11-17 15:21:15,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 46 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:21:15,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:15,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 348 [2023-11-17 15:21:15,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:15,950 INFO L124 PetriNetUnfolderBase]: 195/373 cut-off events. [2023-11-17 15:21:15,950 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2023-11-17 15:21:15,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 373 events. 195/373 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1278 event pairs, 135 based on Foata normal form. 36/396 useless extension candidates. Maximal degree in co-relation 931. Up to 272 conditions per place. [2023-11-17 15:21:15,952 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 35 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-11-17 15:21:15,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 186 flow [2023-11-17 15:21:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:21:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:21:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-11-17 15:21:15,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45306513409961685 [2023-11-17 15:21:15,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-11-17 15:21:15,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-11-17 15:21:15,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:15,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-11-17 15:21:15,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 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 15:21:15,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:15,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:15,957 INFO L175 Difference]: Start difference. First operand has 41 places, 46 transitions, 181 flow. Second operand 3 states and 473 transitions. [2023-11-17 15:21:15,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 186 flow [2023-11-17 15:21:15,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 170 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 15:21:15,958 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 72 flow [2023-11-17 15:21:15,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-11-17 15:21:15,958 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2023-11-17 15:21:15,959 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 72 flow [2023-11-17 15:21:15,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:21:15,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:15,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:15,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:21:15,959 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 15:21:15,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash 144762279, now seen corresponding path program 1 times [2023-11-17 15:21:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512362441] [2023-11-17 15:21:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:16,090 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 15:21:16,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:16,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512362441] [2023-11-17 15:21:16,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512362441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:16,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:16,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:21:16,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059119221] [2023-11-17 15:21:16,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:16,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:21:16,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:16,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:21:16,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:21:16,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 348 [2023-11-17 15:21:16,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 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 15:21:16,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:16,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 348 [2023-11-17 15:21:16,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:16,181 INFO L124 PetriNetUnfolderBase]: 214/415 cut-off events. [2023-11-17 15:21:16,182 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-11-17 15:21:16,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 415 events. 214/415 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1419 event pairs, 167 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 1008. Up to 357 conditions per place. [2023-11-17 15:21:16,184 INFO L140 encePairwiseOnDemand]: 341/348 looper letters, 35 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2023-11-17 15:21:16,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 185 flow [2023-11-17 15:21:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:21:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:21:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-17 15:21:16,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2023-11-17 15:21:16,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-17 15:21:16,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-17 15:21:16,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:16,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-17 15:21:16,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:21:16,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:16,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:16,189 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 72 flow. Second operand 3 states and 432 transitions. [2023-11-17 15:21:16,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 185 flow [2023-11-17 15:21:16,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:21:16,190 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 118 flow [2023-11-17 15:21:16,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2023-11-17 15:21:16,191 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-17 15:21:16,191 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 118 flow [2023-11-17 15:21:16,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 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 15:21:16,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:16,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:16,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:21:16,191 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:16,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1470792734, now seen corresponding path program 1 times [2023-11-17 15:21:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:16,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369328604] [2023-11-17 15:21:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:16,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:16,303 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 15:21:16,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:16,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369328604] [2023-11-17 15:21:16,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369328604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:16,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:16,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:21:16,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005343855] [2023-11-17 15:21:16,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:16,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:21:16,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:16,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:21:16,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:21:16,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 348 [2023-11-17 15:21:16,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 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 15:21:16,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:16,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 348 [2023-11-17 15:21:16,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:16,401 INFO L124 PetriNetUnfolderBase]: 225/445 cut-off events. [2023-11-17 15:21:16,401 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-11-17 15:21:16,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 445 events. 225/445 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1574 event pairs, 176 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 1125. Up to 376 conditions per place. [2023-11-17 15:21:16,403 INFO L140 encePairwiseOnDemand]: 341/348 looper letters, 37 selfloop transitions, 9 changer transitions 0/46 dead transitions. [2023-11-17 15:21:16,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 263 flow [2023-11-17 15:21:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:21:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:21:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-11-17 15:21:16,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128352490421456 [2023-11-17 15:21:16,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-11-17 15:21:16,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-11-17 15:21:16,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:16,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-11-17 15:21:16,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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 15:21:16,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:16,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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 15:21:16,408 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 118 flow. Second operand 3 states and 431 transitions. [2023-11-17 15:21:16,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 263 flow [2023-11-17 15:21:16,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 237 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:21:16,410 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 176 flow [2023-11-17 15:21:16,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2023-11-17 15:21:16,410 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-11-17 15:21:16,411 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 176 flow [2023-11-17 15:21:16,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 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 15:21:16,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:16,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:16,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:21:16,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:16,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash -938210542, now seen corresponding path program 1 times [2023-11-17 15:21:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:16,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252557632] [2023-11-17 15:21:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:16,814 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 15:21:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252557632] [2023-11-17 15:21:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252557632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:16,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:21:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322533063] [2023-11-17 15:21:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:16,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:21:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:16,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:21:16,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:21:16,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 348 [2023-11-17 15:21:16,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 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 15:21:16,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:16,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 348 [2023-11-17 15:21:16,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:16,983 INFO L124 PetriNetUnfolderBase]: 226/458 cut-off events. [2023-11-17 15:21:16,983 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2023-11-17 15:21:16,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 458 events. 226/458 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1850 event pairs, 21 based on Foata normal form. 12/459 useless extension candidates. Maximal degree in co-relation 1211. Up to 343 conditions per place. [2023-11-17 15:21:16,986 INFO L140 encePairwiseOnDemand]: 340/348 looper letters, 59 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2023-11-17 15:21:16,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 417 flow [2023-11-17 15:21:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:21:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:21:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1062 transitions. [2023-11-17 15:21:16,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43596059113300495 [2023-11-17 15:21:16,989 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1062 transitions. [2023-11-17 15:21:16,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1062 transitions. [2023-11-17 15:21:16,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:16,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1062 transitions. [2023-11-17 15:21:16,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.71428571428572) internal successors, (1062), 7 states have internal predecessors, (1062), 0 states have call successors, (0), 0 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 15:21:16,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 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 15:21:16,994 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 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 15:21:16,994 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 176 flow. Second operand 7 states and 1062 transitions. [2023-11-17 15:21:16,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 417 flow [2023-11-17 15:21:16,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 397 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:21:16,997 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 227 flow [2023-11-17 15:21:16,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2023-11-17 15:21:16,997 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-11-17 15:21:16,998 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 227 flow [2023-11-17 15:21:16,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 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 15:21:16,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:16,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:16,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:21:16,998 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:16,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:16,999 INFO L85 PathProgramCache]: Analyzing trace with hash -256288426, now seen corresponding path program 2 times [2023-11-17 15:21:16,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:16,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446831213] [2023-11-17 15:21:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:16,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:21:17,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:21:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:21:17,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:21:17,094 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:21:17,094 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-11-17 15:21:17,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-11-17 15:21:17,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-11-17 15:21:17,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-11-17 15:21:17,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-11-17 15:21:17,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-11-17 15:21:17,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-11-17 15:21:17,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-11-17 15:21:17,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:21:17,097 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-17 15:21:17,100 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:21:17,100 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:21:17,119 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-17 15:21:17,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-17 15:21:17,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-17 15:21:17,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-17 15:21:17,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-17 15:21:17,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet17 [2023-11-17 15:21:17,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-17 15:21:17,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-17 15:21:17,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:21:17 BasicIcfg [2023-11-17 15:21:17,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:21:17,127 INFO L158 Benchmark]: Toolchain (without parser) took 55329.95ms. Allocated memory was 194.0MB in the beginning and 333.4MB in the end (delta: 139.5MB). Free memory was 148.4MB in the beginning and 149.3MB in the end (delta: -810.4kB). Peak memory consumption was 140.1MB. Max. memory is 8.0GB. [2023-11-17 15:21:17,127 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:21:17,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 684.75ms. Allocated memory was 194.0MB in the beginning and 333.4MB in the end (delta: 139.5MB). Free memory was 148.4MB in the beginning and 295.0MB in the end (delta: -146.6MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. [2023-11-17 15:21:17,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.60ms. Allocated memory is still 333.4MB. Free memory was 295.0MB in the beginning and 291.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:21:17,128 INFO L158 Benchmark]: Boogie Preprocessor took 42.44ms. Allocated memory is still 333.4MB. Free memory was 291.3MB in the beginning and 288.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:21:17,128 INFO L158 Benchmark]: RCFGBuilder took 579.90ms. Allocated memory is still 333.4MB. Free memory was 288.2MB in the beginning and 258.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-11-17 15:21:17,128 INFO L158 Benchmark]: TraceAbstraction took 53951.85ms. Allocated memory is still 333.4MB. Free memory was 257.3MB in the beginning and 149.3MB in the end (delta: 108.0MB). Peak memory consumption was 108.0MB. Max. memory is 8.0GB. [2023-11-17 15:21:17,129 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 684.75ms. Allocated memory was 194.0MB in the beginning and 333.4MB in the end (delta: 139.5MB). Free memory was 148.4MB in the beginning and 295.0MB in the end (delta: -146.6MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.60ms. Allocated memory is still 333.4MB. Free memory was 295.0MB in the beginning and 291.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.44ms. Allocated memory is still 333.4MB. Free memory was 291.3MB in the beginning and 288.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 579.90ms. Allocated memory is still 333.4MB. Free memory was 288.2MB in the beginning and 258.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 53951.85ms. Allocated memory is still 333.4MB. Free memory was 257.3MB in the beginning and 149.3MB in the end (delta: 108.0MB). Peak memory consumption was 108.0MB. 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 Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet17 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 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: 50.9s, 165 PlacesBefore, 40 PlacesAfterwards, 165 TransitionsBefore, 38 TransitionsAfterwards, 3808 CoEnabledTransitionPairs, 7 FixpointIterations, 78 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 18 ConcurrentYvCompositions, 2 ChoiceCompositions, 167 TotalNumberOfCompositions, 7546 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4090, independent: 3834, independent conditional: 0, independent unconditional: 3834, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 79, unknown conditional: 0, unknown unconditional: 79] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2746, independent: 2660, independent conditional: 0, independent unconditional: 2660, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2746, independent: 2649, independent conditional: 0, independent unconditional: 2649, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43441, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 589, dependent conditional: 0, dependent unconditional: 589, unknown: 42716, unknown conditional: 0, unknown unconditional: 42716] ], Cache Queries: [ total: 4090, independent: 1174, independent conditional: 0, independent unconditional: 1174, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 2805, unknown conditional: 0, unknown unconditional: 2805] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10 - 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) );}) [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}] [L1697] EXPR 1 data->shared.b [L1697] 1 int lb = data->shared.b; [L1700] 1 data->shared.b = lb + 1 VAL [arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1703] 1 return 0; [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\result={0:0}, arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, res=0, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [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; [L1722] 0 \read(t1) VAL [\result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={6:0}, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={6:0}, t1={3:0}, t2={4:0}] [L1724] 0 data->shared.a = 3 VAL [\result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={6:0}, t1={3:0}, t2={4:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1727] 0 data->shared.b = 3 VAL [\result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={6:0}, t1={3:0}, t2={4:0}] [L1730] EXPR 0 data->shared.a [L1730] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=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, 193 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: 53.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 51.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 467 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 3 mSDtfsCounter, 467 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=6, InterpolantAutomatonStates: 22, 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.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 15:21:17,191 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...