/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 PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:49:05,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:49:05,980 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 11:49:05,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:49:05,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:49:06,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:49:06,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:49:06,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:49:06,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:49:06,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:49:06,021 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:49:06,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:49:06,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:49:06,022 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:49:06,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:49:06,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:49:06,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:49:06,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:49:06,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:49:06,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:49:06,024 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:49:06,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:49:06,025 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:49:06,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:49:06,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:49:06,026 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:49:06,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:49:06,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:49:06,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:49:06,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:49:06,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:49:06,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:49:06,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:49:06,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:49:06,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:49:06,028 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 -> PROGRAM_FIRST [2023-08-24 11:49:06,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:49:06,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:49:06,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:49:06,348 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:49:06,349 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:49:06,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2023-08-24 11:49:07,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:49:07,777 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:49:07,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2023-08-24 11:49:07,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79a93859/97cf61d10c0c406ab12c669f62bc0ffe/FLAG570e00c00 [2023-08-24 11:49:07,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79a93859/97cf61d10c0c406ab12c669f62bc0ffe [2023-08-24 11:49:07,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:49:07,826 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:49:07,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:49:07,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:49:07,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:49:07,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:49:07" (1/1) ... [2023-08-24 11:49:07,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a06b065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:07, skipping insertion in model container [2023-08-24 11:49:07,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:49:07" (1/1) ... [2023-08-24 11:49:07,887 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:49:08,060 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2023-08-24 11:49:08,261 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:49:08,271 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:49:08,280 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2023-08-24 11:49:08,287 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 11:49:08,289 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 11:49:08,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:49:08,362 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:49:08,363 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:49:08,369 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:49:08,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08 WrapperNode [2023-08-24 11:49:08,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:49:08,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:49:08,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:49:08,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:49:08,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,426 INFO L138 Inliner]: procedures = 176, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-08-24 11:49:08,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:49:08,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:49:08,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:49:08,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:49:08,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:49:08,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:49:08,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:49:08,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:49:08,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (1/1) ... [2023-08-24 11:49:08,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:49:08,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:49:08,510 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 11:49:08,516 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 11:49:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 11:49:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:49:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:49:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:49:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:49:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:49:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:49:08,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:49:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:49:08,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:49:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:49:08,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:49:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:49:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:49:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:49:08,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:49:08,572 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 11:49:08,710 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:49:08,712 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:49:09,003 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:49:09,157 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:49:09,158 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:49:09,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:49:09 BoogieIcfgContainer [2023-08-24 11:49:09,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:49:09,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:49:09,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:49:09,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:49:09,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:49:07" (1/3) ... [2023-08-24 11:49:09,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5303bc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:49:09, skipping insertion in model container [2023-08-24 11:49:09,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:49:08" (2/3) ... [2023-08-24 11:49:09,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5303bc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:49:09, skipping insertion in model container [2023-08-24 11:49:09,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:49:09" (3/3) ... [2023-08-24 11:49:09,166 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2023-08-24 11:49:09,181 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:49:09,182 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 11:49:09,182 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:49:09,257 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:49:09,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2023-08-24 11:49:09,328 INFO L124 PetriNetUnfolderBase]: 2/120 cut-off events. [2023-08-24 11:49:09,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:49:09,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-24 11:49:09,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2023-08-24 11:49:09,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2023-08-24 11:49:09,338 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:49:09,346 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2023-08-24 11:49:09,348 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2023-08-24 11:49:09,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2023-08-24 11:49:09,372 INFO L124 PetriNetUnfolderBase]: 1/108 cut-off events. [2023-08-24 11:49:09,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:49:09,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-24 11:49:09,374 INFO L119 LiptonReduction]: Number of co-enabled transitions 1064 [2023-08-24 11:49:15,041 INFO L134 LiptonReduction]: Checked pairs total: 2996 [2023-08-24 11:49:15,041 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-24 11:49:15,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:49:15,058 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;@36ff04aa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:49:15,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 11:49:15,064 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:49:15,064 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-08-24 11:49:15,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:49:15,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:15,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:49:15,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:15,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1642651630, now seen corresponding path program 1 times [2023-08-24 11:49:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:15,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569467798] [2023-08-24 11:49:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:49:15,678 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 11:49:15,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:49:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569467798] [2023-08-24 11:49:15,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569467798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:49:15,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:49:15,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:49:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682974395] [2023-08-24 11:49:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:49:15,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:49:15,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:49:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:49:15,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:49:15,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 215 [2023-08-24 11:49:15,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 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 11:49:15,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:49:15,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 215 [2023-08-24 11:49:15,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:49:15,966 INFO L124 PetriNetUnfolderBase]: 449/755 cut-off events. [2023-08-24 11:49:15,967 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-24 11:49:15,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 755 events. 449/755 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3473 event pairs, 104 based on Foata normal form. 72/790 useless extension candidates. Maximal degree in co-relation 1483. Up to 496 conditions per place. [2023-08-24 11:49:15,977 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 21 selfloop transitions, 2 changer transitions 14/39 dead transitions. [2023-08-24 11:49:15,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 161 flow [2023-08-24 11:49:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:49:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:49:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-08-24 11:49:15,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451162790697675 [2023-08-24 11:49:15,992 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-08-24 11:49:15,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-08-24 11:49:15,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:49:15,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-08-24 11:49:15,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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 11:49:16,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 11:49:16,006 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 11:49:16,007 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 5 states and 586 transitions. [2023-08-24 11:49:16,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 161 flow [2023-08-24 11:49:16,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 11:49:16,011 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 56 flow [2023-08-24 11:49:16,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2023-08-24 11:49:16,015 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-08-24 11:49:16,015 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 56 flow [2023-08-24 11:49:16,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 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 11:49:16,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:16,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:49:16,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:49:16,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:16,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash 617389834, now seen corresponding path program 1 times [2023-08-24 11:49:16,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:16,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253903713] [2023-08-24 11:49:16,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:49:16,166 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 11:49:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:49:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253903713] [2023-08-24 11:49:16,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253903713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:49:16,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:49:16,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:49:16,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026992757] [2023-08-24 11:49:16,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:49:16,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:49:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:49:16,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:49:16,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:49:16,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 215 [2023-08-24 11:49:16,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 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 11:49:16,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:49:16,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 215 [2023-08-24 11:49:16,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:49:16,384 INFO L124 PetriNetUnfolderBase]: 586/951 cut-off events. [2023-08-24 11:49:16,384 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-08-24 11:49:16,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 951 events. 586/951 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4196 event pairs, 125 based on Foata normal form. 36/983 useless extension candidates. Maximal degree in co-relation 2078. Up to 351 conditions per place. [2023-08-24 11:49:16,389 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 28 selfloop transitions, 3 changer transitions 19/51 dead transitions. [2023-08-24 11:49:16,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 229 flow [2023-08-24 11:49:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:49:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:49:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions. [2023-08-24 11:49:16,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-08-24 11:49:16,393 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 688 transitions. [2023-08-24 11:49:16,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions. [2023-08-24 11:49:16,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:49:16,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions. [2023-08-24 11:49:16,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 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 11:49:16,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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 11:49:16,399 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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 11:49:16,399 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 56 flow. Second operand 6 states and 688 transitions. [2023-08-24 11:49:16,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 229 flow [2023-08-24 11:49:16,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 219 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 11:49:16,403 INFO L231 Difference]: Finished difference. Result has 36 places, 19 transitions, 66 flow [2023-08-24 11:49:16,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=19} [2023-08-24 11:49:16,404 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2023-08-24 11:49:16,404 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 19 transitions, 66 flow [2023-08-24 11:49:16,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 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 11:49:16,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:16,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:49:16,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:49:16,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:16,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1959377228, now seen corresponding path program 1 times [2023-08-24 11:49:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493868232] [2023-08-24 11:49:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:49:16,649 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 11:49:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:49:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493868232] [2023-08-24 11:49:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493868232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:49:16,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:49:16,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:49:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470854253] [2023-08-24 11:49:16,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:49:16,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:49:16,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:49:16,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:49:16,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:49:16,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 215 [2023-08-24 11:49:16,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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 11:49:16,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:49:16,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 215 [2023-08-24 11:49:16,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:49:16,773 INFO L124 PetriNetUnfolderBase]: 216/409 cut-off events. [2023-08-24 11:49:16,774 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-08-24 11:49:16,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 409 events. 216/409 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1782 event pairs, 41 based on Foata normal form. 18/425 useless extension candidates. Maximal degree in co-relation 955. Up to 261 conditions per place. [2023-08-24 11:49:16,776 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 26 selfloop transitions, 2 changer transitions 9/39 dead transitions. [2023-08-24 11:49:16,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 198 flow [2023-08-24 11:49:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:49:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:49:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2023-08-24 11:49:16,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432558139534883 [2023-08-24 11:49:16,779 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2023-08-24 11:49:16,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2023-08-24 11:49:16,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:49:16,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2023-08-24 11:49:16,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:49:16,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 11:49:16,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 11:49:16,783 INFO L175 Difference]: Start difference. First operand has 36 places, 19 transitions, 66 flow. Second operand 5 states and 584 transitions. [2023-08-24 11:49:16,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 198 flow [2023-08-24 11:49:16,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 173 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-24 11:49:16,788 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 62 flow [2023-08-24 11:49:16,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2023-08-24 11:49:16,790 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-24 11:49:16,792 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 62 flow [2023-08-24 11:49:16,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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 11:49:16,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:16,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:49:16,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:49:16,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:16,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:16,794 INFO L85 PathProgramCache]: Analyzing trace with hash 298356737, now seen corresponding path program 1 times [2023-08-24 11:49:16,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:16,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836842569] [2023-08-24 11:49:16,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:16,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:49:17,929 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 11:49:17,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:49:17,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836842569] [2023-08-24 11:49:17,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836842569] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:49:17,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:49:17,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:49:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156338862] [2023-08-24 11:49:17,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:49:17,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:49:17,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:49:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:49:17,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:49:17,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 215 [2023-08-24 11:49:17,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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 11:49:17,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:49:17,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 215 [2023-08-24 11:49:17,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:49:18,154 INFO L124 PetriNetUnfolderBase]: 322/561 cut-off events. [2023-08-24 11:49:18,155 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2023-08-24 11:49:18,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 561 events. 322/561 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2400 event pairs, 65 based on Foata normal form. 16/577 useless extension candidates. Maximal degree in co-relation 1344. Up to 238 conditions per place. [2023-08-24 11:49:18,158 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 30 selfloop transitions, 6 changer transitions 8/45 dead transitions. [2023-08-24 11:49:18,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 224 flow [2023-08-24 11:49:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:49:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:49:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 568 transitions. [2023-08-24 11:49:18,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44031007751937984 [2023-08-24 11:49:18,161 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 568 transitions. [2023-08-24 11:49:18,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 568 transitions. [2023-08-24 11:49:18,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:49:18,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 568 transitions. [2023-08-24 11:49:18,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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 11:49:18,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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 11:49:18,167 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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 11:49:18,167 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 62 flow. Second operand 6 states and 568 transitions. [2023-08-24 11:49:18,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 224 flow [2023-08-24 11:49:18,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 210 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 11:49:18,171 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 96 flow [2023-08-24 11:49:18,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-08-24 11:49:18,172 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-24 11:49:18,172 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 96 flow [2023-08-24 11:49:18,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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 11:49:18,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:18,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:49:18,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:49:18,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:18,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash 403740657, now seen corresponding path program 2 times [2023-08-24 11:49:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062327475] [2023-08-24 11:49:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:49:19,142 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 11:49:19,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:49:19,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062327475] [2023-08-24 11:49:19,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062327475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:49:19,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:49:19,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:49:19,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141292968] [2023-08-24 11:49:19,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:49:19,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 11:49:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:49:19,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 11:49:19,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-24 11:49:19,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 215 [2023-08-24 11:49:19,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 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 11:49:19,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:49:19,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 215 [2023-08-24 11:49:19,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:49:19,432 INFO L124 PetriNetUnfolderBase]: 306/537 cut-off events. [2023-08-24 11:49:19,433 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2023-08-24 11:49:19,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 537 events. 306/537 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2286 event pairs, 61 based on Foata normal form. 16/552 useless extension candidates. Maximal degree in co-relation 1413. Up to 230 conditions per place. [2023-08-24 11:49:19,436 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 30 selfloop transitions, 5 changer transitions 8/44 dead transitions. [2023-08-24 11:49:19,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 245 flow [2023-08-24 11:49:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:49:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:49:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2023-08-24 11:49:19,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44263565891472867 [2023-08-24 11:49:19,439 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 571 transitions. [2023-08-24 11:49:19,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions. [2023-08-24 11:49:19,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:49:19,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions. [2023-08-24 11:49:19,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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 11:49:19,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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 11:49:19,443 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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 11:49:19,443 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 96 flow. Second operand 6 states and 571 transitions. [2023-08-24 11:49:19,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 245 flow [2023-08-24 11:49:19,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 236 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 11:49:19,445 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 112 flow [2023-08-24 11:49:19,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-08-24 11:49:19,446 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2023-08-24 11:49:19,446 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 112 flow [2023-08-24 11:49:19,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 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 11:49:19,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:19,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:49:19,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:49:19,447 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:19,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash 659063822, now seen corresponding path program 1 times [2023-08-24 11:49:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:19,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914126847] [2023-08-24 11:49:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:49:19,598 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 11:49:19,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:49:19,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914126847] [2023-08-24 11:49:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914126847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:49:19,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:49:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:49:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338962303] [2023-08-24 11:49:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:49:19,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:49:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:49:19,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:49:19,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:49:19,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 215 [2023-08-24 11:49:19,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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 11:49:19,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:49:19,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 215 [2023-08-24 11:49:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:49:19,716 INFO L124 PetriNetUnfolderBase]: 233/435 cut-off events. [2023-08-24 11:49:19,716 INFO L125 PetriNetUnfolderBase]: For 373/373 co-relation queries the response was YES. [2023-08-24 11:49:19,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 435 events. 233/435 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1929 event pairs, 24 based on Foata normal form. 39/472 useless extension candidates. Maximal degree in co-relation 1191. Up to 189 conditions per place. [2023-08-24 11:49:19,719 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 37 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2023-08-24 11:49:19,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 282 flow [2023-08-24 11:49:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:49:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:49:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2023-08-24 11:49:19,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372093023255814 [2023-08-24 11:49:19,721 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2023-08-24 11:49:19,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2023-08-24 11:49:19,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:49:19,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2023-08-24 11:49:19,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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 11:49:19,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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 11:49:19,724 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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 11:49:19,725 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 112 flow. Second operand 4 states and 462 transitions. [2023-08-24 11:49:19,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 282 flow [2023-08-24 11:49:19,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 274 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 11:49:19,726 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 142 flow [2023-08-24 11:49:19,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-24 11:49:19,729 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2023-08-24 11:49:19,729 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 142 flow [2023-08-24 11:49:19,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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 11:49:19,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:19,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:49:19,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:49:19,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:19,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1328589765, now seen corresponding path program 1 times [2023-08-24 11:49:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281832077] [2023-08-24 11:49:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:49:19,923 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 11:49:19,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:49:19,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281832077] [2023-08-24 11:49:19,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281832077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:49:19,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:49:19,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:49:19,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880815373] [2023-08-24 11:49:19,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:49:19,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:49:19,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:49:19,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:49:19,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:49:19,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 215 [2023-08-24 11:49:19,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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 11:49:19,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:49:19,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 215 [2023-08-24 11:49:19,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:49:20,045 INFO L124 PetriNetUnfolderBase]: 177/362 cut-off events. [2023-08-24 11:49:20,045 INFO L125 PetriNetUnfolderBase]: For 493/493 co-relation queries the response was YES. [2023-08-24 11:49:20,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 362 events. 177/362 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1606 event pairs, 26 based on Foata normal form. 28/388 useless extension candidates. Maximal degree in co-relation 1246. Up to 142 conditions per place. [2023-08-24 11:49:20,047 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 42 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2023-08-24 11:49:20,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 355 flow [2023-08-24 11:49:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:49:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:49:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2023-08-24 11:49:20,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358139534883721 [2023-08-24 11:49:20,050 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 576 transitions. [2023-08-24 11:49:20,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 576 transitions. [2023-08-24 11:49:20,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:49:20,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 576 transitions. [2023-08-24 11:49:20,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 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 11:49:20,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 11:49:20,053 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 11:49:20,054 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 142 flow. Second operand 5 states and 576 transitions. [2023-08-24 11:49:20,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 355 flow [2023-08-24 11:49:20,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:49:20,056 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 194 flow [2023-08-24 11:49:20,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-24 11:49:20,057 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2023-08-24 11:49:20,057 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 194 flow [2023-08-24 11:49:20,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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 11:49:20,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:20,057 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 11:49:20,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:49:20,058 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:20,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash -738784275, now seen corresponding path program 1 times [2023-08-24 11:49:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163889024] [2023-08-24 11:49:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:49:20,188 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 11:49:20,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:49:20,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163889024] [2023-08-24 11:49:20,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163889024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:49:20,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:49:20,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:49:20,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671119708] [2023-08-24 11:49:20,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:49:20,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:49:20,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:49:20,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:49:20,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:49:20,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 215 [2023-08-24 11:49:20,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 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 11:49:20,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:49:20,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 215 [2023-08-24 11:49:20,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:49:20,368 INFO L124 PetriNetUnfolderBase]: 344/690 cut-off events. [2023-08-24 11:49:20,368 INFO L125 PetriNetUnfolderBase]: For 1719/1719 co-relation queries the response was YES. [2023-08-24 11:49:20,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 690 events. 344/690 cut-off events. For 1719/1719 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3535 event pairs, 67 based on Foata normal form. 5/688 useless extension candidates. Maximal degree in co-relation 2703. Up to 362 conditions per place. [2023-08-24 11:49:20,372 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 48 selfloop transitions, 2 changer transitions 11/64 dead transitions. [2023-08-24 11:49:20,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 509 flow [2023-08-24 11:49:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:49:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:49:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2023-08-24 11:49:20,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5302325581395348 [2023-08-24 11:49:20,375 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 570 transitions. [2023-08-24 11:49:20,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 570 transitions. [2023-08-24 11:49:20,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:49:20,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 570 transitions. [2023-08-24 11:49:20,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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 11:49:20,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 11:49:20,379 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 11:49:20,379 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 194 flow. Second operand 5 states and 570 transitions. [2023-08-24 11:49:20,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 509 flow [2023-08-24 11:49:20,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 486 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-24 11:49:20,383 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 197 flow [2023-08-24 11:49:20,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-08-24 11:49:20,384 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2023-08-24 11:49:20,384 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 197 flow [2023-08-24 11:49:20,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 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 11:49:20,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:20,384 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 11:49:20,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:49:20,385 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:20,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1239402563, now seen corresponding path program 2 times [2023-08-24 11:49:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852536527] [2023-08-24 11:49:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:49:20,553 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 11:49:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:49:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852536527] [2023-08-24 11:49:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852536527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:49:20,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:49:20,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:49:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619767280] [2023-08-24 11:49:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:49:20,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:49:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:49:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:49:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:49:20,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 215 [2023-08-24 11:49:20,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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 11:49:20,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:49:20,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 215 [2023-08-24 11:49:20,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:49:20,689 INFO L124 PetriNetUnfolderBase]: 245/512 cut-off events. [2023-08-24 11:49:20,689 INFO L125 PetriNetUnfolderBase]: For 1063/1080 co-relation queries the response was YES. [2023-08-24 11:49:20,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2012 conditions, 512 events. 245/512 cut-off events. For 1063/1080 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2721 event pairs, 31 based on Foata normal form. 30/530 useless extension candidates. Maximal degree in co-relation 1994. Up to 207 conditions per place. [2023-08-24 11:49:20,692 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 30 selfloop transitions, 11 changer transitions 6/50 dead transitions. [2023-08-24 11:49:20,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 369 flow [2023-08-24 11:49:20,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:49:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:49:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 677 transitions. [2023-08-24 11:49:20,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5248062015503876 [2023-08-24 11:49:20,694 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 677 transitions. [2023-08-24 11:49:20,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 677 transitions. [2023-08-24 11:49:20,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:49:20,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 677 transitions. [2023-08-24 11:49:20,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 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 11:49:20,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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 11:49:20,699 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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 11:49:20,699 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 197 flow. Second operand 6 states and 677 transitions. [2023-08-24 11:49:20,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 369 flow [2023-08-24 11:49:20,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 343 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-24 11:49:20,702 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 207 flow [2023-08-24 11:49:20,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2023-08-24 11:49:20,702 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2023-08-24 11:49:20,702 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 207 flow [2023-08-24 11:49:20,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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 11:49:20,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:49:20,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:49:20,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:49:20,703 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:49:20,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:49:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1752676488, now seen corresponding path program 1 times [2023-08-24 11:49:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:49:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295973053] [2023-08-24 11:49:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:49:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:49:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:49:20,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:49:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:49:20,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:49:20,804 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:49:20,804 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 11:49:20,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 11:49:20,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 11:49:20,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 11:49:20,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:49:20,807 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-24 11:49:20,811 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:49:20,811 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:49:20,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:49:20 BasicIcfg [2023-08-24 11:49:20,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:49:20,896 INFO L158 Benchmark]: Toolchain (without parser) took 13070.70ms. Allocated memory was 404.8MB in the beginning and 671.1MB in the end (delta: 266.3MB). Free memory was 359.3MB in the beginning and 426.5MB in the end (delta: -67.2MB). Peak memory consumption was 200.8MB. Max. memory is 16.0GB. [2023-08-24 11:49:20,902 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 404.8MB. Free memory is still 382.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:49:20,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.94ms. Allocated memory is still 404.8MB. Free memory was 359.0MB in the beginning and 379.3MB in the end (delta: -20.3MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. [2023-08-24 11:49:20,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.06ms. Allocated memory is still 404.8MB. Free memory was 379.3MB in the beginning and 376.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:49:20,903 INFO L158 Benchmark]: Boogie Preprocessor took 26.31ms. Allocated memory is still 404.8MB. Free memory was 376.8MB in the beginning and 375.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:49:20,903 INFO L158 Benchmark]: RCFGBuilder took 705.48ms. Allocated memory is still 404.8MB. Free memory was 374.7MB in the beginning and 326.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. [2023-08-24 11:49:20,903 INFO L158 Benchmark]: TraceAbstraction took 11734.56ms. Allocated memory was 404.8MB in the beginning and 671.1MB in the end (delta: 266.3MB). Free memory was 325.5MB in the beginning and 426.5MB in the end (delta: -101.0MB). Peak memory consumption was 164.9MB. Max. memory is 16.0GB. [2023-08-24 11:49:20,905 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 404.8MB. Free memory is still 382.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 543.94ms. Allocated memory is still 404.8MB. Free memory was 359.0MB in the beginning and 379.3MB in the end (delta: -20.3MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.06ms. Allocated memory is still 404.8MB. Free memory was 379.3MB in the beginning and 376.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.31ms. Allocated memory is still 404.8MB. Free memory was 376.8MB in the beginning and 375.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 705.48ms. Allocated memory is still 404.8MB. Free memory was 374.7MB in the beginning and 326.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. * TraceAbstraction took 11734.56ms. Allocated memory was 404.8MB in the beginning and 671.1MB in the end (delta: 266.3MB). Free memory was 325.5MB in the beginning and 426.5MB in the end (delta: -101.0MB). Peak memory consumption was 164.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 117 PlacesBefore, 30 PlacesAfterwards, 108 TransitionsBefore, 21 TransitionsAfterwards, 1064 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 2996 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1267, independent: 1089, independent conditional: 0, independent unconditional: 1089, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 552, independent: 521, independent conditional: 0, independent unconditional: 521, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1267, independent: 568, independent conditional: 0, independent unconditional: 568, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 552, unknown conditional: 0, unknown unconditional: 552] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=-1, t2213={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] 0 pthread_t t2214; [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=0, t2213={7:0}, t2214={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L835] 0 pthread_t t2215; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=1, t2213={7:0}, t2214={5:0}, t2215={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L803] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213={7:0}, t2214={5:0}, t2215={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213={7:0}, t2214={5:0}, t2215={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 834]: 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: 832]: 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: 836]: 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 7 procedures, 146 locations, 4 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.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 729 IncrementalHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1 mSDtfsCounter, 729 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=9, InterpolantAutomatonStates: 48, 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.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 11:49:20,932 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...