/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:38:26,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:38:26,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:38:26,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:38:26,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:38:26,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:38:26,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:38:26,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:38:26,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:38:26,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:38:26,094 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:38:26,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:38:26,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:38:26,094 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:38:26,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:38:26,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:38:26,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:38:26,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:38:26,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:38:26,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:38:26,096 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:38:26,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:38:26,101 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:38:26,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:38:26,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:38:26,104 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:38:26,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:38:26,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:38:26,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:38:26,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:38:26,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:38:26,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:38:26,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:38:26,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:38:26,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:38:26,106 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:38:26,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:38:26,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:38:26,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:38:26,392 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:38:26,392 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:38:26,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2023-08-24 05:38:27,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:38:27,578 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:38:27,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2023-08-24 05:38:27,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ec56db9/a0215989b5ea44f98411aaf407edded0/FLAGaf6838359 [2023-08-24 05:38:27,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ec56db9/a0215989b5ea44f98411aaf407edded0 [2023-08-24 05:38:27,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:38:27,615 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:38:27,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:38:27,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:38:27,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:38:27,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:38:27" (1/1) ... [2023-08-24 05:38:27,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea524a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:27, skipping insertion in model container [2023-08-24 05:38:27,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:38:27" (1/1) ... [2023-08-24 05:38:27,664 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:38:27,786 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-24 05:38:28,208 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-3_2-container_of-global.i[75009,75022] [2023-08-24 05:38:28,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:38:28,248 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:38:28,256 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-24 05:38:28,267 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [251] [2023-08-24 05:38:28,268 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [251] [2023-08-24 05:38:28,275 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [735] [2023-08-24 05:38:28,289 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-3_2-container_of-global.i[75009,75022] [2023-08-24 05:38:28,291 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned long [1691] [2023-08-24 05:38:28,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:38:28,377 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:38:28,377 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:38:28,378 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:38:28,382 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:38:28,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28 WrapperNode [2023-08-24 05:38:28,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:38:28,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:38:28,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:38:28,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:38:28,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,451 INFO L138 Inliner]: procedures = 468, calls = 52, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 137 [2023-08-24 05:38:28,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:38:28,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:38:28,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:38:28,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:38:28,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:38:28,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:38:28,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:38:28,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:38:28,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (1/1) ... [2023-08-24 05:38:28,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:38:28,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:38:28,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:38:28,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:38:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:38:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:38:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:38:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 05:38:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:38:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-24 05:38:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:38:28,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:38:28,529 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-08-24 05:38:28,529 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-08-24 05:38:28,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:38:28,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:38:28,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:38:28,530 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:38:28,756 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:38:28,757 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:38:28,948 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:38:28,961 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:38:28,961 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:38:28,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:38:28 BoogieIcfgContainer [2023-08-24 05:38:28,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:38:28,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:38:28,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:38:28,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:38:28,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:38:27" (1/3) ... [2023-08-24 05:38:28,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7042311c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:38:28, skipping insertion in model container [2023-08-24 05:38:28,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:28" (2/3) ... [2023-08-24 05:38:28,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7042311c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:38:28, skipping insertion in model container [2023-08-24 05:38:28,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:38:28" (3/3) ... [2023-08-24 05:38:28,969 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2023-08-24 05:38:28,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:38:28,984 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-24 05:38:28,984 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:38:29,035 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 05:38:29,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 170 transitions, 356 flow [2023-08-24 05:38:29,103 INFO L124 PetriNetUnfolderBase]: 10/210 cut-off events. [2023-08-24 05:38:29,103 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 05:38:29,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 210 events. 10/210 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 330 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 124. Up to 4 conditions per place. [2023-08-24 05:38:29,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 170 transitions, 356 flow [2023-08-24 05:38:29,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 156 transitions, 324 flow [2023-08-24 05:38:29,112 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:38:29,118 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 156 transitions, 324 flow [2023-08-24 05:38:29,120 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 156 transitions, 324 flow [2023-08-24 05:38:29,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 156 transitions, 324 flow [2023-08-24 05:38:29,155 INFO L124 PetriNetUnfolderBase]: 7/187 cut-off events. [2023-08-24 05:38:29,155 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 05:38:29,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 187 events. 7/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 270 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 112. Up to 4 conditions per place. [2023-08-24 05:38:29,159 INFO L119 LiptonReduction]: Number of co-enabled transitions 1780 [2023-08-24 05:38:38,827 INFO L134 LiptonReduction]: Checked pairs total: 3012 [2023-08-24 05:38:38,827 INFO L136 LiptonReduction]: Total number of compositions: 169 [2023-08-24 05:38:38,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:38:38,840 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6905d19a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:38:38,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-08-24 05:38:38,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:38:38,842 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-24 05:38:38,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:38:38,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:38,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-24 05:38:38,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:38,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash 596, now seen corresponding path program 1 times [2023-08-24 05:38:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62820090] [2023-08-24 05:38:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:38:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:38:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:38:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62820090] [2023-08-24 05:38:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62820090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:38:38,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:38:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-24 05:38:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704930654] [2023-08-24 05:38:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:38:38,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 05:38:38,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:38:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 05:38:39,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 05:38:39,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 339 [2023-08-24 05:38:39,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:38:39,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 339 [2023-08-24 05:38:39,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:38:39,100 INFO L124 PetriNetUnfolderBase]: 169/316 cut-off events. [2023-08-24 05:38:39,100 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-24 05:38:39,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 316 events. 169/316 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1211 event pairs, 168 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 568. Up to 312 conditions per place. [2023-08-24 05:38:39,104 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 24 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-24 05:38:39,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 110 flow [2023-08-24 05:38:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 05:38:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 05:38:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 331 transitions. [2023-08-24 05:38:39,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882005899705015 [2023-08-24 05:38:39,120 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 331 transitions. [2023-08-24 05:38:39,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 331 transitions. [2023-08-24 05:38:39,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:38:39,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 331 transitions. [2023-08-24 05:38:39,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,131 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,133 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 68 flow. Second operand 2 states and 331 transitions. [2023-08-24 05:38:39,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 110 flow [2023-08-24 05:38:39,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:38:39,136 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 54 flow [2023-08-24 05:38:39,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2023-08-24 05:38:39,144 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-08-24 05:38:39,144 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 54 flow [2023-08-24 05:38:39,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:39,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-24 05:38:39,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:38:39,145 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:39,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash 18294559, now seen corresponding path program 1 times [2023-08-24 05:38:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:39,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154060541] [2023-08-24 05:38:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:38:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:38:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:38:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154060541] [2023-08-24 05:38:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154060541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:38:39,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:38:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:38:39,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986298603] [2023-08-24 05:38:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:38:39,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:38:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:38:39,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:38:39,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:38:39,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 339 [2023-08-24 05:38:39,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:38:39,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 339 [2023-08-24 05:38:39,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:38:39,573 INFO L124 PetriNetUnfolderBase]: 264/481 cut-off events. [2023-08-24 05:38:39,574 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 05:38:39,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 481 events. 264/481 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2012 event pairs, 122 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 967. Up to 381 conditions per place. [2023-08-24 05:38:39,577 INFO L140 encePairwiseOnDemand]: 332/339 looper letters, 28 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2023-08-24 05:38:39,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 140 flow [2023-08-24 05:38:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:38:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:38:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-24 05:38:39,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3913470993117011 [2023-08-24 05:38:39,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-24 05:38:39,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-24 05:38:39,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:38:39,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-24 05:38:39,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,584 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 54 flow. Second operand 3 states and 398 transitions. [2023-08-24 05:38:39,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 140 flow [2023-08-24 05:38:39,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:38:39,586 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 90 flow [2023-08-24 05:38:39,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2023-08-24 05:38:39,587 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-24 05:38:39,587 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 90 flow [2023-08-24 05:38:39,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:39,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:38:39,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:38:39,588 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:39,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash 567130676, now seen corresponding path program 1 times [2023-08-24 05:38:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345377909] [2023-08-24 05:38:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:38:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:38:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:38:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345377909] [2023-08-24 05:38:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345377909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:38:39,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:38:39,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:38:39,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172600368] [2023-08-24 05:38:39,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:38:39,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:38:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:38:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:38:39,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:38:39,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 339 [2023-08-24 05:38:39,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:38:39,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 339 [2023-08-24 05:38:39,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:38:39,841 INFO L124 PetriNetUnfolderBase]: 291/536 cut-off events. [2023-08-24 05:38:39,841 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2023-08-24 05:38:39,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 536 events. 291/536 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2377 event pairs, 135 based on Foata normal form. 32/566 useless extension candidates. Maximal degree in co-relation 1391. Up to 417 conditions per place. [2023-08-24 05:38:39,844 INFO L140 encePairwiseOnDemand]: 332/339 looper letters, 30 selfloop transitions, 9 changer transitions 2/41 dead transitions. [2023-08-24 05:38:39,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 218 flow [2023-08-24 05:38:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:38:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:38:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-24 05:38:39,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39036381514257623 [2023-08-24 05:38:39,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-24 05:38:39,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-24 05:38:39,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:38:39,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-24 05:38:39,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,848 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 90 flow. Second operand 3 states and 397 transitions. [2023-08-24 05:38:39,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 218 flow [2023-08-24 05:38:39,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:38:39,852 INFO L231 Difference]: Finished difference. Result has 32 places, 35 transitions, 155 flow [2023-08-24 05:38:39,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=32, PETRI_TRANSITIONS=35} [2023-08-24 05:38:39,853 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-24 05:38:39,855 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 35 transitions, 155 flow [2023-08-24 05:38:39,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:39,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:38:39,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:38:39,856 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:39,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash 447455202, now seen corresponding path program 1 times [2023-08-24 05:38:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291662469] [2023-08-24 05:38:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:38:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:38:39,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:38:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291662469] [2023-08-24 05:38:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291662469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:38:39,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:38:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:38:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814945083] [2023-08-24 05:38:39,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:38:39,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:38:39,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:38:39,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:38:39,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:38:39,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 339 [2023-08-24 05:38:39,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 35 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:38:39,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 339 [2023-08-24 05:38:39,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:38:39,976 INFO L124 PetriNetUnfolderBase]: 72/144 cut-off events. [2023-08-24 05:38:39,976 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2023-08-24 05:38:39,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 144 events. 72/144 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 407 event pairs, 15 based on Foata normal form. 16/159 useless extension candidates. Maximal degree in co-relation 409. Up to 104 conditions per place. [2023-08-24 05:38:39,977 INFO L140 encePairwiseOnDemand]: 337/339 looper letters, 23 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-08-24 05:38:39,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 132 flow [2023-08-24 05:38:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:38:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:38:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-24 05:38:39,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4552605703048181 [2023-08-24 05:38:39,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-24 05:38:39,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-24 05:38:39,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:38:39,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-24 05:38:39,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,982 INFO L175 Difference]: Start difference. First operand has 32 places, 35 transitions, 155 flow. Second operand 3 states and 463 transitions. [2023-08-24 05:38:39,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 132 flow [2023-08-24 05:38:39,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 116 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-24 05:38:39,984 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 50 flow [2023-08-24 05:38:39,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-24 05:38:39,985 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -6 predicate places. [2023-08-24 05:38:39,985 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 50 flow [2023-08-24 05:38:39,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:38:39,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:39,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:38:39,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:38:39,986 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:39,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash -338462614, now seen corresponding path program 1 times [2023-08-24 05:38:39,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:39,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251395365] [2023-08-24 05:38:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:38:40,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:38:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:38:40,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:38:40,138 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:38:40,139 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-08-24 05:38:40,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-08-24 05:38:40,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-08-24 05:38:40,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-08-24 05:38:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-08-24 05:38:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-08-24 05:38:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-08-24 05:38:40,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-08-24 05:38:40,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:38:40,146 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-24 05:38:40,150 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:38:40,150 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:38:40,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:38:40 BasicIcfg [2023-08-24 05:38:40,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:38:40,204 INFO L158 Benchmark]: Toolchain (without parser) took 12589.04ms. Allocated memory was 350.2MB in the beginning and 566.2MB in the end (delta: 216.0MB). Free memory was 322.9MB in the beginning and 254.4MB in the end (delta: 68.5MB). Peak memory consumption was 286.2MB. Max. memory is 16.0GB. [2023-08-24 05:38:40,204 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory was 328.2MB in the beginning and 328.0MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:38:40,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 767.43ms. Allocated memory is still 350.2MB. Free memory was 322.9MB in the beginning and 268.4MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. [2023-08-24 05:38:40,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.58ms. Allocated memory is still 350.2MB. Free memory was 268.4MB in the beginning and 264.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:38:40,207 INFO L158 Benchmark]: Boogie Preprocessor took 24.06ms. Allocated memory is still 350.2MB. Free memory was 264.9MB in the beginning and 262.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 05:38:40,208 INFO L158 Benchmark]: RCFGBuilder took 486.19ms. Allocated memory was 350.2MB in the beginning and 471.9MB in the end (delta: 121.6MB). Free memory was 262.1MB in the beginning and 436.8MB in the end (delta: -174.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.0GB. [2023-08-24 05:38:40,208 INFO L158 Benchmark]: TraceAbstraction took 11239.21ms. Allocated memory was 471.9MB in the beginning and 566.2MB in the end (delta: 94.4MB). Free memory was 435.8MB in the beginning and 254.4MB in the end (delta: 181.3MB). Peak memory consumption was 276.7MB. Max. memory is 16.0GB. [2023-08-24 05:38:40,209 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.11ms. Allocated memory is still 350.2MB. Free memory was 328.2MB in the beginning and 328.0MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 767.43ms. Allocated memory is still 350.2MB. Free memory was 322.9MB in the beginning and 268.4MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.58ms. Allocated memory is still 350.2MB. Free memory was 268.4MB in the beginning and 264.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.06ms. Allocated memory is still 350.2MB. Free memory was 264.9MB in the beginning and 262.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 486.19ms. Allocated memory was 350.2MB in the beginning and 471.9MB in the end (delta: 121.6MB). Free memory was 262.1MB in the beginning and 436.8MB in the end (delta: -174.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.0GB. * TraceAbstraction took 11239.21ms. Allocated memory was 471.9MB in the beginning and 566.2MB in the end (delta: 94.4MB). Free memory was 435.8MB in the beginning and 254.4MB in the end (delta: 181.3MB). Peak memory consumption was 276.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 251]: Unsoundness Warning unspecified type, defaulting to int C: short [251] - GenericResultAtLocation [Line: 251]: Unsoundness Warning unspecified type, defaulting to int C: short [251] - GenericResultAtLocation [Line: 735]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [735] - GenericResultAtLocation [Line: 1691]: Unsoundness Warning unspecified type, defaulting to int C: unsigned long [1691] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7s, 156 PlacesBefore, 32 PlacesAfterwards, 156 TransitionsBefore, 28 TransitionsAfterwards, 1780 CoEnabledTransitionPairs, 7 FixpointIterations, 99 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 11 ConcurrentYvCompositions, 4 ChoiceCompositions, 169 TotalNumberOfCompositions, 3012 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1607, independent: 1470, independent conditional: 0, independent unconditional: 1470, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 957, independent: 920, independent conditional: 0, independent unconditional: 920, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1607, independent: 550, independent conditional: 0, independent unconditional: 550, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 957, unknown conditional: 0, unknown unconditional: 957] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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; [L1688] 0 struct device *my_dev; [L1733] CALL, EXPR 0 my_drv_init() [L1727] 0 return 0; [L1733] RET, EXPR 0 my_drv_init() [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1737] CALL, EXPR 0 my_drv_probe(&data) [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1707] EXPR 0 data->shared.a [L1707] CALL 0 ldv_assert(data->shared.a==0) [L1675] COND FALSE 0 !(!expression) [L1707] RET 0 ldv_assert(data->shared.a==0) [L1708] EXPR 0 data->shared.b [L1708] CALL 0 ldv_assert(data->shared.b==0) [L1675] COND FALSE 0 !(!expression) [L1708] RET 0 ldv_assert(data->shared.b==0) [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, pthread_create(&t1, ((void *)0), my_callback, ((void *)0))=-10, res=0, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 VAL [__mptr={4:-7}, arg={0:0}, arg={0:0}, data={4:-31}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={4:-7}, arg={0:0}, arg={0:0}, data={4:-31}, data={6:0}, data={6:0}, my_dev={6:24}, pthread_create(&t2, ((void *)0), my_callback, ((void *)0))=-9, res=0, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [__mptr={3:25}, arg={0:0}, arg={0:0}, data={4:1}, lb=-9, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1715] 0 return 0; [L1737] RET, EXPR 0 my_drv_probe(&data) [L1737] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={3:25}, arg={0:0}, arg={0:0}, data={4:-31}, data={6:0}, lb=-9, my_dev={6:24}, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1738] COND TRUE 0 probe_ret==0 [L1739] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [\read(t1)=-10, \result={0:0}, __mptr={3:25}, arg={0:0}, arg={0:0}, data={4:-31}, data={6:0}, data={6:0}, lb=-9, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-10, \result={0:0}, __mptr={3:25}, arg={0:0}, arg={0:0}, data={4:-31}, data={6:0}, data={6:0}, lb=-9, my_dev={6:24}, pthread_join(t1, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1723] 0 \read(t2) VAL [\read(t2)=-9, \result={0:0}, __mptr={3:25}, arg={0:0}, arg={0:0}, data={4:-31}, data={6:0}, data={6:0}, lb=-9, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=-9, \result={0:0}, __mptr={3:25}, arg={0:0}, arg={0:0}, data={4:-31}, data={6:0}, data={6:0}, lb=-9, my_dev={6:24}, pthread_join(t2, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1739] RET 0 my_drv_disconnect(&data) [L1740] EXPR 0 data.shared.a [L1740] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={3:25}, arg={0:0}, arg={0:0}, data={4:-31}, expression=0, lb=-9, my_dev={6:24}, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 175 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: 11.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 173 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1 mSDtfsCounter, 173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:38:40,226 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...