./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b8a2d8a35be535b4f8c573d98b12278b19043c6b0cec82927e2ac6d7dd36ebb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:00:29,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:00:29,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-12 00:00:29,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:00:29,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:00:29,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:00:29,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:00:29,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:00:29,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:00:29,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:00:29,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 00:00:29,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 00:00:29,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:00:29,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:00:29,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:00:29,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:00:29,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 00:00:29,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:00:29,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:00:29,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:00:29,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:00:29,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 00:00:29,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 00:00:29,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 00:00:29,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:00:29,630 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-12 00:00:29,631 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:00:29,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:00:29,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:00:29,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:00:29,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:00:29,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:00:29,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 00:00:29,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 00:00:29,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 00:00:29,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:00:29,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 00:00:29,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 00:00:29,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:00:29,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 00:00:29,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 00:00:29,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 00:00:29,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 00:00:29,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 00:00:29,638 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-clean/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-clean/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 ! overflow) ) 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 -> 7b8a2d8a35be535b4f8c573d98b12278b19043c6b0cec82927e2ac6d7dd36ebb [2024-10-12 00:00:29,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:00:29,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:00:29,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:00:29,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:00:29,952 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:00:29,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.i [2024-10-12 00:00:31,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:00:31,801 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:00:31,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.i [2024-10-12 00:00:31,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/52fb40944/9cbb92a36f6542de9ef85b3633848663/FLAGcd3c6aa83 [2024-10-12 00:00:32,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/52fb40944/9cbb92a36f6542de9ef85b3633848663 [2024-10-12 00:00:32,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:00:32,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:00:32,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:00:32,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:00:32,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:00:32,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a8d835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32, skipping insertion in model container [2024-10-12 00:00:32,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:00:32,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:00:32,584 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:00:32,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:00:32,735 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:00:32,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32 WrapperNode [2024-10-12 00:00:32,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:00:32,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:00:32,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:00:32,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:00:32,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,786 INFO L138 Inliner]: procedures = 163, calls = 43, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 142 [2024-10-12 00:00:32,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:00:32,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:00:32,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:00:32,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:00:32,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,820 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-12 00:00:32,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:00:32,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:00:32,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:00:32,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:00:32,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (1/1) ... [2024-10-12 00:00:32,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 00:00:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:00:32,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 00:00:32,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 00:00:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-12 00:00:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:00:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-12 00:00:32,940 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-12 00:00:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:00:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:00:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 00:00:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 00:00:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-12 00:00:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:00:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:00:32,944 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-12 00:00:33,110 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:00:33,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:00:33,438 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-12 00:00:33,441 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:00:33,694 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:00:33,696 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 00:00:33,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:00:33 BoogieIcfgContainer [2024-10-12 00:00:33,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:00:33,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 00:00:33,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 00:00:33,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 00:00:33,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 12:00:32" (1/3) ... [2024-10-12 00:00:33,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a31d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 12:00:33, skipping insertion in model container [2024-10-12 00:00:33,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:00:32" (2/3) ... [2024-10-12 00:00:33,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a31d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 12:00:33, skipping insertion in model container [2024-10-12 00:00:33,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:00:33" (3/3) ... [2024-10-12 00:00:33,710 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true.i [2024-10-12 00:00:33,733 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 00:00:33,734 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-12 00:00:33,734 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-12 00:00:33,788 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-12 00:00:33,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 98 flow [2024-10-12 00:00:33,875 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-10-12 00:00:33,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-12 00:00:33,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-10-12 00:00:33,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 47 transitions, 98 flow [2024-10-12 00:00:33,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 45 transitions, 93 flow [2024-10-12 00:00:33,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 00:00:33,903 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;@3c96b592, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 00:00:33,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-12 00:00:33,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-12 00:00:33,911 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-10-12 00:00:33,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-12 00:00:33,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:33,912 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:33,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:33,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1868909197, now seen corresponding path program 1 times [2024-10-12 00:00:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:33,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311028778] [2024-10-12 00:00:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:00:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:00:34,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:00:34,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311028778] [2024-10-12 00:00:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311028778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:00:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:00:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:00:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045383367] [2024-10-12 00:00:34,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:00:34,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 00:00:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:00:34,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:00:34,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:00:34,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-10-12 00:00:34,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-10-12 00:00:34,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-12 00:00:34,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-10-12 00:00:34,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-12 00:00:34,567 INFO L124 PetriNetUnfolderBase]: 193/501 cut-off events. [2024-10-12 00:00:34,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-12 00:00:34,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 501 events. 193/501 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2407 event pairs, 165 based on Foata normal form. 12/483 useless extension candidates. Maximal degree in co-relation 893. Up to 373 conditions per place. [2024-10-12 00:00:34,576 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 35 selfloop transitions, 2 changer transitions 4/55 dead transitions. [2024-10-12 00:00:34,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 195 flow [2024-10-12 00:00:34,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:00:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-12 00:00:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-10-12 00:00:34,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2024-10-12 00:00:34,591 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 93 flow. Second operand 3 states and 87 transitions. [2024-10-12 00:00:34,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 195 flow [2024-10-12 00:00:34,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-12 00:00:34,596 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 94 flow [2024-10-12 00:00:34,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2024-10-12 00:00:34,604 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2024-10-12 00:00:34,604 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 94 flow [2024-10-12 00:00:34,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-10-12 00:00:34,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:34,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:34,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 00:00:34,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:34,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:34,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2101610671, now seen corresponding path program 1 times [2024-10-12 00:00:34,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:34,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687477199] [2024-10-12 00:00:34,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:34,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:00:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:00:34,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:00:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687477199] [2024-10-12 00:00:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687477199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:00:34,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:00:34,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-12 00:00:34,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60184742] [2024-10-12 00:00:34,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:00:34,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 00:00:34,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:00:34,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:00:34,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:00:34,733 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-10-12 00:00:34,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-10-12 00:00:34,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-12 00:00:34,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-10-12 00:00:34,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-12 00:00:34,914 INFO L124 PetriNetUnfolderBase]: 181/471 cut-off events. [2024-10-12 00:00:34,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-12 00:00:34,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 471 events. 181/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2190 event pairs, 154 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 851. Up to 350 conditions per place. [2024-10-12 00:00:34,922 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 30 selfloop transitions, 2 changer transitions 11/54 dead transitions. [2024-10-12 00:00:34,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 194 flow [2024-10-12 00:00:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:00:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-12 00:00:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-10-12 00:00:34,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2024-10-12 00:00:34,926 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 94 flow. Second operand 3 states and 86 transitions. [2024-10-12 00:00:34,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 194 flow [2024-10-12 00:00:34,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-12 00:00:34,929 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 78 flow [2024-10-12 00:00:34,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-10-12 00:00:34,930 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-10-12 00:00:34,931 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 78 flow [2024-10-12 00:00:34,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-10-12 00:00:34,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:34,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:34,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 00:00:34,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:34,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash -826753573, now seen corresponding path program 1 times [2024-10-12 00:00:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:34,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11409878] [2024-10-12 00:00:34,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:00:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:00:35,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:00:35,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11409878] [2024-10-12 00:00:35,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11409878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:00:35,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:00:35,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:00:35,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055140225] [2024-10-12 00:00:35,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:00:35,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 00:00:35,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:00:35,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:00:35,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:00:35,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-10-12 00:00:35,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:00:35,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-12 00:00:35,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-10-12 00:00:35,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-12 00:00:35,347 INFO L124 PetriNetUnfolderBase]: 159/427 cut-off events. [2024-10-12 00:00:35,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-12 00:00:35,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 427 events. 159/427 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1930 event pairs, 75 based on Foata normal form. 32/454 useless extension candidates. Maximal degree in co-relation 796. Up to 223 conditions per place. [2024-10-12 00:00:35,350 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 28 selfloop transitions, 2 changer transitions 22/61 dead transitions. [2024-10-12 00:00:35,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 234 flow [2024-10-12 00:00:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:00:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-12 00:00:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-10-12 00:00:35,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5574468085106383 [2024-10-12 00:00:35,353 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 78 flow. Second operand 5 states and 131 transitions. [2024-10-12 00:00:35,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 234 flow [2024-10-12 00:00:35,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-12 00:00:35,357 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 90 flow [2024-10-12 00:00:35,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-10-12 00:00:35,358 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2024-10-12 00:00:35,358 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 90 flow [2024-10-12 00:00:35,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:00:35,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:35,359 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:35,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 00:00:35,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:35,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2095470248, now seen corresponding path program 1 times [2024-10-12 00:00:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:35,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319366849] [2024-10-12 00:00:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:00:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:00:35,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:00:35,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319366849] [2024-10-12 00:00:35,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319366849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:00:35,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:00:35,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:00:35,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921730372] [2024-10-12 00:00:35,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:00:35,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 00:00:35,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:00:35,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:00:35,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:00:35,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-10-12 00:00:35,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-10-12 00:00:35,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-12 00:00:35,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-10-12 00:00:35,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-12 00:00:35,759 INFO L124 PetriNetUnfolderBase]: 149/394 cut-off events. [2024-10-12 00:00:35,759 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2024-10-12 00:00:35,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 394 events. 149/394 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1809 event pairs, 62 based on Foata normal form. 12/401 useless extension candidates. Maximal degree in co-relation 817. Up to 183 conditions per place. [2024-10-12 00:00:35,765 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 55 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2024-10-12 00:00:35,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 286 flow [2024-10-12 00:00:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:00:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-12 00:00:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-10-12 00:00:35,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2024-10-12 00:00:35,773 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 90 flow. Second operand 6 states and 152 transitions. [2024-10-12 00:00:35,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 286 flow [2024-10-12 00:00:35,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 266 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-10-12 00:00:35,778 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2024-10-12 00:00:35,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-10-12 00:00:35,782 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2024-10-12 00:00:35,782 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2024-10-12 00:00:35,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-10-12 00:00:35,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:35,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:35,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 00:00:35,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:35,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash 535068688, now seen corresponding path program 1 times [2024-10-12 00:00:35,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:35,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326324111] [2024-10-12 00:00:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:35,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:00:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:00:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:00:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326324111] [2024-10-12 00:00:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326324111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:00:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:00:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:00:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079541418] [2024-10-12 00:00:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:00:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 00:00:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:00:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:00:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:00:35,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-10-12 00:00:35,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-10-12 00:00:35,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-12 00:00:35,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-10-12 00:00:35,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-12 00:00:36,155 INFO L124 PetriNetUnfolderBase]: 138/384 cut-off events. [2024-10-12 00:00:36,155 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-10-12 00:00:36,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 384 events. 138/384 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1779 event pairs, 62 based on Foata normal form. 12/391 useless extension candidates. Maximal degree in co-relation 785. Up to 183 conditions per place. [2024-10-12 00:00:36,157 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 37 selfloop transitions, 3 changer transitions 29/78 dead transitions. [2024-10-12 00:00:36,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 331 flow [2024-10-12 00:00:36,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:00:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-12 00:00:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-10-12 00:00:36,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5079787234042553 [2024-10-12 00:00:36,163 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 8 states and 191 transitions. [2024-10-12 00:00:36,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 331 flow [2024-10-12 00:00:36,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 326 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-12 00:00:36,166 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 100 flow [2024-10-12 00:00:36,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2024-10-12 00:00:36,167 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2024-10-12 00:00:36,167 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 100 flow [2024-10-12 00:00:36,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-10-12 00:00:36,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:36,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:36,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 00:00:36,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:36,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:36,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1111507631, now seen corresponding path program 1 times [2024-10-12 00:00:36,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:36,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974215682] [2024-10-12 00:00:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:00:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:00:36,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:00:36,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974215682] [2024-10-12 00:00:36,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974215682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:00:36,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:00:36,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:00:36,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323315455] [2024-10-12 00:00:36,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:00:36,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 00:00:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:00:36,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:00:36,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:00:36,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-10-12 00:00:36,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-10-12 00:00:36,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-12 00:00:36,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-10-12 00:00:36,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-12 00:00:36,443 INFO L124 PetriNetUnfolderBase]: 95/258 cut-off events. [2024-10-12 00:00:36,444 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-10-12 00:00:36,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 258 events. 95/258 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 966 event pairs, 42 based on Foata normal form. 11/267 useless extension candidates. Maximal degree in co-relation 538. Up to 103 conditions per place. [2024-10-12 00:00:36,446 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 38 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-10-12 00:00:36,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 224 flow [2024-10-12 00:00:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:00:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-12 00:00:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-10-12 00:00:36,448 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2024-10-12 00:00:36,448 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 100 flow. Second operand 6 states and 118 transitions. [2024-10-12 00:00:36,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 224 flow [2024-10-12 00:00:36,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 204 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-10-12 00:00:36,450 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 95 flow [2024-10-12 00:00:36,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-10-12 00:00:36,451 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-10-12 00:00:36,451 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 95 flow [2024-10-12 00:00:36,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-10-12 00:00:36,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:36,452 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:36,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 00:00:36,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:36,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash -96997753, now seen corresponding path program 1 times [2024-10-12 00:00:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:36,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057626977] [2024-10-12 00:00:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:00:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:00:36,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:00:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057626977] [2024-10-12 00:00:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057626977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:00:36,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:00:36,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:00:36,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863158551] [2024-10-12 00:00:36,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:00:36,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 00:00:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:00:36,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:00:36,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:00:36,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-12 00:00:36,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-10-12 00:00:36,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-12 00:00:36,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-12 00:00:36,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-12 00:00:36,731 INFO L124 PetriNetUnfolderBase]: 85/252 cut-off events. [2024-10-12 00:00:36,731 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-12 00:00:36,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 252 events. 85/252 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 945 event pairs, 36 based on Foata normal form. 11/261 useless extension candidates. Maximal degree in co-relation 504. Up to 108 conditions per place. [2024-10-12 00:00:36,733 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 31 selfloop transitions, 5 changer transitions 14/60 dead transitions. [2024-10-12 00:00:36,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 247 flow [2024-10-12 00:00:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:00:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-12 00:00:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-10-12 00:00:36,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.541033434650456 [2024-10-12 00:00:36,735 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 95 flow. Second operand 7 states and 178 transitions. [2024-10-12 00:00:36,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 247 flow [2024-10-12 00:00:36,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-12 00:00:36,737 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 114 flow [2024-10-12 00:00:36,737 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=114, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2024-10-12 00:00:36,738 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2024-10-12 00:00:36,738 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 114 flow [2024-10-12 00:00:36,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-10-12 00:00:36,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:36,738 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:36,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 00:00:36,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:36,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1763443410, now seen corresponding path program 1 times [2024-10-12 00:00:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:36,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393965486] [2024-10-12 00:00:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:00:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:00:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:00:36,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393965486] [2024-10-12 00:00:36,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393965486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:00:36,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:00:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:00:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616837451] [2024-10-12 00:00:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:00:36,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 00:00:36,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:00:36,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:00:36,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:00:36,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-12 00:00:36,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-10-12 00:00:36,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-12 00:00:36,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-12 00:00:36,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-12 00:00:37,052 INFO L124 PetriNetUnfolderBase]: 69/208 cut-off events. [2024-10-12 00:00:37,052 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-10-12 00:00:37,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 208 events. 69/208 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 703 event pairs, 23 based on Foata normal form. 7/213 useless extension candidates. Maximal degree in co-relation 490. Up to 91 conditions per place. [2024-10-12 00:00:37,055 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 34 selfloop transitions, 7 changer transitions 2/53 dead transitions. [2024-10-12 00:00:37,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 256 flow [2024-10-12 00:00:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:00:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-12 00:00:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-10-12 00:00:37,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2024-10-12 00:00:37,057 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 114 flow. Second operand 4 states and 114 transitions. [2024-10-12 00:00:37,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 256 flow [2024-10-12 00:00:37,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 230 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-10-12 00:00:37,061 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 122 flow [2024-10-12 00:00:37,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2024-10-12 00:00:37,063 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2024-10-12 00:00:37,063 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 122 flow [2024-10-12 00:00:37,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-10-12 00:00:37,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:37,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:37,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 00:00:37,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:37,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1457063391, now seen corresponding path program 1 times [2024-10-12 00:00:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:37,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648443085] [2024-10-12 00:00:37,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:00:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:00:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:00:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648443085] [2024-10-12 00:00:37,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648443085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:00:37,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:00:37,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:00:37,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562771241] [2024-10-12 00:00:37,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:00:37,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 00:00:37,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:00:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:00:37,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:00:37,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-12 00:00:37,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-10-12 00:00:37,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-12 00:00:37,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-12 00:00:37,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-12 00:00:37,415 INFO L124 PetriNetUnfolderBase]: 70/210 cut-off events. [2024-10-12 00:00:37,415 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2024-10-12 00:00:37,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 210 events. 70/210 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 716 event pairs, 31 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 488. Up to 102 conditions per place. [2024-10-12 00:00:37,417 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 33 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2024-10-12 00:00:37,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 236 flow [2024-10-12 00:00:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:00:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-12 00:00:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-12 00:00:37,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5797872340425532 [2024-10-12 00:00:37,419 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 122 flow. Second operand 4 states and 109 transitions. [2024-10-12 00:00:37,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 236 flow [2024-10-12 00:00:37,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-12 00:00:37,421 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 149 flow [2024-10-12 00:00:37,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-10-12 00:00:37,422 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2024-10-12 00:00:37,422 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 149 flow [2024-10-12 00:00:37,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-10-12 00:00:37,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-12 00:00:37,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:37,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 00:00:37,423 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-12 00:00:37,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:00:37,424 INFO L85 PathProgramCache]: Analyzing trace with hash -236367315, now seen corresponding path program 1 times [2024-10-12 00:00:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:00:37,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099898053] [2024-10-12 00:00:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:00:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:00:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:00:37,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:00:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:00:37,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:00:37,504 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 00:00:37,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2024-10-12 00:00:37,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2024-10-12 00:00:37,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2024-10-12 00:00:37,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-12 00:00:37,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2024-10-12 00:00:37,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2024-10-12 00:00:37,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2024-10-12 00:00:37,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 00:00:37,515 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:00:37,576 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-12 00:00:37,577 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 00:00:37,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 12:00:37 BasicIcfg [2024-10-12 00:00:37,584 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 00:00:37,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:00:37,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:00:37,585 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:00:37,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:00:33" (3/4) ... [2024-10-12 00:00:37,587 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 00:00:37,674 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:00:37,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:00:37,675 INFO L158 Benchmark]: Toolchain (without parser) took 5559.81ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 93.7MB in the beginning and 69.9MB in the end (delta: 23.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-10-12 00:00:37,675 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 163.6MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:00:37,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.19ms. Allocated memory is still 163.6MB. Free memory was 93.5MB in the beginning and 128.1MB in the end (delta: -34.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-10-12 00:00:37,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.96ms. Allocated memory is still 163.6MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:00:37,680 INFO L158 Benchmark]: Boogie Preprocessor took 49.63ms. Allocated memory is still 163.6MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:00:37,681 INFO L158 Benchmark]: RCFGBuilder took 858.03ms. Allocated memory is still 163.6MB. Free memory was 123.0MB in the beginning and 79.6MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-12 00:00:37,681 INFO L158 Benchmark]: TraceAbstraction took 3884.09ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 79.0MB in the beginning and 76.2MB in the end (delta: 2.8MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2024-10-12 00:00:37,681 INFO L158 Benchmark]: Witness Printer took 89.88ms. Allocated memory is still 220.2MB. Free memory was 76.2MB in the beginning and 69.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 00:00:37,683 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.26ms. Allocated memory is still 163.6MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.19ms. Allocated memory is still 163.6MB. Free memory was 93.5MB in the beginning and 128.1MB in the end (delta: -34.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.96ms. Allocated memory is still 163.6MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.63ms. Allocated memory is still 163.6MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 858.03ms. Allocated memory is still 163.6MB. Free memory was 123.0MB in the beginning and 79.6MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3884.09ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 79.0MB in the beginning and 76.2MB in the end (delta: 2.8MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * Witness Printer took 89.88ms. Allocated memory is still 220.2MB. Free memory was 76.2MB in the beginning and 69.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 701]: integer overflow possible integer overflow possible We found a FailurePath: [L682] 0 int g = 0; [L683] 0 int h = 0; [L684] 0 int i = 0; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L710] 0 int x = __VERIFIER_nondet_int(); [L711] COND TRUE 0 x > -1000 [L712] 0 pthread_t id; [L713] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, B={4:0}, C={5:0}, g=0, h=0, i=0, id=-1, x=2147483617] [L689] 1 int x = __VERIFIER_nondet_int(); [L690] 1 int y = __VERIFIER_nondet_int(); [L691] 1 int z = __VERIFIER_nondet_int(); [L692] COND TRUE 1 x < 1000 VAL [A={3:0}, B={4:0}, C={5:0}, \old(arg)={0:0}, arg={0:0}, g=0, h=0, i=0, x=0, y=0, z=0] [L716] 0 i = 11 [L717] 0 g = x VAL [A={3:0}, B={4:0}, C={5:0}, g=2147483617, h=0, i=11, id=-1, x=2147483617] [L718] EXPR 0 x - 17 [L718] 0 h = x - 17 VAL [A={3:0}, B={4:0}, C={5:0}, g=2147483617, h=2147483600, i=11, id=-1, x=2147483617] [L721] 0 h = x VAL [A={3:0}, B={4:0}, C={5:0}, g=2147483617, h=2147483617, i=11, id=-1, x=2147483617] [L695] 1 x = g [L696] 1 y = h [L697] CALL 1 __VERIFIER_assert(y <= x) [L19] COND FALSE 1 !(!(cond)) [L697] RET 1 __VERIFIER_assert(y <= x) [L699] CALL 1 __VERIFIER_assert(x == y) [L19] COND FALSE 1 !(!(cond)) [L699] RET 1 __VERIFIER_assert(x == y) [L701] 1 x + 31 VAL [A={3:0}, B={4:0}, C={5:0}, \old(arg)={0:0}, arg={0:0}, g=2147483617, h=2147483617, i=11, x=2147483617, y=2147483617, z=0] - UnprovableResult [Line: 718]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 713]: 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: 701]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 67 locations, 7 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: 3.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 865 IncrementalHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 8 mSDtfsCounter, 865 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=9, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-12 00:00:37,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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(OVERFLOW)