./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:53:32,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:53:32,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:53:32,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:53:32,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:53:32,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:53:32,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:53:32,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:53:32,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:53:32,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:53:32,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:53:32,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:53:32,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:53:32,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:53:32,728 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:53:32,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:53:32,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:53:32,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:53:32,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:53:32,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:53:32,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:53:32,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:53:32,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:53:32,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:53:32,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:53:32,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:53:32,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:53:32,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:53:32,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:53:32,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:53:32,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:53:32,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:53:32,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:53:32,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:53:32,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:53:32,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:53:32,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:53:32,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:53:32,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:53:32,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:53:32,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:53:32,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:53:32,738 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2024-11-09 02:53:32,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:53:32,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:53:32,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:53:32,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:53:32,965 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:53:32,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-09 02:53:34,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:53:34,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:53:34,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-09 02:53:34,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f193125d5/5e48a4a4da44471fa9f387b15662c20f/FLAG3ceac6422 [2024-11-09 02:53:34,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f193125d5/5e48a4a4da44471fa9f387b15662c20f [2024-11-09 02:53:34,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:53:34,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:53:34,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:53:34,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:53:34,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:53:34,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c01f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34, skipping insertion in model container [2024-11-09 02:53:34,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:53:34,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i[33026,33039] [2024-11-09 02:53:34,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:53:34,828 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:53:34,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i[33026,33039] [2024-11-09 02:53:34,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:53:34,895 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:53:34,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34 WrapperNode [2024-11-09 02:53:34,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:53:34,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:53:34,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:53:34,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:53:34,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,936 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2024-11-09 02:53:34,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:53:34,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:53:34,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:53:34,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:53:34,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 02:53:34,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:34,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:35,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:53:35,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:53:35,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:53:35,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:53:35,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (1/1) ... [2024-11-09 02:53:35,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:53:35,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:35,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:53:35,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:53:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:53:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 02:53:35,084 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 02:53:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 02:53:35,084 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 02:53:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:53:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:53:35,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:53:35,087 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:53:35,219 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:53:35,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:53:35,331 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:53:35,331 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:53:35,399 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:53:35,399 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:53:35,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:53:35 BoogieIcfgContainer [2024-11-09 02:53:35,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:53:35,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:53:35,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:53:35,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:53:35,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:53:34" (1/3) ... [2024-11-09 02:53:35,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103a524f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:53:35, skipping insertion in model container [2024-11-09 02:53:35,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:34" (2/3) ... [2024-11-09 02:53:35,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103a524f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:53:35, skipping insertion in model container [2024-11-09 02:53:35,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:53:35" (3/3) ... [2024-11-09 02:53:35,406 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-09 02:53:35,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:53:35,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:53:35,419 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:53:35,459 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 02:53:35,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 62 flow [2024-11-09 02:53:35,510 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-11-09 02:53:35,511 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 02:53:35,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 3/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2024-11-09 02:53:35,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 62 flow [2024-11-09 02:53:35,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 49 flow [2024-11-09 02:53:35,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:53:35,528 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@191bd507, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:53:35,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 02:53:35,536 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:53:35,537 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-11-09 02:53:35,537 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:53:35,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:35,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:35,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:35,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash -367970190, now seen corresponding path program 1 times [2024-11-09 02:53:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512151433] [2024-11-09 02:53:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:35,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512151433] [2024-11-09 02:53:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512151433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:35,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:35,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:53:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461366849] [2024-11-09 02:53:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:35,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:53:35,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:35,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:53:35,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:53:35,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:53:35,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 49 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2024-11-09 02:53:35,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:35,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:53:35,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:36,018 INFO L124 PetriNetUnfolderBase]: 151/284 cut-off events. [2024-11-09 02:53:36,020 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-09 02:53:36,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 284 events. 151/284 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 68 based on Foata normal form. 11/239 useless extension candidates. Maximal degree in co-relation 520. Up to 145 conditions per place. [2024-11-09 02:53:36,025 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 7 changer transitions 6/41 dead transitions. [2024-11-09 02:53:36,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 176 flow [2024-11-09 02:53:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:53:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:53:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-11-09 02:53:36,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-11-09 02:53:36,035 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 49 flow. Second operand 6 states and 70 transitions. [2024-11-09 02:53:36,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 176 flow [2024-11-09 02:53:36,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 02:53:36,039 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 83 flow [2024-11-09 02:53:36,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=83, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-11-09 02:53:36,043 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2024-11-09 02:53:36,043 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 83 flow [2024-11-09 02:53:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2024-11-09 02:53:36,043 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:36,043 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:36,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:53:36,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:36,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1477795366, now seen corresponding path program 1 times [2024-11-09 02:53:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199743461] [2024-11-09 02:53:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:36,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199743461] [2024-11-09 02:53:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199743461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:36,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:36,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:53:36,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520134934] [2024-11-09 02:53:36,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:36,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:53:36,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:36,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:53:36,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:53:36,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:53:36,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-11-09 02:53:36,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:36,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:53:36,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:36,234 INFO L124 PetriNetUnfolderBase]: 106/228 cut-off events. [2024-11-09 02:53:36,234 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-09 02:53:36,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 228 events. 106/228 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 877 event pairs, 27 based on Foata normal form. 13/226 useless extension candidates. Maximal degree in co-relation 355. Up to 85 conditions per place. [2024-11-09 02:53:36,236 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 16 selfloop transitions, 3 changer transitions 18/40 dead transitions. [2024-11-09 02:53:36,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 212 flow [2024-11-09 02:53:36,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:53:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:53:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-11-09 02:53:36,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-09 02:53:36,238 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 83 flow. Second operand 5 states and 60 transitions. [2024-11-09 02:53:36,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 212 flow [2024-11-09 02:53:36,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:36,240 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 76 flow [2024-11-09 02:53:36,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2024-11-09 02:53:36,241 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2024-11-09 02:53:36,241 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 76 flow [2024-11-09 02:53:36,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-11-09 02:53:36,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:36,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:36,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:53:36,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:36,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:36,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1171723523, now seen corresponding path program 1 times [2024-11-09 02:53:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332237898] [2024-11-09 02:53:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:36,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:36,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332237898] [2024-11-09 02:53:36,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332237898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:36,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309455273] [2024-11-09 02:53:36,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:36,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:36,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:36,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:36,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:53:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:36,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:53:36,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:36,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309455273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:36,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:36,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-09 02:53:36,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485189622] [2024-11-09 02:53:36,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:36,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:53:36,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:36,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:53:36,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:53:36,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2024-11-09 02:53:36,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 76 flow. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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) [2024-11-09 02:53:36,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:36,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2024-11-09 02:53:36,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:36,821 INFO L124 PetriNetUnfolderBase]: 64/135 cut-off events. [2024-11-09 02:53:36,822 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-11-09 02:53:36,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 135 events. 64/135 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 324 event pairs, 18 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 341. Up to 54 conditions per place. [2024-11-09 02:53:36,825 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 27 selfloop transitions, 8 changer transitions 4/40 dead transitions. [2024-11-09 02:53:36,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 209 flow [2024-11-09 02:53:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:53:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 02:53:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2024-11-09 02:53:36,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2024-11-09 02:53:36,830 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 76 flow. Second operand 9 states and 69 transitions. [2024-11-09 02:53:36,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 209 flow [2024-11-09 02:53:36,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 187 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-11-09 02:53:36,832 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 93 flow [2024-11-09 02:53:36,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2024-11-09 02:53:36,836 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2024-11-09 02:53:36,836 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 93 flow [2024-11-09 02:53:36,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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) [2024-11-09 02:53:36,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:36,837 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:36,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:53:37,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:37,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:37,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1585841525, now seen corresponding path program 2 times [2024-11-09 02:53:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:37,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041131199] [2024-11-09 02:53:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 02:53:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:37,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041131199] [2024-11-09 02:53:37,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041131199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:37,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929130552] [2024-11-09 02:53:37,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:53:37,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:37,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:37,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:37,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:53:37,192 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:53:37,192 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:53:37,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 02:53:37,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:37,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:37,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929130552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:37,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:37,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2024-11-09 02:53:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416004992] [2024-11-09 02:53:37,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:37,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 02:53:37,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:37,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 02:53:37,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:53:37,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2024-11-09 02:53:37,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 93 flow. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 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) [2024-11-09 02:53:37,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:37,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2024-11-09 02:53:37,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:37,979 INFO L124 PetriNetUnfolderBase]: 206/421 cut-off events. [2024-11-09 02:53:37,979 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2024-11-09 02:53:37,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1399 conditions, 421 events. 206/421 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1533 event pairs, 24 based on Foata normal form. 60/477 useless extension candidates. Maximal degree in co-relation 690. Up to 171 conditions per place. [2024-11-09 02:53:37,985 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 13 changer transitions 93/151 dead transitions. [2024-11-09 02:53:37,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 151 transitions, 858 flow [2024-11-09 02:53:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 02:53:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-09 02:53:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 270 transitions. [2024-11-09 02:53:37,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-11-09 02:53:37,987 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 93 flow. Second operand 36 states and 270 transitions. [2024-11-09 02:53:37,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 151 transitions, 858 flow [2024-11-09 02:53:37,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 151 transitions, 819 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-09 02:53:37,992 INFO L231 Difference]: Finished difference. Result has 87 places, 25 transitions, 189 flow [2024-11-09 02:53:37,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=189, PETRI_PLACES=87, PETRI_TRANSITIONS=25} [2024-11-09 02:53:37,993 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 63 predicate places. [2024-11-09 02:53:37,993 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 25 transitions, 189 flow [2024-11-09 02:53:37,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 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) [2024-11-09 02:53:37,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:37,993 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:38,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 02:53:38,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 02:53:38,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:38,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:38,195 INFO L85 PathProgramCache]: Analyzing trace with hash 992707319, now seen corresponding path program 1 times [2024-11-09 02:53:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:38,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003925319] [2024-11-09 02:53:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003925319] [2024-11-09 02:53:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003925319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523152692] [2024-11-09 02:53:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:38,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:38,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:38,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:38,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 02:53:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:38,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 02:53:38,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:38,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:38,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523152692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:38,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:38,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2024-11-09 02:53:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677939018] [2024-11-09 02:53:38,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:38,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 02:53:38,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:38,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 02:53:38,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 02:53:38,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:53:38,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 25 transitions, 189 flow. Second operand has 39 states, 39 states have (on average 6.282051282051282) internal successors, (245), 39 states have internal predecessors, (245), 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) [2024-11-09 02:53:38,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:38,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:53:38,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:39,370 INFO L124 PetriNetUnfolderBase]: 137/289 cut-off events. [2024-11-09 02:53:39,370 INFO L125 PetriNetUnfolderBase]: For 7183/7183 co-relation queries the response was YES. [2024-11-09 02:53:39,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 289 events. 137/289 cut-off events. For 7183/7183 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 664 event pairs, 12 based on Foata normal form. 60/349 useless extension candidates. Maximal degree in co-relation 1025. Up to 106 conditions per place. [2024-11-09 02:53:39,373 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 79 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2024-11-09 02:53:39,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 106 transitions, 655 flow [2024-11-09 02:53:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 02:53:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-09 02:53:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 246 transitions. [2024-11-09 02:53:39,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2024-11-09 02:53:39,375 INFO L175 Difference]: Start difference. First operand has 87 places, 25 transitions, 189 flow. Second operand 26 states and 246 transitions. [2024-11-09 02:53:39,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 106 transitions, 655 flow [2024-11-09 02:53:39,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 543 flow, removed 49 selfloop flow, removed 25 redundant places. [2024-11-09 02:53:39,386 INFO L231 Difference]: Finished difference. Result has 76 places, 37 transitions, 273 flow [2024-11-09 02:53:39,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=273, PETRI_PLACES=76, PETRI_TRANSITIONS=37} [2024-11-09 02:53:39,388 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 52 predicate places. [2024-11-09 02:53:39,388 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 37 transitions, 273 flow [2024-11-09 02:53:39,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.282051282051282) internal successors, (245), 39 states have internal predecessors, (245), 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) [2024-11-09 02:53:39,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:39,389 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:39,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 02:53:39,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:39,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:39,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1267414409, now seen corresponding path program 2 times [2024-11-09 02:53:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:39,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364288651] [2024-11-09 02:53:39,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364288651] [2024-11-09 02:53:40,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364288651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471938117] [2024-11-09 02:53:40,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:53:40,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:40,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:40,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:40,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 02:53:40,128 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:53:40,128 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:53:40,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 02:53:40,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:40,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:41,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471938117] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:41,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 74 [2024-11-09 02:53:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110447944] [2024-11-09 02:53:41,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:41,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-09 02:53:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-09 02:53:41,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2264, Invalid=3286, Unknown=0, NotChecked=0, Total=5550 [2024-11-09 02:53:41,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:53:41,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 37 transitions, 273 flow. Second operand has 75 states, 75 states have (on average 6.1466666666666665) internal successors, (461), 75 states have internal predecessors, (461), 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) [2024-11-09 02:53:41,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:41,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:53:41,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:42,673 INFO L124 PetriNetUnfolderBase]: 257/529 cut-off events. [2024-11-09 02:53:42,674 INFO L125 PetriNetUnfolderBase]: For 26284/26284 co-relation queries the response was YES. [2024-11-09 02:53:42,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 529 events. 257/529 cut-off events. For 26284/26284 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1225 event pairs, 12 based on Foata normal form. 120/649 useless extension candidates. Maximal degree in co-relation 1835. Up to 196 conditions per place. [2024-11-09 02:53:42,677 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 151 selfloop transitions, 49 changer transitions 0/202 dead transitions. [2024-11-09 02:53:42,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 202 transitions, 1195 flow [2024-11-09 02:53:42,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 02:53:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-11-09 02:53:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 474 transitions. [2024-11-09 02:53:42,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.395 [2024-11-09 02:53:42,679 INFO L175 Difference]: Start difference. First operand has 76 places, 37 transitions, 273 flow. Second operand 50 states and 474 transitions. [2024-11-09 02:53:42,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 202 transitions, 1195 flow [2024-11-09 02:53:42,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 202 transitions, 1047 flow, removed 61 selfloop flow, removed 13 redundant places. [2024-11-09 02:53:42,689 INFO L231 Difference]: Finished difference. Result has 136 places, 61 transitions, 513 flow [2024-11-09 02:53:42,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=513, PETRI_PLACES=136, PETRI_TRANSITIONS=61} [2024-11-09 02:53:42,690 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 112 predicate places. [2024-11-09 02:53:42,690 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 61 transitions, 513 flow [2024-11-09 02:53:42,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 6.1466666666666665) internal successors, (461), 75 states have internal predecessors, (461), 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) [2024-11-09 02:53:42,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:42,691 INFO L204 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:42,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 02:53:42,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:42,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:42,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:42,892 INFO L85 PathProgramCache]: Analyzing trace with hash 207198583, now seen corresponding path program 3 times [2024-11-09 02:53:42,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:42,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425189369] [2024-11-09 02:53:42,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:42,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425189369] [2024-11-09 02:53:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425189369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265397777] [2024-11-09 02:53:44,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 02:53:44,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:44,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:44,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:44,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 02:53:44,232 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-11-09 02:53:44,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:53:44,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 02:53:44,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:45,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265397777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:47,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 146 [2024-11-09 02:53:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984207988] [2024-11-09 02:53:47,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:47,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2024-11-09 02:53:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:47,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2024-11-09 02:53:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9128, Invalid=12334, Unknown=0, NotChecked=0, Total=21462 [2024-11-09 02:53:47,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:53:47,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 61 transitions, 513 flow. Second operand has 147 states, 147 states have (on average 6.074829931972789) internal successors, (893), 147 states have internal predecessors, (893), 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) [2024-11-09 02:53:47,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:47,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:53:47,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:52,075 INFO L124 PetriNetUnfolderBase]: 497/1009 cut-off events. [2024-11-09 02:53:52,075 INFO L125 PetriNetUnfolderBase]: For 242560/242560 co-relation queries the response was YES. [2024-11-09 02:53:52,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 1009 events. 497/1009 cut-off events. For 242560/242560 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2346 event pairs, 12 based on Foata normal form. 240/1249 useless extension candidates. Maximal degree in co-relation 3635. Up to 376 conditions per place. [2024-11-09 02:53:52,082 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 295 selfloop transitions, 97 changer transitions 0/394 dead transitions. [2024-11-09 02:53:52,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 394 transitions, 2347 flow [2024-11-09 02:53:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-09 02:53:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2024-11-09 02:53:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 930 transitions. [2024-11-09 02:53:52,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39540816326530615 [2024-11-09 02:53:52,085 INFO L175 Difference]: Start difference. First operand has 136 places, 61 transitions, 513 flow. Second operand 98 states and 930 transitions. [2024-11-09 02:53:52,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 394 transitions, 2347 flow [2024-11-09 02:53:52,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 394 transitions, 2055 flow, removed 121 selfloop flow, removed 25 redundant places. [2024-11-09 02:53:52,132 INFO L231 Difference]: Finished difference. Result has 256 places, 109 transitions, 993 flow [2024-11-09 02:53:52,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=993, PETRI_PLACES=256, PETRI_TRANSITIONS=109} [2024-11-09 02:53:52,133 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 232 predicate places. [2024-11-09 02:53:52,134 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 109 transitions, 993 flow [2024-11-09 02:53:52,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 147 states have (on average 6.074829931972789) internal successors, (893), 147 states have internal predecessors, (893), 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) [2024-11-09 02:53:52,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:52,135 INFO L204 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:52,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 02:53:52,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:52,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:53:52,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash -907266185, now seen corresponding path program 4 times [2024-11-09 02:53:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:52,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639943955] [2024-11-09 02:53:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:52,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:56,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:56,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639943955] [2024-11-09 02:53:56,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639943955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:56,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982351673] [2024-11-09 02:53:56,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 02:53:56,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:56,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:56,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:56,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 02:53:56,376 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 02:53:56,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:53:56,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-09 02:53:56,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:53:59,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:54:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:54:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982351673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:54:03,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:54:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2024-11-09 02:54:03,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892901599] [2024-11-09 02:54:03,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:54:03,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2024-11-09 02:54:03,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:54:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2024-11-09 02:54:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15142, Invalid=25460, Unknown=0, NotChecked=0, Total=40602 [2024-11-09 02:54:03,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:54:03,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 109 transitions, 993 flow. Second operand has 202 states, 202 states have (on average 6.0594059405940595) internal successors, (1224), 202 states have internal predecessors, (1224), 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) [2024-11-09 02:54:03,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:54:03,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:54:03,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:54:10,012 INFO L124 PetriNetUnfolderBase]: 532/1079 cut-off events. [2024-11-09 02:54:10,012 INFO L125 PetriNetUnfolderBase]: For 170993/170993 co-relation queries the response was YES. [2024-11-09 02:54:10,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 1079 events. 532/1079 cut-off events. For 170993/170993 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2510 event pairs, 12 based on Foata normal form. 35/1114 useless extension candidates. Maximal degree in co-relation 4120. Up to 291 conditions per place. [2024-11-09 02:54:10,024 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 316 selfloop transitions, 104 changer transitions 0/422 dead transitions. [2024-11-09 02:54:10,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 422 transitions, 2604 flow [2024-11-09 02:54:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-09 02:54:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2024-11-09 02:54:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 952 transitions. [2024-11-09 02:54:10,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-11-09 02:54:10,033 INFO L175 Difference]: Start difference. First operand has 256 places, 109 transitions, 993 flow. Second operand 105 states and 952 transitions. [2024-11-09 02:54:10,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 422 transitions, 2604 flow [2024-11-09 02:54:10,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 422 transitions, 2202 flow, removed 152 selfloop flow, removed 49 redundant places. [2024-11-09 02:54:10,174 INFO L231 Difference]: Finished difference. Result has 318 places, 116 transitions, 885 flow [2024-11-09 02:54:10,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=885, PETRI_PLACES=318, PETRI_TRANSITIONS=116} [2024-11-09 02:54:10,176 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, 294 predicate places. [2024-11-09 02:54:10,177 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 116 transitions, 885 flow [2024-11-09 02:54:10,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 202 states, 202 states have (on average 6.0594059405940595) internal successors, (1224), 202 states have internal predecessors, (1224), 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) [2024-11-09 02:54:10,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:54:10,178 INFO L204 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:54:10,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 02:54:10,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:54:10,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:54:10,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:54:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1686146049, now seen corresponding path program 5 times [2024-11-09 02:54:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:54:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723394217] [2024-11-09 02:54:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:54:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:54:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:54:10,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:54:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:54:10,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:54:10,507 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:54:10,509 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-09 02:54:10,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-09 02:54:10,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-09 02:54:10,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-09 02:54:10,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:54:10,511 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2024-11-09 02:54:10,612 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 02:54:10,612 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:54:10,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:54:10 BasicIcfg [2024-11-09 02:54:10,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:54:10,619 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:54:10,619 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:54:10,619 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:54:10,619 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:53:35" (3/4) ... [2024-11-09 02:54:10,620 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 02:54:10,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 02:54:10,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:54:10,680 INFO L158 Benchmark]: Toolchain (without parser) took 36195.61ms. Allocated memory was 146.8MB in the beginning and 738.2MB in the end (delta: 591.4MB). Free memory was 90.1MB in the beginning and 626.2MB in the end (delta: -536.1MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2024-11-09 02:54:10,680 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:54:10,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.73ms. Allocated memory is still 146.8MB. Free memory was 89.8MB in the beginning and 67.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 02:54:10,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.55ms. Allocated memory is still 146.8MB. Free memory was 67.1MB in the beginning and 117.6MB in the end (delta: -50.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-09 02:54:10,680 INFO L158 Benchmark]: Boogie Preprocessor took 45.07ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 117.5MB in the beginning and 162.3MB in the end (delta: -44.7MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-11-09 02:54:10,681 INFO L158 Benchmark]: RCFGBuilder took 397.55ms. Allocated memory is still 190.8MB. Free memory was 162.3MB in the beginning and 143.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 02:54:10,681 INFO L158 Benchmark]: TraceAbstraction took 35216.83ms. Allocated memory was 190.8MB in the beginning and 738.2MB in the end (delta: 547.4MB). Free memory was 142.3MB in the beginning and 640.9MB in the end (delta: -498.6MB). Peak memory consumption was 450.4MB. Max. memory is 16.1GB. [2024-11-09 02:54:10,681 INFO L158 Benchmark]: Witness Printer took 60.58ms. Allocated memory is still 738.2MB. Free memory was 640.9MB in the beginning and 626.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 02:54:10,682 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.17ms. Allocated memory is still 146.8MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.73ms. Allocated memory is still 146.8MB. Free memory was 89.8MB in the beginning and 67.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.55ms. Allocated memory is still 146.8MB. Free memory was 67.1MB in the beginning and 117.6MB in the end (delta: -50.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.07ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 117.5MB in the beginning and 162.3MB in the end (delta: -44.7MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * RCFGBuilder took 397.55ms. Allocated memory is still 190.8MB. Free memory was 162.3MB in the beginning and 143.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35216.83ms. Allocated memory was 190.8MB in the beginning and 738.2MB in the end (delta: 547.4MB). Free memory was 142.3MB in the beginning and 640.9MB in the end (delta: -498.6MB). Peak memory consumption was 450.4MB. Max. memory is 16.1GB. * Witness Printer took 60.58ms. Allocated memory is still 738.2MB. Free memory was 640.9MB in the beginning and 626.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=0] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=0, t2=1] [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, _N=100, arg={0:0}, expression=0, limit=101] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, _N=100, arg={0:0}, expression=0, limit=101] - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 37 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: 35.0s, OverallIterations: 9, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5422 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5414 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2461 IncrementalHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 4 mSDtfsCounter, 2461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 987 GetRequests, 104 SyntacticMatches, 91 SemanticMatches, 792 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67039 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=993occurred in iteration=7, InterpolantAutomatonStates: 335, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 726 ConstructedInterpolants, 0 QuantifiedInterpolants, 3553 SizeOfPredicates, 23 NumberOfNonLiveVariables, 997 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 7/17596 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! [2024-11-09 02:54:10,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE